ptrus / suffix-treesLinks
Python implementation of Suffix Trees and Generalized Suffix Trees.
☆127Updated 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
Sorting:
- Suffix tree for string searching☆163Updated 3 years ago
- Python package for string algorithms ➰☆47Updated 7 months ago
- NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.☆223Updated 3 weeks ago
- pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.☆246Updated this week
- fast, pure-python interval overlap testing☆52Updated 4 years ago
- Find parts of long text or data, allowing for some changes/typos.☆325Updated 2 months ago
- Roaring Bitmap in Cython☆81Updated last year
- Python bindings to Succinct Data Structure Library 2.0☆33Updated 6 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆304Updated last year
- Time everything in IPython☆124Updated last year
- A Fast Levenshtein Distance Library for Python☆84Updated 5 months ago
- Fast hierarchical clustering routines for R and Python.☆152Updated this week
- Levenshtein and Hamming distance computation☆116Updated 5 years ago
- Python Set subclass that supports searching by ngram similarity☆119Updated 3 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆86Updated 2 months ago
- Python implementations of TRESTLE, COBWEB/3, and COBWEB☆61Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Venn diagrams with word clouds☆50Updated last year
- The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity☆387Updated 2 years ago
- Open compressed files in Python☆74Updated 2 months ago
- Example Python code for comparing documents using MinHash☆251Updated 6 years ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition☆55Updated 11 years ago
- Weighted Levenshtein library☆110Updated 2 years ago
- A Pythonic indexed priority queue☆90Updated last year
- Lightning Fast Language Prediction 🚀☆167Updated 6 years ago
- ☆81Updated 4 months ago
- Fast, efficiently stored Trie for Python. Uses libdatrie.☆537Updated last year
- Fast random access of gzip files in Python☆108Updated 2 months ago
- Fast HyperLogLog for Python.☆108Updated last week