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 3 years ago
• mutux / Ukkonen-s-Suffix-Tree-Algorithm
  Ukkonen's suffix tree algorithm, a complete version implemented in Python
  ☆26Updated last year
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆52Updated last year
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆83Updated 3 months ago
• pyranges / ncls
  The Nested Containment List for Python. Basically a static interval-tree that is silly fast for both construction and lookups.
  ☆221Updated 9 months ago
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 4 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆173Updated 3 years ago
• pycompression / xopen
  Open compressed files in Python
  ☆74Updated 3 weeks ago
• chaimleib / intervaltree
  A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.
  ☆657Updated 2 months ago
• Ezibenroc / PyRoaringBitMap
  Python library for handling efficiently sorted integer sets.
  ☆210Updated 3 weeks ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆47Updated 5 months ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆251Updated 6 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆109Updated 9 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.
  ☆52Updated 2 years ago
• go2starr / lshhdc
  LSH based high dimensional clustering for sets and points
  ☆79Updated 10 years 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 9 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 12 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆153Updated 10 months ago
• Kingsford-Group / omhismb2019
  ☆23Updated last year
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆147Updated 9 months ago
• pycompression / python-isal
  Faster zlib and gzip compatible compression and decompression by providing python bindings for the isa-l library.
  ☆50Updated last week
• infoscout / weighted-levenshtein
  Weighted Levenshtein library
  ☆109Updated 2 years ago
• chebee7i / nxpd
  Draw NetworkX graphs using pydot/graphviz, with support for IPython notebooks.
  ☆118Updated 5 years ago
• coelias / Pynteractive
  Pilot to work with dynamic visualization by using python
  ☆59Updated 5 years ago
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆145Updated 3 weeks ago
• ducky427 / neonx
  ☆39Updated 9 years ago
• BEETL / BEETL
  BEETL
  ☆96Updated 2 years ago