Alternatives and similar repositories for succinct-graph

Users that are interested in succinct-graph are comparing it to the libraries listed below

• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆24Updated 5 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 10 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated last year
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 5 years ago
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆72Updated last year
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆44Updated 3 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated last month
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆156Updated last year
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆53Updated last year
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 6 months ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆84Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 3 weeks ago
• holtjma / msbwt
  A python toolkit for building and querying multi-string BWTs
  ☆27Updated 8 years ago
• nh13 / pbgzip
  Parallel Block GZIP
  ☆50Updated 9 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 9 months ago
• Malfoy / Blight
  De Bruijn graph representation in low memory
  ☆35Updated last year
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆86Updated 10 months ago
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 12 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• brc7 / DiversitySampling
  ☆10Updated 3 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆26Updated 4 years ago
• COMBINE-lab / rainbowfish
  A succinct colored dBG representation
  ☆12Updated 7 years ago