|
Boost : |
From: David Abrahams (dave_at_[hidden])
Date: 2007-05-20 15:17:58
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:
-- Dave Abrahams Boost Consulting http://www.boost-consulting.com
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk