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 3 months ago
• chaimleib / intervaltree
  A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.
  ☆668Updated 7 months ago
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 5 years ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆53Updated last year
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆251Updated 6 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆48Updated 9 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆85Updated 7 months ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• ImSoErgodic / py-upset
  A pure-python implementation of the UpSet suite of visualisation methods by Lex, Gehlenborg et al.
  ☆318Updated 7 years ago
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆122Updated last month
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆125Updated last year
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆249Updated 2 weeks ago
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆332Updated 4 months ago
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 7 years ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆104Updated 2 years ago
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆690Updated last year
• pycompression / xopen
  Open compressed files in Python
  ☆78Updated last week
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 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
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆53Updated 2 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆175Updated 3 years ago
• chebee7i / nxpd
  Draw NetworkX graphs using pydot/graphviz, with support for IPython notebooks.
  ☆119Updated 6 years ago
• cgat-developers / ruffus
  CGAT-ruffus is a lightweight python module for running computational pipelines
  ☆174Updated 4 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆85Updated 4 months ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 3 years ago
• alexpreynolds / sample
  Performs memory-efficient reservoir sampling on very large input files delimited by newlines
  ☆69Updated 5 years ago