Re: Comparing strings (exact matches) in LARGE numbers FAST

>> 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.

Comment on Re: Comparing strings (exact matches) in LARGE numbers FAST

Replies are listed 'Best First'.
Re^2: Comparing strings (exact matches) in LARGE numbers FAST by perlSD (Novice) on Aug 29, 2008 at 00:21 UTC
Thanks, I'll check the BioPerl resources. Yes, the first file is ultra high throughput sequencing output. No, it's not genome matching - there is software that does that. The second file would be a collection of bio-markers if you will.	[reply]