Alternatives and similar repositories for suffix-trees

Users that are interested in suffix-trees are comparing it to the libraries listed below

• kvh / Python-Suffix-Tree
  Suffix tree for string searching
  ☆165Updated 3 years ago
• pyranges / ncls
  NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
  ☆223Updated 4 months ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆53Updated 2 years ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆250Updated last month
• chaimleib / intervaltree
  A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.
  ☆672Updated 7 months ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆49Updated 10 months ago
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆53Updated last week
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆690Updated last year
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 5 years ago
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆332Updated 5 months ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆85Updated 8 months ago
• ImSoErgodic / py-upset
  A pure-python implementation of the UpSet suite of visualisation methods by Lex, Gehlenborg et al.
  ☆318Updated 7 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆86Updated 5 months ago
• cgat-developers / ruffus
  CGAT-ruffus is a lightweight python module for running computational pipelines
  ☆175Updated 4 years ago
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆125Updated 2 years ago
• pycompression / xopen
  Open compressed files in Python
  ☆79Updated 3 weeks ago
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆122Updated last month
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆153Updated last week
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 6 years ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆251Updated 6 years ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• diffeo / py-nilsimsa
  Locality-sensitive hashing algorithm for text similarity comparisons
  ☆58Updated 7 months ago
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆388Updated 3 years ago
• infoscout / weighted-levenshtein
  Weighted Levenshtein library
  ☆113Updated 2 years ago
• anhaidgroup / py_stringmatching
  A comprehensive and scalable set of string tokenizers and similarity measures in Python
  ☆141Updated last year