| This class takes two Strings an generates the shortes list of necessarry
change operations to transform the source string into the target string.
For more information about the used algorithm refer to:
- http://www.merriampark.com/ld.htm
- http://www.msci.memphis.edu/~giri/compbio/f99/ningxu/NOTE10.html
- http://www.itu.dk/courses/AVA/E2005/StringEditDistance.pdf
Original source extracted from Glazed Lists (http://publicobject.com/glazedlists/)
Implementation of Eugene W. Myer's paper, "An O(ND) Difference Algorithm and Its
Variations", the same algorithm found in GNU diff.
Note that this is a cleanroom implementation of this popular algorithm that is
particularly suited for the Java programmer. The variable names are descriptive and the
approach is more object-oriented than Myer's sample algorithm.
author:
Jesse Wilson |
