This is a test version of Biostars. For the public version, visit https://www.biostars.org.
Global Sequence Alignment

For a parameter k, compute the global alignment between two strings, subject to the constraint that the alignment contains at most k gaps (blocks of consecutive indels).

alignment

Is this your homework? hint: look at Smith and Waterman algorithm

do you think you are very smart? If you are, you will implement or copycat if less so the Needleman-Wunsch algorithm. Please remeber: We do not take, repeat do not take, your course assignments.

0 answers

No answers yet.

Log in to answer this question.