Alternatives and similar repositories for shuff

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

• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 months ago
• will-rowe / nthash
  Go implementation of ntHash
  ☆20Updated 3 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 10 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 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
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated 2 months ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated this week
• shenwei356 / bwt
  Burrows-Wheeler Transform and FM-index in golang
  ☆20Updated 2 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated 3 weeks ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆11Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated 2 months ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 10 years ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆51Updated 9 months ago
• noporpoise / jelly-hash
  Low memory multithreaded hash table
  ☆24Updated 10 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
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 7 years ago
• attractivechaos / dlist
  Five implementations of double linked lists to demonstrate generic data structures in C
  ☆16Updated 5 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 4 years ago
• arq5x / bits
  BITS: Binary Interval Search
  ☆25Updated 8 years ago
• 38 / grass
  ☆22Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago