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
  ☆164Updated 3 years ago
• louisabraham / pydivsufsort
  Python package for string algorithms ➰
  ☆48Updated 8 months ago
• pyranges / ncls
  NCLS. Basically a static interval-tree that is silly fast for both construction and lookups. Deprecated but maintained.
  ☆223Updated 2 months ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆53Updated last year
• fujimotos / polyleven
  A Fast Levenshtein Distance Library for Python
  ☆84Updated 7 months ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• chrisjmccormick / MinHash
  Example Python code for comparing documents using MinHash
  ☆252Updated 6 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
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• taleinat / fuzzysearch
  Find parts of long text or data, allowing for some changes/typos.
  ☆330Updated 4 months ago
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆153Updated 2 weeks ago
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 4 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• barrust / pyprobables
  Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
  ☆122Updated last week
• doukremt / distance
  Levenshtein and Hamming distance computation
  ☆116Updated 5 years ago
• roy-ht / editdistance
  Fast implementation of the edit distance(Levenshtein distance)
  ☆689Updated last year
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆103Updated last year
• pycompression / xopen
  Open compressed files in Python
  ☆76Updated 4 months ago
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 7 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆175Updated 3 years ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆249Updated 2 weeks ago
• cmaclell / concept_formation
  Python implementations of TRESTLE, COBWEB/3, and COBWEB
  ☆61Updated last year
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 3 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
• yunwilliamyu / hyperminhash
  LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash
  ☆56Updated 5 years ago
• pablocael / pynear
  A python library for efficient KNN search within metric spaces using multiple distance functions.
  ☆14Updated last year
• mattilyra / LSH
  Locality Sensitive Hashing using MinHash in Python/Cython to detect near duplicate text documents
  ☆291Updated 2 years ago
• alexpreynolds / sample
  Performs memory-efficient reservoir sampling on very large input files delimited by newlines
  ☆69Updated 5 years ago