) } ) );
... but got no results at all.
Help!
--
Aaron J. Mackey, Ph.D.
Dept. of Biology, Goddard 212
University of Pennsylvania email: [EMAIL PROTECTED]
415 S. University Avenue office: 215-898-1205
Philadelphia, PA 19104-6017 fax:215-746-6697
I haven't yet had the chance to thoroughly test and Benchmark this vs.
Ron Kimball's solution, so there's no summary yet to report (beside the
fact that you and Ron Kimball both provided apparently reasonable
solutions). I will also, as originally promised, package the winning
solution into
On the BioPerl mailing list we often get requests like the following:
Within a given biosequence with length X, find substrings of min.
length A and max. length B that contain the pattern P at least C times
but no more than D times.
A more concrete example: Find all substrings 12 characters
On Fri, 12 Jul 2002, Eugene van der Pijll wrote:
The parentheses around a return only one match, regardless of the number
within the {}.
Ahh, right. Sigh, I need to do a limited m//g type of thing, so I guess
I'm stuck with something like:
$_ = 2aaa;
d = s/^(\d+)//;
push d, m/(a)/ for
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Mon, 3 Dec 2001 [EMAIL PROTECTED] wrote:
Like Ian Phillipps, I am in awe of this leading bunch.
This is a hot race. I am really enjoying looking at
the incredible variety of solutions and learning a
lot too.
Hopefully there will be a recap
