jlabeit / parallel-divsufsortLinks
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:
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Parallel Block GZIP☆50Updated 9 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Succinct Data Structure Library 3.0☆95Updated last week
- Dynamic succinct/compressed data structures☆112Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week
- Extremely fast inplace radix sort☆42Updated 5 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 7 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- 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
- Truly parallel gzip decompression☆125Updated 6 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Bit packed vector of integral values☆27Updated 6 months 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
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A lightweight suffix-sorting library☆388Updated 5 years ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆39Updated last year
- A C/C++ library for fast interval overlap queries (with a "bedtools coverage" example)☆168Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated last month
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Fast, portable C implementations of Needleman-Wunsch and Smith-Waterman sequence alignment☆96Updated 4 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- A very fast interval tree data structure☆126Updated 6 months ago
- ♥ Essential Functions for DNA Manipulation☆20Updated 2 months ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆27Updated 6 months ago
- A C++14 library for NGS data formats☆39Updated 6 years ago