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
  ☆163Updated 3 years ago
• pyranges / ncls
  NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
  ☆222Updated last week
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆52Updated last year
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆86Updated last month
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 4 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆32Updated 6 years ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆247Updated last year
• nvictus / pqdict
  A Pythonic indexed priority queue
  ☆90Updated 11 months ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 3 years ago
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆84Updated 4 months ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆251Updated 6 years ago
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆124Updated last year
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆325Updated last month
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆47Updated 6 months ago
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆52Updated 2 years ago
• pycompression / xopen
  Open compressed files in Python
  ☆74Updated last month
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆118Updated last month
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 7 years ago
• semanticize / leven
  ☆21Updated 9 years ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆103Updated last year
• paulbrodersen / matplotlib_venn_wordcloud
  Venn diagrams with word clouds
  ☆50Updated last year
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆147Updated 10 months 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 3 months ago
• chebee7i / nxpd
  Draw NetworkX graphs using pydot/graphviz, with support for IPython notebooks.
  ☆118Updated 5 years ago
• infoscout / weighted-levenshtein
  Weighted Levenshtein library
  ☆110Updated 2 years ago
• mattilyra / LSH
  Locality Sensitive Hashing using MinHash in Python/Cython to detect near duplicate text documents
  ☆289Updated 2 years ago