Parallel version of the bwtzip project implemented by means of the OpenMP APIs
discrete analysis
Construction of suffix tree using Ukkonen's algorithm
Mutations
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment 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 structures: suffix tree (Ukkonen's algorithm), suffix automaton
Implementations of Suffix Trees Algorithms
🌳 ES6 Implementation of Ukkonens Algorithm for Suffix Tree Creation.
C++ implementation of Ukkonen's algorithm.
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.
Ukkonen's suffix tree algorithm, a complete version implemented in Python
.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.
Add a description, image, and links to the ukkonen-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the ukkonen-algorithm topic, visit your repo's landing page and select "manage topics."