C++ implementation of Ukkonen's algorithm.
-
Updated
Mar 5, 2018 - C++
C++ implementation of Ukkonen's algorithm.
Construction of suffix tree using Ukkonen's algorithm
Parallel version of the bwtzip project implemented by means of the OpenMP APIs
discrete analysis
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
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."