[Haskell-cafe] diff implementation in haskell

[Erik de Castro Lopo]

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
-- 
----------------------------------------------------------------------
Erik de Castro Lopo
http://www.mega-nerd.com/