.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#
#
suffix-tries
Here are 5 public repositories matching this topic...
Aulas, exercícios e resumos das matérias: Introdução à Informática e Teoria da Computação.
reduction turing-machine context-free-grammar ufsc pt-br ine suffix-tries computability-theory finite-automata pumping-lemma ine5602
-
Updated
Oct 29, 2025 - Python
Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.
c-plus-plus automata kmp-algorithm brute-force approximate-string-matching string-matching aho-corasick-algorithm boyer-moore-algorithm rabin-karp-algorithm suffix-tries hybrid-string
-
Updated
Mar 14, 2018 - C++
Beginner-friendly Java implementation of Trie (Prefix Tree) supporting insert, search, delete, and prefix-based operations using OOP concepts.
-
Updated
May 19, 2026 - Java
String algorithms related to suffix trie and tries
-
Updated
Jul 27, 2017 - Python
Improve this page
Add a description, image, and links to the suffix-tries topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the suffix-tries topic, visit your repo's landing page and select "manage topics."