ptrus / suffix-treesLinks
Python implementation of Suffix Trees and Generalized Suffix Trees.
☆127Updated 5 years ago
Alternatives and similar repositories for suffix-trees
Users that are interested in suffix-trees are comparing it to the libraries listed below
Sorting:
- Suffix tree for string searching☆165Updated 4 years ago
- NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.☆224Updated 6 months ago
- A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.☆681Updated last month
- Time everything in IPython☆126Updated 2 years ago
- fast, pure-python interval overlap testing☆52Updated 5 years ago
- pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.☆250Updated 3 months ago
- Python package for string algorithms ➰☆51Updated last month
- Python bindings to Succinct Data Structure Library 2.0☆34Updated 6 years ago
- Find parts of long text or data, allowing for some changes/typos.☆337Updated 2 months ago
- Roaring Bitmap in Cython☆82Updated last year
- Python Set subclass that supports searching by ngram similarity☆119Updated 4 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆305Updated last year
- A Fast Levenshtein Distance Library for Python☆86Updated 11 months ago
- Optimized implementation of suffix tree in python using Ukkonen's algorithm.☆53Updated 2 months ago
- Fast hierarchical clustering routines for R and Python.☆156Updated last week
- CGAT-ruffus is a lightweight python module for running computational pipelines☆175Updated 4 years ago
- Open compressed files in Python☆81Updated 3 months ago
- A pure-python implementation of the UpSet suite of visualisation methods by Lex, Gehlenborg et al.☆323Updated 7 years ago
- Example Python code for comparing documents using MinHash☆251Updated 6 years ago
- A Pythonic indexed priority queue☆92Updated last month
- Levenshtein and Hamming distance computation☆117Updated 6 years ago
- Python implementation of the rank-biased overlap list similarity measure.☆71Updated 5 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Python BK-tree data structure to allow fast querying of "close" matches☆186Updated 4 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆87Updated last month
- Fast, efficiently stored Trie for Python. Uses libdatrie.☆547Updated 3 weeks ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- Python library for handling efficiently sorted integer sets.☆228Updated 3 months ago
- persistent caching to memory, disk, or database☆278Updated last week
- Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html☆122Updated last month