bcgsc / btl_bloomfilterLinks
The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.
☆18Updated 3 years ago
Alternatives and similar repositories for btl_bloomfilter
Users that are interested in btl_bloomfilter are comparing it to the libraries listed below
Sorting:
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Bit packed vector of integral values☆27Updated 5 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 5 years ago
- R-Index-F Library for Pattern Matching☆13Updated 11 months ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Updated 5 months ago
- modified from gitlab.com/manzai/Big-BWT to support fasta files☆9Updated 5 months ago
- Implementation of a Backpack Quotient Filter☆12Updated last week
- Self-contained, multi-threaded fasta/q parser☆45Updated 9 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Fast approximation of similarity for sets of very different sizes☆21Updated 3 years ago
- Fast Approximate Pattern Matching using Search Schemes☆15Updated last week
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- micro-read Fast Alignment Search Tool☆19Updated 5 years ago
- ☆13Updated last year
- ☆10Updated last year
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆27Updated 5 months ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆59Updated last month
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago