Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

Re: non-exact regexp matches

by wufnik (Friar)
on Jun 23, 2004 at 18:24 UTC ( #369132=note: print w/replies, xml ) Need Help??

in reply to non-exact regexp matches

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 --

Replies are listed 'Best First'.
Re^2: non-exact regexp matches
by vinforget (Beadle) on Jun 23, 2004 at 19:01 UTC
    What I want is a little simpler. I would just need to match the characters and not the character classes/intervals because spacing is deemed to be important in this case. I just want to allow for a certain number substitutions for the fixed characters. I will still read the paper... I may find something that will help me get to a partial solution. Thanks

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://369132]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2017-10-23 05:38 GMT
Find Nodes?
    Voting Booth?
    My fridge is mostly full of:

    Results (277 votes). Check out past polls.