Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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

by snoopy (Deacon)
on Aug 29, 2008 at 00:06 UTC ( #707640=note: print w/ replies, xml ) Need Help??


in reply to 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
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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://707640]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (7)
As of 2014-12-27 15:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (177 votes), past polls