Perl Monk, Perl Meditation | |
PerlMonks |
Re: Filtering matches of near-perfect-matched DNA sequence pairsby Not_a_Number (Prior) |
on Mar 13, 2015 at 21:50 UTC ( [id://1120000]=note: print w/replies, xml ) | Need Help?? |
Hi, onlyIDleft. Your problem seems interesting. However, you seem to have missed (I find it hard to believe that you have deliberately ignored...) any requests from fellow monks for concrete examples of string pairs (DNA sequences) that either meet or don't meet your requirements. To help us (and I agree with anonymonk that "This looks like a really fun problem to work on"), please reply to the following: a. 9 out of 10 in both align to each other perfectly No prob:
That's okay, right? b. 10 out of 10 in both align to each other perfectly Even easier to understand:
Perfect match, right? c. 9 in one and 10 in other align to each other - with this imperfect alignment due to insertion/deletion I don't understand. Please supply a couple of examples of pairs that meet/don't meet your requirements (with comments, if necessary) d. 9 out of 9 in both align to each other,but imperfectly due to substitution - but I will allow only one such substitution - for biological reasons Ditto e. 10 out of 10 in both align to each other, but imperfectly due to substitution - but I will allow only one such substitution - again for biological reasons I think I understand this one, but could you again supply a couple of examples of pairs that meet/don't meet your requirements? That said, I think that the CPAN module Text::Levenshtein might be what you are looking for. But that could depend on your answers to the above questions... Update: Corrected copy/paste error(s)
In Section
Seekers of Perl Wisdom
|
|