A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
-
Updated
Nov 2, 2020 - Java
#
ukkonen
Here are 3 public repositories matching this topic...
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
Improve this page
Add a description, image, and links to the ukkonen topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the ukkonen topic, visit your repo's landing page and select "manage topics."