what you/we really
want is an implementation
of the below - an optimal way to approximately match
regular expressions. why this rather than the others above?
1: Bull Math Biol. 1989;51(1):5-37.
Approximate matching of regular expressions.
Myers EW, Miller W.
none of the above are able to compare "edit distances"
*for regular expressions* in the way the Text::Levenshtein
etc allow the comparison of these edit distances for strings. instead, they quite effectively hardwire a greater
degree of flexibility into the patterns that can be recognized. but to do this properly, you need to 'penalize' insertions/deletions in your regexp in the same way you do for sequences. the above paper outlines a way of doing this.
as for implementation - I don't know.
is there something around the BioPerl guys might know of?
-- in the world of the mules there are no rules --
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
Outside of code tags, you may need to use entities for some characters:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||