| No. |
Title |
Author |
Year |
| 1 |
Acceleration of FM-Index Queries Through Prefix-Free Parsing |
Hong, Aaron et al. |
2023 |
| 2 |
MONI Can Find k-MEMs |
Tatarnikov, Igor et al. |
2023 |
| 3 |
RLBWT Tricks |
Brown, Nathaniel K. et al. |
2022 |
| 4 |
Simple Worst-Case Optimal Adaptive Prefix-Free Coding |
Gagie, Travis |
2022 |
| 5 |
A Fast and Small Subsampled R-Index |
Cobas, Dustin et al. |
2021 |
| 6 |
Compressing and Indexing Aligned Readsets |
Gagie, Travis et al. |
2021 |
| 7 |
25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241) |
Gagie, Travis et al. |
2019 |
| 8 |
Simulating the DNA Overlap Graph in Succinct Space |
Díaz-Domínguez, Diego et al. |
2019 |
| 9 |
Online LZ77 Parsing and Matching Statistics with RLBWTs |
Bannai, Hideo et al. |
2018 |
| 10 |
Prefix-Free Parsing for Building Big BWTs |
Boucher, Christina et al. |
2018 |
| 11 |
Tree Path Majority Data Structures |
Gagie, Travis et al. |
2018 |
| 12 |
An Encoding for Order-Preserving Matching |
Gagie, Travis et al. |
2017 |
| 13 |
Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings |
Cunha, Luís et al. |
2017 |
| 14 |
Path Queries on Functions |
Gagie, Travis et al. |
2017 |
| 15 |
Minimax Trees in Linear Time with Applications |
Gawrychowski, Pawel et al. |
2009 |
