jlabeit / parallel-divsufsort
Parallel Lightweight Suffix Array Algorithm.
☆17Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for parallel-divsufsort
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- A tool for merging large BWTs☆26Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated last month
- Parallel Block GZIP☆49Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Bit packed vector of integral values☆26Updated last year
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆24Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆80Updated 8 months ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆35Updated 10 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 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
- efficient alignment of strings to partially ordered string graphs☆33Updated 2 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆58Updated last year
- Parallel k-mer indexing for biological sequences☆12Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- A C/C++ library for fast interval overlap queries (with a "bedtools coverage" example)☆165Updated 5 months ago
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Extremely fast inplace radix sort☆42Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated 8 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago