Given the following 2 sequences:  AGGCTAGTT  AGCGAAGTTT Write a program using dynamic programming that can: Find the minimum edit distance of the two sequences Determine the backward path of minimum edit distance which provides minimum edit distance alignment Align the two sequences with minimum edit distance using standard alignment format such as the following: (note this one may not give minimum edit distance) AGGCTA-GTT-  AG-CGAAGTTT

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 6PE
icon
Related questions
Question

Given the following 2 sequences: 

AGGCTAGTT 

AGCGAAGTTT

Write a program using dynamic programming that can:

  1. Find the minimum edit distance of the two sequences
  2. Determine the backward path of minimum edit distance which provides minimum edit distance alignment
  3. Align the two sequences with minimum edit distance using standard alignment format such as the following: (note this one may not give minimum edit distance)

AGGCTA-GTT- 

AG-CGAAGTTT

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Potential Method of Analysis
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning