[Haskell-cafe] diff implementation in haskell

Erik de Castro Lopo mle+hs at mega-nerd.com
Mon Dec 7 04:09:29 EST 2009

Don Stewart wrote:

> This looks like the paper, http://www.xmailserver.org/diff2.pdf
> Page 2, "The algorithm can be refined to use linear space", N and M
> appear to be the length of the sequences, D is the size of the minimum
> edit script.

T'would be lovely to have that in the docs for the package :-).

Erik de Castro Lopo

More information about the Haskell-Cafe mailing list