suffix-trie

extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

Code samples that demonstrate the algorithms learnt during the course. Used as a preparation (not only ;)) for the exam.

C++ Trie implementation as a Dictionary

A discrete maths project focusing on suffix trees

Various algorithms and data structures on strings

Algorithms for Bioinformatics (CSE 463)

A Python implementation of a suffix trie for efficient substring retrieval using prefix and suffix constraints.

A simple trie implementation, well tested tho.

TokenTrie: Real-time sequence prediction engine built on Dynamic Suffix Tries. Implements Context Mixing and Entropy Scaling to capture variable-order dependencies without neural networks.

Open Source React App to implement Suffix-tries for an autocomplete search bar.