Alternatives and similar repositories for SuffixTree

Users that are interested in SuffixTree are comparing it to the libraries listed below

• ptrus / suffix-trees
  Python implementation of Suffix Trees and Generalized Suffix Trees.
  ☆127Updated 5 years ago
• 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 6 months ago
• cytoscape / py2cytoscape
  Python utilities for Cytoscape and Cytoscape.js
  ☆176Updated 3 years ago
• mutux / Ukkonen-s-Suffix-Tree-Algorithm
  Ukkonen's suffix tree algorithm, a complete version implemented in Python
  ☆26Updated 2 years ago
• GuyAllard / markov_clustering
  markov clustering in python
  ☆175Updated 4 years ago
• brentp / interlap
  fast, pure-python interval overlap testing
  ☆52Updated 5 years ago
• ucsd-ccbb / visJS2jupyter
  visJS2jupyter is a tool to bring the interactivity of networks created with vis.js into jupyter notebook cells
  ☆78Updated 2 years ago
• nvictus / pqdict
  A Pythonic indexed priority queue
  ☆92Updated last month
• cpcloud / ipython-autotime
  Time everything in IPython
  ☆126Updated 2 years ago
• thearn / simple-cython-example
  A small project template that shows how to wrap C code into python using cython, along with other packaging concepts
  ☆135Updated 8 months ago
• lanl / pyxDamerauLevenshtein
  pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
  ☆250Updated 3 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
• miohtama / python-Levenshtein
  The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
  ☆389Updated 3 years ago
• GGiecold-zz / Cluster_Ensembles
  A package for combining multiple partitions into a consolidated clustering. The combinatorial optimization problem of obtaining such a co…
  ☆74Updated 3 years ago
• DanielStutzbach / blist
  A list-like type with better asymptotic performance and similar performance on small lists
  ☆316Updated 3 years ago
• antmd / graph-tool
  graph-tool - Efficient network analysis
  ☆110Updated 2 years ago
• fastcluster / fastcluster
  Fast hierarchical clustering routines for R and Python.
  ☆156Updated last week
• hiway / python-bloom-filter
  Bloom filter for Python
  ☆86Updated 4 years ago
• koteth / python_mcl
  markov cluster algorithm - python
  ☆82Updated 8 years ago
• cgat-developers / ruffus
  CGAT-ruffus is a lightweight python module for running computational pipelines
  ☆175Updated 4 years ago
• gpoulter / python-ngram
  Python Set subclass that supports searching by ngram similarity
  ☆119Updated 4 years ago
• joseph-fox / python-bloomfilter
  Scalable Bloom Filter implemented in Python
  ☆165Updated 2 months ago
• borzunov / cpmoptimize
  🚀 🐍 Optimizes Python bytecode calculating linear recurrences, reducing the time complexity from O(n) to O(log n)
  ☆183Updated 3 years ago
• alevchuk / pairwise-alignment-in-python
  Pairwise string alignment in Python (Needleman-Wunsch and Smith-Waterman algorithms)
  ☆97Updated 7 years ago
• xysun / regex
  Regular expression engine in Python using Thompson's algorithm.
  ☆114Updated 5 years ago
• lfiaschi / fastbetabino
  Superfast betabinomial fit implemented in Cython
  ☆15Updated 3 months ago
• trueprice / python-graph-clustering
  A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…
  ☆96Updated 7 years ago
• coelias / Pynteractive
  Pilot to work with dynamic visualization by using python
  ☆60Updated 5 years ago
• benhoyt / pybktree
  Python BK-tree data structure to allow fast querying of "close" matches
  ☆186Updated 4 years ago