arq5x / bitsLinks
BITS: Binary Interval Search
☆25Updated 8 years ago
Alternatives and similar repositories for bits
Users that are interested in bits are comparing it to the libraries listed below
Sorting:
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Bonsai: Fast, flexible taxonomic analysis and classification☆72Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆52Updated last year
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 6 months ago
- Parallel Block GZIP☆50Updated 9 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- ALPACA is a caller for genomic variants (single nucleotide and small indels) from next-generation sequencing data that uses a novel algeb…☆23Updated 9 months ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Compressing next-generation sequencing data with extreme prejudice.☆83Updated 3 years ago
- Basic, no assumptions, multi-pileup☆24Updated 11 years ago
- Suite of tools for use in genome assembly and consensus. Work in progress.☆31Updated 4 years ago
- ☆18Updated 10 years ago
- Implicit Interval Tree with Interpolation Index☆41Updated 3 years ago
- Go implementation of ntHash☆20Updated 3 years ago
- A genomic minhashing implementation in Rust☆99Updated 2 months ago
- k8 Javascript shell☆157Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- A demo implementation of Succinct de Bruijn Graphs.☆25Updated 12 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- De Bruijn graph representation in low memory☆36Updated last year
- find large indels (in the blind spot between GATK/freebayes and SV callers)☆39Updated 7 years ago