Alternatives and similar repositories for btl_bloomfilter

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

• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 9 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated 2 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated last year
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆21Updated 8 months ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated 2 months ago
• medvedevgroup / UST
  ☆24Updated 4 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆86Updated last year
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 4 years ago
• Malfoy / PAC
  ☆10Updated last year
• mlin / iitii
  Implicit Interval Tree with Interpolation Index
  ☆42Updated 3 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 4 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆93Updated 2 weeks ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 4 years ago
• dkoslicki / MinHashMetagenomics
  Fast approximation of similarity for sets of very different sizes
  ☆20Updated 3 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 10 years ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆11Updated 7 years ago
• rob-p / FQFeeder
  Self-contained, multi-threaded fasta/q parser
  ☆48Updated last week
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated 2 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 10 months ago
• lh3 / gwfa
  Proof-of-concept implementation of GWFA for sequence-to-graph alignment
  ☆56Updated last year
• BilkentCompGen / mrfast
  micro-read Fast Alignment Search Tool
  ☆19Updated 6 years ago
• chfi / rs-gfa
  GFA parser in Rust
  ☆30Updated 2 years ago
• seqan / raptor
  A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
  ☆53Updated last week
• rvaser / rala
  Layout module for raw de novo genome assembly of long uncorrected reads.
  ☆20Updated 5 years ago
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆60Updated this week
• mohsenzakeri / Movi
  Fast, Cache-Efficient, and Scalable Queries on Pangenomes
  ☆36Updated 3 months ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆57Updated last year
• algbio / SBWT
  Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
  ☆24Updated 10 months ago
• Kingsford-Group / kbf
  ☆15Updated 9 years ago