ukkonen-algorithm
There are 13 repositories under ukkonen-algorithm topic.
gmamaladze/trienet
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
mutux/Ukkonen-s-Suffix-Tree-Algorithm
Ukkonen's suffix tree algorithm, a complete version implemented in Python
adamserafini/suffix-tree
C++ implementation of Ukkonen's algorithm.
shysaur/shysaur-suffixtrees
Implementations of Suffix Trees Algorithms
baratgabor/SuffixTree
A well-structured, relatively compact implementation of Ukkonen's linear time suffix tree construction algorithm in C# 7+. With bonus detailed explanation on the algorithm.
fabsrc/es6-ukkonen-suffix-tree
:deciduous_tree: ES6 Implementation of Ukkonens Algorithm for Suffix Tree Creation.
AshishKempwad/Suffix-tree-in-O-n-time
Construction of suffix tree using Ukkonen's algorithm
crazypegasusvv/Mutations
Mutations
nyxgear/bwtzip-openmp
Parallel version of the bwtzip project implemented by means of the OpenMP APIs
Schre/Read-Mapping
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm
vanyarock01/da
discrete analysis
Anton-Cherepkov/SuffixTreeSuffixAutomaton
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
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.