M4rukku/Ukkonens-Linear-Time-Shortest-Common-Superstring
An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.
JavaMIT
No issues in this repository yet.