bcgsc / btl_bloomfilter
The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.
☆18Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for btl_bloomfilter
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated 3 weeks ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 2 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Parallel Block GZIP☆49Updated 8 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 7 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 11 months ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- R-Index-F Library for Pattern Matching☆13Updated 3 months ago
- Bit packed vector of integral values☆26Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 9 months ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆57Updated last month
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Fast approximation of similarity for sets of very different sizes☆20Updated 2 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 2 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- micro-read Fast Alignment Search Tool☆19Updated 5 years ago
- BWT-based index for graphs☆71Updated this week
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago
- dynamic-updateable-index☆11Updated 9 years ago