|
|
|
| more useful options | |
| PerlMonks |
Re: Levenshtein distance: calculating similarity of stringsby omnibus (Scribe) |
| on Mar 24, 2003 at 16:34 UTC ( [id://245467]=note: print w/replies, xml ) | Need Help?? |
|
The next step is to work your way backwards through %mat to determine the best alignment of the two sequences. This is the Needleman/Wunsch algorithm. There is a good writeup on it, including diagrams, here
In Section
Cool Uses for Perl
|
|
||||||||||||||||||||||