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:
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- ☆13Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 4 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- dynamic-updateable-index☆11Updated 9 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
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- GFA parser in Rust☆31Updated 2 years ago
- Library for the Handle Graph abstraction☆23Updated 2 months ago
- micro-read Fast Alignment Search Tool☆19Updated 5 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- Parallel Block GZIP☆50Updated 8 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Hail: extract lines from a file, a la `head -n x | tail -n y`☆9Updated 4 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- R-Index-F Library for Pattern Matching☆13Updated 9 months ago