20 May
2007
20 May
'07
7:17 p.m.
on Fri May 18 2007, Marco <mrcekets-AT-gmail.com> wrote:
I read the article pointed out by Phil Endecott: An O(NP) Sequence Comparison Algorithm where P=D/2 when M=N and D is the actual edit distance, as said in the abstract:
This is cool! I suggest you create a Trac ticket so it doesn't get forgotten: http://svn.boost.org -- Dave Abrahams Boost Consulting http://www.boost-consulting.com