bcgsc / btl_bloomfilter

Related projects ⓘ

Alternatives and complementary repositories for btl_bloomfilter

• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 9 months ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated 5 months ago
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 2 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated last month
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• vgteam / libhandlegraph
  Library for the Handle Graph abstraction
  ☆21Updated 4 months 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
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 3 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆26Updated last year
• dib-lab / MQF
  ☆12Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 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.
  ☆43Updated 2 years ago
• nh13 / pbgzip
  Parallel Block GZIP
  ☆49Updated 8 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated 8 months ago
• mklarqvist / libflagstats
  Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.
  ☆15Updated 4 years ago
• muellan / metacache
  memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping
  ☆57Updated last month
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆17Updated 7 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 2 years ago
• mlin / iitii
  Implicit Interval Tree with Interpolation Index
  ☆41Updated 2 years ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• chfi / rs-gfa
  GFA parser in Rust
  ☆29Updated last year
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆10Updated 4 months ago
• edawson / mkmh
  Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.
  ☆24Updated 3 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• rchikhi / rust-alignbench
  Pairwise nucleotide alignment benchmark of Rust bindings
  ☆31Updated last year
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 2 weeks ago