>> Note: the strings are made of only letters. More exactly, 4 letters - nucleotide bases (A,C,G,T).
Is this related genome matching, sequencing etc?
If you haven't already, check out the wide range of resources available from bioperl.
There's lots of interesting reading, algorithms and freely available Perl code.
In reply to Re: Comparing strings (exact matches) in LARGE numbers FAST
by snoopy
in thread Comparing strings (exact matches) in LARGE numbers FAST
by perlSD
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |