Show the optimal path taken at each step in the matrix
using dynamic programming of the global alignment. Use match score = 1, Gap Penalty = -1, and mismatch penalty = -1. Show the optimal path taken at each step in the matrix. Show the optimal alignment obtained
• 344 views
•
link
written
by
alan.jacob21 •
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
DNA Sequence Alignment Scoring With Extended Gap and Similarity Matrix
written by anonymouspenguin •
-
Alignment through Dynamic programming
written by anasjamshed
-
Help with dynamic programming algorithm
written by laura_savana •
-
match, mismatch, gap parameters for short DNA motifs
written by odoluca •
-
needleman-wunsch algorithm on python
written by elisheva
-
A global alignment problem with affine gap penalty
written by yokotze118 •
-
Scoring matrix of 3 sequence alignment
written by mhasa006
-
objective function of the needleman-wunsch algorithm
written by lait
-
Effect of changing scoring functions on Optimal alignment ?
written by mamai •
-
Gap Continuation Penalty With Dynamic Programming ?
written by User 5037 •
This reads like an assignment/homework.
Such questions are off topic, and this thread is liable to be closed, until you show your own effort to solve it first.
Hello alan.jacob21!
We believe that this post does not fit the main topic of this site.
As Joe points out, this is most probably a homework/assignment question and is meant to be solved by the learner on their own.
For this reason we have closed your question. This allows us to keep the site focused on the topics that the community can help with.
If you disagree please tell us why in a reply below, we'll be happy to talk about it.
Cheers!