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)
  ☆88Updated last year
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated last year
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated 3 weeks ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated last week
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆56Updated last year
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 9 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated 2 years ago
• PASSIONLab / BELLA
  BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper
  ☆52Updated 3 years ago
• chfi / rs-gfa
  GFA parser in Rust
  ☆30Updated 2 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
• dkoslicki / MinHashMetagenomics
  Fast approximation of similarity for sets of very different sizes
  ☆20Updated 3 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 9 months ago
• mlin / iitii
  Implicit Interval Tree with Interpolation Index
  ☆41Updated 3 years ago
• RagnarGrootKoerkamp / minimizers
  Reference implementations of minimizer schemes to go with the mod-minimizers paper.
  ☆27Updated 7 months ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 4 years ago
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆72Updated last year
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆60Updated last week
• medvedevgroup / UST
  ☆24Updated 4 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 6 months ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆53Updated last year
• ddiazdom / lcg
  Efficient, parallel compression for terabyte-scale data
  ☆55Updated 2 months ago
• seqan / raptor
  A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
  ☆53Updated this week
• bcgsc / ntHash
  Fast hash function for DNA/RNA sequences
  ☆104Updated last year
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆85Updated 9 months ago
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆83Updated last year
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆10Updated 4 years ago
• mohsenzakeri / Movi
  Fast, Cache-Efficient, and Scalable Queries on Pangenomes
  ☆35Updated last month
• mkirsche / sapling
  SAPLING: Suffix Array Piecewise Linear INdex for Genomics
  ☆25Updated 5 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago