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
  ☆161Updated 2 years ago
• mutux / Ukkonen-s-Suffix-Tree-Algorithm
  Ukkonen's suffix tree algorithm, a complete version implemented in Python
  ☆25Updated last year
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆51Updated last year
• pyranges / ncls
  The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.
  ☆213Updated 2 months ago
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 4 years ago
• Kingsford-Group / omhismb2019
  ☆23Updated 11 months ago
• fujimotos / polyleven
  Fast Levenshtein Distance Library for Python 3
  ☆81Updated 2 years ago
• pycompression / xopen
  Open compressed files in Python
  ☆68Updated 5 months ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆103Updated 9 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆79Updated 6 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆30Updated 5 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 6 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• deehzee / unionfind
  A union-find disjoint sets data structure implemented in Python with the "Weighted Quick Union with Path Compression" algorithm.
  ☆65Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆56Updated 6 months ago
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆661Updated 9 months ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆28Updated 5 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated 8 months ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆117Updated 5 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆170Updated 2 years ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 11 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆300Updated 5 months ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆39Updated 2 months ago
• felipelouza / egsa
  Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
  ☆15Updated 3 years ago
• mpetri / mem_monitor
  A simple C++11 memory monitor
  ☆15Updated 8 years ago
• egonelbre / fm-index
  Educational implementation of BWT and FM-index
  ☆57Updated 6 years ago
• lgautier / mashing-pumpkins
  Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.
  ☆21Updated 2 months ago
• HazyResearch / numbskull
  Numba-based version of DimmWitted Gibbs sampler
  ☆46Updated 6 years ago
• mattilyra / LSH
  Locality Sensitive Hashing using MinHash in Python/Cython to detect near duplicate text documents
  ☆282Updated last year