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 4 years ago
• pyranges / ncls
  NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
  ☆224Updated 5 months ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆250Updated 2 months ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆50Updated 2 weeks ago
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆334Updated last month
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 5 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆82Updated last year
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆54Updated 2 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆305Updated last year
• anhaidgroup / py_stringmatching
  A comprehensive and scalable set of string tokenizers and similarity measures in Python
  ☆142Updated last year
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆86Updated 10 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆697Updated last year
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆126Updated 2 years ago
• ImSoErgodic / py-upset
  A pure-python implementation of the UpSet suite of visualisation methods by Lex, Gehlenborg et al.
  ☆322Updated 7 years ago
• pycompression / xopen
  Open compressed files in Python
  ☆80Updated 2 months ago
• infoscout / weighted-levenshtein
  Weighted Levenshtein library
  ☆113Updated 3 weeks ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated 2 weeks ago
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆53Updated last month
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• TopSBM / topsbm
  Scikit-learn compatible Topic Modelling with Hierarchical Statistical Block Models (Gerlach, Peixoto and Altmann, 2018)
  ☆28Updated 6 years ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆109Updated 2 years ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 4 years ago
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆389Updated 3 years ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆252Updated 6 years ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• nvictus / pqdict
  A Pythonic indexed priority queue
  ☆91Updated 3 weeks ago
• cgat-developers / ruffus
  CGAT-ruffus is a lightweight python module for running computational pipelines
  ☆175Updated 4 years ago
• fabianvf / python-rake
  ☆129Updated 4 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆156Updated last year