jlabeit / parallel-divsufsort
Parallel Lightweight Suffix Array Algorithm.
☆17Updated 7 years ago
Related projects: ⓘ
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 7 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆57Updated last year
- 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
- A compressed, associative, exact, and weighted dictionary for k-mers.☆83Updated 2 weeks ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆99Updated 9 years ago
- Parallel Block GZIP☆49Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆17Updated last week
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆42Updated 10 months ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 2 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆23Updated last year
- Collection of Suffix Array Construction Algorithms (SACAs)☆28Updated 5 years ago
- R-Index-F Library for Pattern Matching☆13Updated last month
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 3 years ago
- Compact Tree Representation☆16Updated 7 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-based index for graphs☆70Updated 10 months ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 6 months ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆80Updated 6 months ago
- Bit packed vector of integral values☆25Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆58Updated 10 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆39Updated last year
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆15Updated 3 years ago