koeppl / stringsheet
A cheatsheet for most common Stringology tasks
☆15Updated 3 years ago
Alternatives and similar repositories for stringsheet:
Users that are interested in stringsheet are comparing it to the libraries listed below
- R-Index-F Library for Pattern Matching☆13Updated 5 months ago
- Paper Collection for Stringologists☆16Updated 2 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆10Updated 4 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 4 months ago
- Implementation of a Backpack Quotient Filter☆11Updated 5 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆61Updated last year
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆25Updated last year
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆26Updated last year
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Compact Tree Representation☆16Updated 7 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Fast and cache-efficient full-text pangenome index☆27Updated this week
- LZ Double factor Factorization.☆11Updated 7 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆17Updated last month
- Implementation of eBWT using Prefix-free parse (PFP)☆12Updated 4 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 7 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- Dynamic succinct/compressed data structures☆112Updated 7 months ago
- Implementation of the sacabench framework☆15Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 7 years ago
- Efficient construction of the BWT using string compression☆17Updated 3 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 11 months ago