Subject: Re: [boost] [algorithm] Review Request: edit_distance
From: Erik Erlandson (eje_at_[hidden])
Date: 2014-01-30 19:57:26
----- Original Message -----
> ----- Original Message -----
> > - Have you looked at the supposedly better algorithm "An O(NP)
> > Sequence Comparison Algorithm" by Sun Wu, Udi Manber, and Gene
> > Myers ?
> The semantics of the
> working vector looks unchanged aside from its required width. If so, it may
> be a fairly simple modification of the existing code to get this working.
Hmm, not quite so easy. The indexing logic wants 2nd string to be longer, and stores y instead of x. So it will be one of those algorithms that needs two variations: for seq2 longer than seq1, and vice versa.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk