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

A Java implementation of a Generalized Suffix Tree using Ukkonen's algorithm

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

Data structures implementation & visualization

Python package for lexicon; Trie and DAWG implementation.

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

Alquran in Go Representation

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

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

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

gstlib: a Generalized Suffix Tree Library in Scala

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

Transforms alquran into القرآن

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

C++ implementation of Ukkonen's algorithm.

Implementations of Suffix Trees Algorithms

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.

Space-efficient variable-order Markov models

A suffix-tree index implemented in go

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

C++ implementation of Suffix Tree (Ukkonens)

Implementing Autocomplete using Tries

Quick and Dirty implemetation of Google Instant Like Suggestions using Suffix Tree

Implementation of some (multiple) instance kernels

Program Structure and Algorithms

A Python implementation of suffix tree

🌳 ES6 Implementation of Ukkonens Algorithm for Suffix Tree Creation.

C++17 Generalize Suffix Tree implementation

What I learned from Data Structures and Algorithms Specialization on Coursera.

A tiny substring search module using an uncompressed suffix tree. Speed should be ok, but potential to be optimized massively for space.