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:
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- ALPACA is a caller for genomic variants (single nucleotide and small indels) from next-generation sequencing data that uses a novel algeb…☆23Updated 7 months ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆71Updated last year
- 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
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years 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
- Implicit Interval Tree with Interpolation Index☆41Updated 2 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 4 months ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Go implementation of ntHash☆20Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Suite of tools for use in genome assembly and consensus. Work in progress.☆31Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 years ago
- Substring index for paths in a graph☆60Updated 2 months ago
- SQL-like query language for the SAM/BAM file format☆29Updated last year
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆87Updated this week
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- ☆13Updated last year
- dynamic-updateable-index☆11Updated 9 years ago
- Reference server implementation for the GA4GH HTSget API standard.☆12Updated 2 years ago
- Write-once-read-many table for large datasets.☆27Updated last year
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- A fast and space-efficient pre-filter for estimating the quantification of very large collections of nucleotide sequences☆14Updated this week
- Python bindings to minimap2☆16Updated 7 years ago