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.
-
Updated
Oct 24, 2021 - Java
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.
Add a description, image, and links to the shortest-common-superstrings topic page so that developers can more easily learn about it.
To associate your repository with the shortest-common-superstrings topic, visit your repo's landing page and select "manage topics."