Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re^3: Comparing a large set of DNA sequences

by aaron_baugher (Curate)
on Nov 10, 2011 at 16:17 UTC ( [id://937406]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Comparing a large set of DNA sequences
in thread Comparing a large set of DNA sequences

That's a brilliant way to do it. My own brute force method of comparing all the strings character by character required 5,000,050,000 comparisons and took almost 4 hours. Yours loops through 100,000 items once, then loops through a maximum of 2,000,000 keys once. It's not even close.

Aaron B.
My Woefully Neglected Blog, where I occasionally mention Perl.

  • Comment on Re^3: Comparing a large set of DNA sequences

Replies are listed 'Best First'.
Re^4: Comparing a large set of DNA sequences
by roboticus (Chancellor) on Nov 10, 2011 at 16:30 UTC

    aaron baugher:

    We were lucky the problem was amenable to such a nice simplification!

    ...roboticus

    When your only tool is a hammer, all problems look like your thumb.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others scrutinizing the Monastery: (8)
As of 2024-04-23 16:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found