BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
☆25Apr 25, 2022Updated 3 years ago
Alternatives and similar repositories for BWTIL
Users that are interested in BWTIL are comparing it to the libraries listed below
Sorting:
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- A space-efficient compressor based on the Re-Pair grammar☆10Apr 6, 2017Updated 8 years ago
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- FM-index representation of a de Bruijn graph☆26Aug 7, 2017Updated 8 years ago
- BWT-based index for graphs☆73Mar 12, 2025Updated 11 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Jan 25, 2024Updated 2 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆26Feb 16, 2025Updated last year
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Apr 26, 2022Updated 3 years ago
- gvcf aggregation tool☆12Feb 7, 2018Updated 8 years ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Feb 24, 2026Updated last week
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 12 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆34Mar 29, 2019Updated 6 years ago
- linear time suffix array construction algorithm☆12Oct 28, 2016Updated 9 years ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated last year
- Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,☆12Oct 26, 2019Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Nov 7, 2025Updated 3 months ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- EWAH Compressed Bitmaps☆25Sep 25, 2020Updated 5 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year