.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.
-
Updated
Jul 11, 2024 - C#
#
ukkonen-algorithm
Here are 15 public repositories matching this topic...
Ukkonen's suffix tree algorithm, a complete version implemented in Python
-
Updated
Sep 14, 2023 - Python
C++ implementation of Ukkonen's algorithm.
-
Updated
Mar 5, 2018 - C++
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.
-
Updated
Apr 25, 2019 - C#
Implementations of Suffix Trees Algorithms
-
Updated
Apr 23, 2017 - C
🌳 ES6 Implementation of Ukkonens Algorithm for Suffix Tree Creation.
-
Updated
Feb 1, 2016 - JavaScript
Construction of suffix tree using Ukkonen's algorithm
-
Updated
Nov 9, 2019 - C++
Parallel version of the bwtzip project implemented by means of the OpenMP APIs
openmp compression-algorithm polimi lossless-compression-algorithm ukkonen-algorithm parallel-programming
-
Updated
Apr 1, 2019 - C++
Advanced string algorithms in Python: BWT approximate matching, Ukkonen suffix trees, Z-based matching, Rabin-Karp & Miller-Rabin. | Python 高级字符串算法：BWT 近似匹配、Ukkonen 后缀树、Z 算法、Rabin-Karp 与 Miller-Rabin。
python computer-science algorithms data-structures bwt rabin-karp string-matching string-algorithms burrows-wheeler-transform ukkonen-algorithm suffix-tree z-algorithm advanced-algorithms
-
Updated
Sep 15, 2026 - Python
This project repository provides a Python-based Suffix Tree Visualizer. It constructs suffix trees using Ukkonen's algorithm and visualizes them with matplotlib. Basic implementation for exploring string matching, text compression, and bioinformatics. Interactive, easy-to-use, and educational! 🌟
-
Updated
Jan 10, 2025 - Python
discrete analysis
algorithms data-structures algorithms-implemented radix-sort dijkstra-algorithm ukkonen-algorithm aho-corasick-algorithm patricia-algorithm
-
Updated
Feb 12, 2019 - C++
Mutations
-
Updated
Jun 22, 2020
Suffix structures: suffix tree (Ukkonen's algorithm), suffix automaton
-
Updated
Dec 10, 2017 - C++
Mapping reads to a corresponding genome using a suffix tree (linear time construction) and Smith-Waterman local alignment algorithm
-
Updated
Nov 16, 2018 - C++
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
Add this topic to your repo
To associate your repository with the ukkonen-algorithm topic, visit your repo's landing page and select "manage topics."