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

Python package for lexicon; Trie and DAWG implementation.

A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.

Tells you which "words" can be written as a publicly available domain

安全开发基础组件：域名后缀树（Golang实现）

Data structures implementation & visualization

Ukkonen's suffix tree algorithm, a complete version implemented in Python

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.

C++ implementation of Ukkonen's algorithm.

transform transliteration to Quran text

Implementations of Fundamental Algorithms & Data Structures in C++.

DGST: Efficient and Scalable Generalized Suffix Tree Construction on Apache Spark

C++20 Generalized Suffix Tree implementation

Program Structure and Algorithms

Fork of the project http://code.google.com/p/radixtree

Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,

gstlib: a Generalized Suffix Tree Library in Scala

The research of accuracy of searching cycles methods in symbolic sequences (time series) with presence of random noises.