C++ implementation of suffix trees, using Ukkonen's algorithm.
-
Updated
Sep 5, 2023 - C++
C++ implementation of suffix trees, using Ukkonen's algorithm.
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.
Практическое задание для отбора на кафедру КИС
Suffix tree construction: Naive Algorithm and (currently working on) Ukkonen's.
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
C++ implementation of Suffix Tree (Ukkonens)
A Go implementation of a Generalized Suffix Tree using Ukkonen's algorithm
A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
String metrics library written in Go.
A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
Add a description, image, and links to the ukkonen topic page so that developers can more easily learn about it.
To associate your repository with the ukkonen topic, visit your repo's landing page and select "manage topics."