bingmann / cobs
COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
☆83Updated 9 months ago
Related projects ⓘ
Alternatives and complementary repositories for cobs
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated 3 weeks ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆80Updated 8 months ago
- A tool for merging large BWTs☆26Updated 3 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆76Updated 3 weeks ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 9 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Bit packed vector of integral values☆26Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago
- A repository for generating strobemers and evalaution☆77Updated 6 months ago
- BWT-based index for graphs☆71Updated this week
- An efficient index for the colored, compacted, de Bruijn graph☆107Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 11 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Substring index for paths in a graph☆60Updated this week
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago
- Implementation of a Backpack Quotient Filter☆10Updated 3 months ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆57Updated last month
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs☆204Updated 7 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 7 months ago
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 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
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- R-Index-F Library for Pattern Matching☆13Updated 3 months ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆58Updated last year