ptrus / suffix-trees
Python implementation of Suffix Trees and Generalized Suffix Trees.
☆126Updated 4 years ago
Alternatives and similar repositories for suffix-trees:
Users that are interested in suffix-trees are comparing it to the libraries listed below
- Suffix tree for string searching☆160Updated 3 years ago
- A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.☆50Updated last year
- Optimized implementation of suffix tree in python using Ukkonen's algorithm.☆51Updated 2 years ago
- Ukkonen's suffix tree algorithm, a complete version implemented in Python☆26Updated last year
- A Fast Levenshtein Distance Library for Python☆82Updated last month
- fast, pure-python interval overlap testing☆52Updated 4 years ago
- The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.☆219Updated 7 months ago
- Example Python code for comparing documents using MinHash☆251Updated 6 years ago
- Roaring Bitmap in Cython☆81Updated 10 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 10 years ago
- Python bindings to Succinct Data Structure Library 2.0☆30Updated 5 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆301Updated 9 months ago
- Bloom filter for Python☆84Updated 3 years ago
- A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.☆646Updated 3 weeks ago
- A Pythonic indexed priority queue☆89Updated 8 months ago
- A small tool that EXPLains spACY parse results. See what I did there?☆83Updated 3 years ago
- Locality-sensitive hashing algorithm for text similarity comparisons☆58Updated 3 years ago
- Find parts of long text or data, allowing for some changes/typos.☆317Updated 8 months ago
- LSH based high dimensional clustering for sets and points☆79Updated 10 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 3 weeks ago
- A simple proof of concept levenshtein automaton in Python☆109Updated 9 years ago
- Open compressed files in Python☆72Updated this week
- embedded graph datastore☆184Updated 6 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆87Updated 2 months ago
- ☆23Updated last year
- Python Set subclass that supports searching by ngram similarity☆119Updated 3 years ago
- Python package for string algorithms ➰☆44Updated 3 months ago
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year
- Fast implementation of the edit distance(Levenshtein distance)☆681Updated last year
- Python3 bindings for the Compact Language Detector v3 (CLD3)☆151Updated last year