dominikkempa / fsais
External memory suffix array construction using inducing
☆10Updated 4 years ago
Alternatives and similar repositories for fsais:
Users that are interested in fsais are comparing it to the libraries listed below
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- TU DOrtmund lossless COMPression framework☆19Updated 8 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆64Updated last year
- linear time suffix array construction algorithm☆12Updated 8 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- R-Index-F Library for Pattern Matching☆13Updated 9 months ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- Implementation of a Backpack Quotient Filter☆11Updated 9 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆19Updated last month
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Succinct Data Structure Library 3.0☆94Updated 3 weeks ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated last week