zephyrtronium / bwstLinks
Burrows-Wheeler-Scott transform
☆13Updated 11 years ago
Alternatives and similar repositories for bwst
Users that are interested in bwst are comparing it to the libraries listed below
Sorting:
- Bit packed vector of integral values☆27Updated 4 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- ☆16Updated 10 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Compact Data Structures Library☆100Updated 2 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
- Parallel Block GZIP☆50Updated 8 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- ☆23Updated last month
- elPrep reimplementations in C++ and Java, only for benchmark comparisons☆10Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- Algorithms that work on generic C arrays☆11Updated 8 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- Low memory multithreaded hash table☆24Updated 10 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Custom compression for CRAM and others.☆32Updated last week
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago