jlabeit / parallel-divsufsort
Parallel Lightweight Suffix Array Algorithm.
☆18Updated 8 years ago
Alternatives and similar repositories for parallel-divsufsort
Users that are interested in parallel-divsufsort are comparing it to the libraries listed below
Sorting:
- A tool for merging large BWTs☆26Updated 4 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆38Updated last year
- Parallel Block GZIP☆50Updated 8 years ago
- ♥ Essential Functions for DNA Manipulation☆20Updated 3 weeks ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆64Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Bit packed vector of integral values☆27Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated last year
- BWT-based index for graphs☆71Updated 2 months ago
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆47Updated last year
- Dynamic succinct/compressed data structures☆112Updated 11 months ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Streaming algorithm for computing kmer statistics for massive genomics datasets☆54Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 3 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 3 years ago
- R-Index-F Library for Pattern Matching☆13Updated 9 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated 11 months ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- Succinct Data Structure Library 3.0☆94Updated last month