stringologytimes / StringologyTimesLinks
Paper Collection for Stringologists
☆17Updated 2 months ago
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
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated last year
- R-Index-F Library for Pattern Matching☆12Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated last month
- Succinct Data Structure Library 3.0☆96Updated 2 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 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
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆86Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Simple succinct data structures (in Rust)☆51Updated 11 months ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A Rust implementation of the Quad Wavelet Tree☆45Updated this week
- Compact Tree Representation☆16Updated 8 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆32Updated 7 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Bit packed vector of integral values☆27Updated 9 months ago
- SUccinct Retrieval Framework☆21Updated 9 years ago