Alternatives and similar repositories for btl_bloomfilter:

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

• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated 10 months ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated 5 months ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆12Updated 8 years ago
• dib-lab / MQF
  ☆12Updated last year
• mklarqvist / libflagstats
  Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.
  ☆15Updated 5 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 8 months ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated this week
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated last month
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• rchikhi / rust-alignbench
  Pairwise nucleotide alignment benchmark of Rust bindings
  ☆31Updated last year
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• dkoslicki / MinHashMetagenomics
  Fast approximation of similarity for sets of very different sizes
  ☆21Updated 3 years ago
• medvedevgroup / UST
  ☆25Updated 3 years ago
• vgteam / libhandlegraph
  Library for the Handle Graph abstraction
  ☆23Updated 2 weeks ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 4 years ago
• arun-sub / bwa-mem2
  Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.
  ☆13Updated 3 years ago
• onecodex / finch-rs
  A genomic minhashing implementation in Rust
  ☆93Updated last year
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 2 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆50Updated 4 months ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated last year
• Malfoy / PAC
  ☆10Updated last year
• rob-p / FQFeeder
  Self-contained, multi-threaded fasta/q parser
  ☆43Updated 5 months ago