Entering edit mode
11.0 years ago
behrang
•
0
can any body help me with the following problem?
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).
Is this a homework question?
http://www.ploscollections.org/article/info:doi/10.1371/journal.pcbi.1002202;jsessionid=A2C2B677241104800E044DA36AFB577B#s7
I will link to this to make it explicit. As Emily_Ensembl indicates please follow the Ten Simple Rules for Getting Help from Online Scientific Communities
So is this a close or delete? ;)
I'll leave it up to others. There is a chance - however remote - that the OP would actually attempt to solve the problem and post a partial solution with the problem.