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
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆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.
  ☆221Updated 8 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
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆144Updated this week
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 4 years ago
• mutux / Ukkonen-s-Suffix-Tree-Algorithm
  Ukkonen's suffix tree algorithm, a complete version implemented in Python
  ☆26Updated last year
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆31Updated 5 years ago
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆52Updated 2 years ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆247Updated last year
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆117Updated last week
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆83Updated 2 months ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 3 years ago
• paulbrodersen / matplotlib_venn_wordcloud
  Venn diagrams with word clouds
  ☆50Updated last year
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆685Updated last year
• alexpreynolds / sample
  Performs memory-efficient reservoir sampling on very large input files delimited by newlines
  ☆69Updated 5 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated 4 months ago
• chebee7i / nxpd
  Draw NetworkX graphs using pydot/graphviz, with support for IPython notebooks.
  ☆118Updated 5 years ago
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆318Updated 9 months ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆101Updated last year
• elucify / blast-docs
  Wiki form of BLAST documentation from NCBI
  ☆16Updated 8 years ago
• BEETL / BEETL
  BEETL
  ☆97Updated 2 years ago
• go2starr / lshhdc
  LSH based high dimensional clustering for sets and points
  ☆79Updated 10 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• prashnts / pybloomfiltermmap3
  Fast Python Bloom Filter using Mmap
  ☆127Updated 11 months ago
• uqfoundation / klepto
  persistent caching to memory, disk, or database
  ☆268Updated 2 weeks ago
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆535Updated last year
• wbuntine / topic-models
  Topic modelling software using non-parametric methods
  ☆70Updated 8 years ago