Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

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

by snoopy (Curate)
on Aug 29, 2008 at 00:06 UTC ( [id://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

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]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://707640]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2024-04-25 13:24 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found