| Efficiently Merging r-indexes | 0 | 0.34 | 2021 |
| Distance indexing and seed clustering in sequence graphs. | 0 | 0.34 | 2020 |
| Haplotype-aware graph indexes. | 1 | 0.35 | 2018 |
| Relative Suffix Trees. | 0 | 0.34 | 2018 |
| Document Retrieval on Repetitive String Collections. | 3 | 0.46 | 2017 |
| Indexing Variation Graphs. | 0 | 0.34 | 2017 |
| Wheeler graphs: A framework for BWT-based data structures. | 11 | 0.66 | 2017 |
| RLZAP: Relative Lempel-Ziv with Adaptive Pointers. | 0 | 0.34 | 2016 |
| Relative Select. | 1 | 0.35 | 2015 |
| Document Counting in Compressed Space | 3 | 0.39 | 2015 |
| Burrows-Wheeler Transform for Terabases | 0 | 0.34 | 2015 |
| Relative Compressed Suffix Trees | 2 | 0.37 | 2015 |
| Document Counting in Practice. | 0 | 0.34 | 2014 |
| Document Retrieval on Repetitive Collections. | 7 | 0.44 | 2014 |
| Relative FM-Indexes | 6 | 0.41 | 2014 |
| Reusing an FM-index. | 0 | 0.34 | 2014 |
| Document Listing On Repetitive Collections | 12 | 0.52 | 2013 |
| Distribution-aware compressed full-text indexes | 1 | 0.35 | 2013 |
| Indexing finite language representation of population genotypes | 3 | 0.44 | 2011 |
| Storage and retrieval of highly repetitive sequence collections. | 80 | 2.31 | 2010 |
| Sampled longest common prefix array | 9 | 0.50 | 2010 |
| Fast in-memory XPath search using compressed indexes. | 7 | 0.43 | 2010 |
| Storage and Retrieval of Individual Genomes. | 22 | 1.23 | 2009 |
| Compressed Suffix Arrays for Massive Data | 13 | 0.94 | 2009 |
| Fast In-Memory XPath Search over Compressed Text and Tree Indexes | 8 | 0.62 | 2009 |
| Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections | 33 | 1.37 | 2008 |
