There are 0 repository under suffix-tree topic.
Set of handy reusable .NET components that can simplify your daily work and save your time when you copy and paste your favorite helper methods and classes from one project to another
Python implementation of Suffix Trees and Generalized Suffix Trees.
A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm
Tells you which "words" can be written as a publicly available domain
A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
安全开发基础组件:域名后缀树(Golang实现)
Data structures implementation & visualization
Ukkonen's suffix tree algorithm, a complete version implemented in Python
C++ implementation of Ukkonen's algorithm.
The lib CBioInfCpp.h contains 3 groups of functions for C++: "Input-Output", "Working with strings", "Working with graphs". Data structures "Adjacency vector" and "Adjacency map" are implemented in the last one (i.e. in "Working with graphs"). See About_CBioInfCpp for details.
Implementations of Fundamental Algorithms & Data Structures in C++.
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
The research of accuracy of searching cycles methods in symbolic sequences (time series) with presence of random noises.
Transforms alquran into القرآن
Implementations of Suffix Trees Algorithms
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.
Algorithm design course in my forth semester of university
Implementing Autocomplete using Tries
Suffix tree implementation using Ukkonen's suffix tree construction algorithm. Sample program written to find all occurrences of a query_string and rank documents according to relevence
Implementing of the prefix and suffix trees, autocomplete service and full text search engine based on them.
A library for fuzzy-string-searching using suffix trees and levenschtein automatons to perform extremely fast search queries on large data sets. Serialize and deserialize functions allow suffix trees to persist (and drastically reduce preprocessing time).