nicolaprezza / r-index
An optimal space run-length Burrows-Wheeler transform full-text index
☆58Updated last year
Related projects ⓘ
Alternatives and complementary repositories for r-index
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- R-Index-F Library for Pattern Matching☆13Updated 3 months ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆24Updated last year
- Dynamic succinct/compressed data structures☆111Updated 6 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- Implementation of a Backpack Quotient Filter☆10Updated 3 months ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆26Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated last month
- BWT-based index for graphs☆71Updated 2 weeks ago
- Bit packed vector of integral values☆26Updated last year
- Fast and cache-efficient full-text pangenome index☆25Updated last week
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- compressed, queryable variation graphs☆11Updated 9 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- Compact Tree Representation☆16Updated 7 years ago
- Incremental construction of FM-index for DNA sequences☆68Updated 5 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago