Alternatives and similar repositories for shuff:

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

• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 2 months ago
• dib-lab / MQF
  ☆12Updated last year
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• will-rowe / nthash
  Go implementation of ntHash
  ☆20Updated 3 years ago
• kdm9 / hail
  Hail: extract lines from a file, a la `head -n x | tail -n y`
  ☆9Updated 4 years ago
• shenwei356 / bwt
  Burrows-Wheeler Transform and FM-index in golang
  ☆20Updated last year
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• marco-oliva / pfp
  Prefix Free Parsing
  ☆8Updated last year
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• arq5x / bits
  BITS: Binary Interval Search
  ☆25Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated last week
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆43Updated 3 years ago
• wafflespeanut / nucleic-acid
  BWT, FM-index and bits vector for analyzing DNA sequence data.
  ☆17Updated 7 years ago
• art4711 / random-double
  An algorithm for generating random doubles.
  ☆12Updated 8 years ago
• vgteam / xg-old
  succinct labeled graphs with collections and paths
  ☆15Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 8 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year