Alternatives and similar repositories for bsort

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

• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆87Updated last year
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago
• nh13 / pbgzip
  Parallel Block GZIP
  ☆50Updated 9 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 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
• 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
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 5 years ago
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 4 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 10 years ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆11Updated 7 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆82Updated last year
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated 4 years ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆25Updated 5 years ago
• Ritu-Kundu / Superbubbles
  SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.
  ☆12Updated 6 years ago
• medvedevgroup / UST
  ☆24Updated 4 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆28Updated 10 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated this week
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆10Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆26Updated 4 years ago
• Malfoy / PAC
  ☆10Updated last year
• Malfoy / BCALM
  de Bruijn CompAction in Low Memory
  ☆22Updated 9 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago