Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: Seeking help from Perl Monks for counting regular expressions (motifs) and counting lengths between them in a large string

by roboticus (Chancellor)
on Feb 03, 2012 at 11:01 UTC ( #951638=note: print w/ replies, xml ) Need Help??


in reply to Seeking help from Perl Monks for counting regular expressions (motifs) and counting lengths between them in a large string

supriyoch_2008:

Your question was *almost* interesting enough to try to decipher the code. But not quite. If you had formatted it so it was less painful to look at, you'd probably get some more feedback.

...roboticus

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


Comment on Re: Seeking help from Perl Monks for counting regular expressions (motifs) and counting lengths between them in a large string

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (5)
As of 2015-08-01 03:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (285 votes), past polls