[TEXT-4] Port Myers algorithm from [collections]

• Type: New Feature
• Status: Closed
• Priority: Minor
• Resolution: Fixed
• Fix Version/s: 1.0
• Assignee: Unassigned
• Reporter: Bruno P. Kinoshita
• Created: 13/Dec/14 03:45
• Updated: 17/Mar/17 12:28
• Resolved: 14/Mar/15 16:54

Description

As suggested by Luc [1], we could port the Myers algorithm from [collections] to [text]. I haven't thoroughly studied the paper or the algorithm, but if I recall correctly, the first time I read it in [collections], my impression was that it was some kind of diff algorithm.

Good places to start looking for more information are the algorithm paper [2], the package javadocs from [collections] [3], and from this Wikipedia article [4].

Oh, and from the [collection]'s source code as well, of course [5].

Cheers,
Bruno

[1] http://markmail.org/search/?q=text+commons+list%3Aorg.apache.commons.dev%2F+order%3Adate-backward#query:text%20commons%20list%3Aorg.apache.commons.dev%2F%20order%3Adate-backward+page:8+mid:fwqr5tcgftot6eww+state:results

[2] http://www.cis.upenn.edu/~bcpierce/courses/dd/papers/diff.ps

[3] https://commons.apache.org/proper/commons-collections/apidocs/org/apache/commons/collections4/sequence/package-summary.html

[4] http://en.wikipedia.org/wiki/Diff_utility

[5] https://github.com/apache/commons-collections/tree/trunk/src/main/java/org/apache/commons/collections4/sequence