|Perl: the Markov chain saw|
Similarity of stringsby professa (Beadle)
|on May 15, 2002 at 14:31 UTC||Need Help??|
professa has asked for the
wisdom of the Perl Monks concerning the following question:
Hi dear monks!
I'm in the need of checking 2 strings for degree of identity, and right now I'm doing this by checking char by char via 'substr()':
That's pretty straightforward, but also pretty slow. The strings are two aligned aminoacid sequences like this one:
Is there another way to get the percent of identity of such strings like in my simple code above but more efficient and faster?
I found a hint to 'String::Approx' here on Perlmonks, but I don't really know if that's what I need, since it talks about distances and I don't know if that really is comparable to my percentage identity.