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 4 years ago
• pyranges / ncls
  NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
  ☆224Updated 7 months ago
• chaimleib / intervaltree
  A mutable, self-balancing interval tree. Queries may be by point, by range overlap, or by range containment.
  ☆681Updated last month
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆54Updated 2 years ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆51Updated last week
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 5 years ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆250Updated 4 months ago
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆339Updated 3 months ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆82Updated last year
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆305Updated last year
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆157Updated 3 weeks ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆126Updated 2 years ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆251Updated 7 years ago
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆389Updated 3 years ago
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆117Updated 6 years ago
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆86Updated last week
• pycompression / xopen
  Open compressed files in Python
  ☆81Updated 3 months ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆175Updated 4 years ago
• ImSoErgodic / py-upset
  A pure-python implementation of the UpSet suite of visualisation methods by Lex, Gehlenborg et al.
  ☆323Updated 7 years ago
• mattilyra / LSH
  Locality Sensitive Hashing using MinHash in Python/Cython to detect near duplicate text documents
  ☆292Updated 2 years ago
• paulbrodersen / matplotlib_venn_wordcloud
  Venn diagrams with word clouds
  ☆51Updated last year
• kasravnd / SuffixTree
  Optimized implementation of suffix tree in python using Ukkonen's algorithm.
  ☆53Updated 3 months ago
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆122Updated this week
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆708Updated last year
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆110Updated 2 years ago
• cmaclell / concept_formation
  Python implementations of TRESTLE, COBWEB/3, and COBWEB
  ☆61Updated 2 years ago
• pytries / datrie
  Fast, efficiently stored Trie for Python. Uses libdatrie.
  ☆547Updated last month