cceh / suffix-tree
A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
☆50Updated last year
Alternatives and similar repositories for suffix-tree:
Users that are interested in suffix-tree are comparing it to the libraries listed below
- cython wrapper for khash☆28Updated 7 months ago
- Python bindings to Succinct Data Structure Library 2.0☆30Updated 5 years ago
- a pure-Python PATRICIA trie implementation.☆31Updated 10 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆82Updated this week
- Python module for detection of CPU features☆28Updated last year
- Open compressed files in Python☆69Updated 7 months ago
- Python bindings for the fast integer compression library FastPFor.☆56Updated last year
- Python implementation of Suffix Trees and Generalized Suffix Trees.☆125Updated 4 years ago
- Original, standard and customisable versions of the Jaro-Winkler functions.☆32Updated 2 years ago
- Ultrafast interval trees from the kernel. Deprecated in favor of the NCLS.☆25Updated 5 years ago
- Augmented Interval Tree implemented in Cython/C☆19Updated 8 months ago
- Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html☆112Updated 3 weeks ago
- Faster zlib and gzip compatible compression and decompression by providing python bindings for the isa-l library.☆48Updated last week
- An index data structure for approximate string search.☆23Updated 5 years ago
- Fast Levenshtein Distance Library for Python 3☆82Updated 2 years ago
- Useful Mutable Mappings☆69Updated last year
- Python implementation of stream library for streaming google protocol buffer objects☆42Updated last year
- This is an Object Oriented implementation of a Trie in python. The class contains setter and getter methods, and implements several usefu…☆14Updated 7 years ago
- Commons of stupid, simple Python micro functions. Pull requests very welcome.☆19Updated 2 years ago
- Fast and Scalable Data Structures for Scientific and Quantitative Research.☆12Updated 6 years ago
- Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing☆68Updated 2 weeks ago
- The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.☆217Updated 4 months ago
- A simple implementation of Bloom Filter and Scalable Bloom Filter for Python 3.☆17Updated 6 years ago
- python3 package supporting efficient storage and querying of sets of sets using the trie data structure. Supports finding all the superse…☆24Updated last year
- Cython implementation of Toolz. Please use: https://github.com/pytoolz/cytoolz☆39Updated last month
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆21Updated last month
- A workflow system for Natural Language Processing.☆21Updated 5 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆57Updated 8 months ago
- Python and Rust library for loading, saving, and manipulating taxonomic trees☆36Updated 2 months ago