stringologytimes / StringologyTimesLinks
Paper Collection for Stringologists
☆17Updated this week
Alternatives and similar repositories for StringologyTimes
Users that are interested in StringologyTimes are comparing it to the libraries listed below
Sorting:
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated last year
- R-Index-F Library for Pattern Matching☆12Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 months ago
- Succinct Data Structure Library 3.0☆99Updated last week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 4 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Simple succinct data structures (in Rust)☆51Updated last year
- Implementation of the sacabench framework☆18Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Implementation of a Backpack Quotient Filter☆13Updated 4 months ago
- A lightweight suffix-sorting library enhanced with LCP construction☆12Updated 5 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 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
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- Relative data structures based on the BWT☆12Updated 7 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Updated 5 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆87Updated last year
- A tool for merging large BWTs☆25Updated 5 years ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆34Updated 3 weeks ago
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆17Updated 4 years ago
- Efficient construction of the BWT using string compression☆20Updated 6 months ago
- A new lossless data compression algorithm☆11Updated 2 weeks ago