R-Index-F Library for Pattern Matching
☆12Aug 8, 2024Updated last year
Alternatives and similar repositories for r-index-f
Users that are interested in r-index-f are comparing it to the libraries listed below
Sorting:
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 3 weeks ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 4 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- String Visualizer☆12Dec 18, 2025Updated 2 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Efficient construction of the BWT using string compression☆21Updated this week
- MEMO: MEM-based pangenome indexing for k-mer queries☆20Jun 11, 2024Updated last year
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 2 months ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆20Sep 13, 2025Updated 5 months ago
- Efficient, parallel compression for terabyte-scale data☆61Feb 25, 2026Updated last week
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Mumemto: multi-MUM and MEM finding across pangenomes☆128Dec 8, 2025Updated 3 months ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- Pan-Genomic Matching Statistics☆55Apr 3, 2024Updated last year
- ☆12Sep 5, 2025Updated 6 months ago
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- Collection of Suffix Array Construction Algorithms (SACAs)☆34Mar 29, 2019Updated 6 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆27Dec 2, 2025Updated 3 months ago
- MONI: A Pangenomic Index for Finding MEMs☆37Mar 25, 2025Updated 11 months ago
- A SIMD-accelerated library to compute random minimizers☆39Mar 1, 2026Updated last week
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Feb 24, 2026Updated 2 weeks ago
- ☆13Nov 15, 2017Updated 8 years ago
- Minimum Bait Cover Toolkit Syotti.☆13Jan 22, 2025Updated last year
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- ☆11Feb 21, 2023Updated 3 years ago
- Probabilistic single-individual haplotyping☆10Mar 15, 2019Updated 6 years ago
- BLEU Score in Rust☆12Mar 1, 2026Updated last week
- An implementation of "Subspace Representations for Soft Set Operations and Sentence Similarities" (NAACL 2024)☆10May 31, 2024Updated last year
- Tokyo Metropolitan University Paraphrase Corpus (TMUP)☆11Jun 12, 2017Updated 8 years ago
- suffix array construction and searching algorithms for in-memory binary data.☆12Sep 10, 2022Updated 3 years ago