pydatastructs/SuffixTree-1
Continuation of Danny Yoo's SuffixTree and SubstringDict
Developer Profile
pydatastructs
Discovered public repositories for pydatastructs in the GitHub catalog.
pydatastructs/aho-corasick
https://hkn.eecs.berkeley.edu/~dyoo/python/ahocorasick/
pydatastructs/trees
Various tree structures for Python
pydatastructs/automata
Public repository.
pydatastructs/tries
Various Trie data structures for Python
pydatastructs/ropes
A binary tree-based data structure for efficiently storing and manipulating a very long string
pydatastructs/lists
A collection of fast non-standard linear data structures for Python.
pydatastructs/hashes
A collection of fast non-standard hash data structures for Python.
pydatastructs/dawg
DAWG-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
pydatastructs/btree
A BTree implementation as a python C extension
pydatastructs/suffixtree
Danny Yoo's Suffix tree Python wrapper on Gusfield's strmat
pydatastructs/aatree
AA trees for Python
pydatastructs/avl
AVL C-implementation and Python extension by Sam Rushing et al.
pydatastructs/chartrie
Pure C character trie implementation, wrapped into python extension
pydatastructs/pybloomfiltermmap
Fast Python Bloom Filter using Mmap
pydatastructs/dablooms
scaling, counting, bloom filter library
pydatastructs/hat-trie
HAT-Trie for Python
pydatastructs/datrie
Super-fast, efficiently stored Trie for Python. Uses libdatrie.
pydatastructs/pytrie
Trie implementation in pure Python.
pydatastructs/marisa-trie
Static memory-efficient Trie-like structures for Python (2.x and 3.x). Uses marisa-trie C++ library.
pydatastructs/ctst
A plain C implementation of the Ternary Search Tree structure with Ruby bindings
pydatastructs/pytst
C++ Ternary Search Tree implementation with Python bindings
pydatastructs/pysuffix
Public repository.