Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: Is it possible to make reference to substrings and sort them?

by spooknick (Novice)
on Mar 22, 2015 at 21:09 UTC ( [id://1120913]=note: print w/replies, xml ) Need Help??


in reply to Re: Is it possible to make reference to substrings and sort them?
in thread Is it possible to make reference to substrings and sort them?

Excellent, it took:

Spent 398.221 wallclock secs (397.00 usr +  0.98 sys = 397.98 CPU)

for a sequence of 4639675 nt

I just thought about not using the complete length of text in sort, like using only the first 1000 nt, but your idea is accurate.

  • Comment on Re^2: Is it possible to make reference to substrings and sort them?
  • Download Code

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2024-04-19 13:49 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found