| Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs | 0 | 0.34 | 2022 |
| Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. | 0 | 0.34 | 2022 |
| Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. | 0 | 0.34 | 2022 |
| Efficiently Merging r-indexes | 0 | 0.34 | 2021 |
| PHONI: Streamed Matching Statistics with Multi-Genome References | 0 | 0.34 | 2021 |
| The Alternating BWT: An algorithmic perspective | 0 | 0.34 | 2020 |
| Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. | 2 | 0.39 | 2020 |
| Practical Random Access to SLP-Compressed Texts. | 0 | 0.34 | 2020 |
| Matching Reads to Many Genomes with the r -Index. | 1 | 0.35 | 2020 |
| Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. | 0 | 0.34 | 2019 |
| Rpair: Rescaling RePair with Rsync. | 0 | 0.34 | 2019 |
| A compact index for order‐preserving pattern matching | 0 | 0.34 | 2019 |
| Lightweight merging of compressed indices based on BWT variants. | 1 | 0.36 | 2019 |
| Space-efficient merging of succinct de Bruijn graphs. | 0 | 0.34 | 2019 |
| A New Class of Searchable and Provably Highly Compressible String Transformations. | 0 | 0.34 | 2019 |
| Inducing the Lyndon Array. | 0 | 0.34 | 2019 |
| 25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241). | 0 | 0.34 | 2019 |
| Prefix-Free Parsing for Building Big BWTs. | 0 | 0.34 | 2018 |
| Block Sorting-Based Transformations on Words: Beyond the Magic BWT. | 1 | 0.35 | 2018 |
| STAble: a novel approach to de novo assembly of RNA-seq data and its application in a metabolic model network based metatranscriptomic workflow. | 0 | 0.34 | 2018 |
| Lyndon Array Construction during Burrows-Wheeler Inversion. | 0 | 0.34 | 2018 |
| Prefix-Free Parsing for Building Big BWTs. | 0 | 0.34 | 2018 |
| External memory BWT and LCP computation for sequence collections with applications. | 3 | 0.41 | 2018 |
| Wheeler Graphs: Variations on a Theme by Burrows and Wheeler. | 0 | 0.34 | 2017 |
| A Compact Index for Order-Preserving Pattern Matching | 1 | 0.35 | 2017 |
| Lightweight BWT and LCP Merging via the Gap Algorithm. | 5 | 0.45 | 2017 |
| An Encoding for Order-Preserving Matching. | 1 | 0.36 | 2017 |
| Wheeler graphs: A framework for BWT-based data structures. | 11 | 0.66 | 2017 |
| Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes. | 2 | 0.36 | 2016 |
| Compressing and Indexing Stock Market Data. | 1 | 0.36 | 2016 |
| From H&M to Gap for Lightweight BWT Merging. | 0 | 0.34 | 2016 |
| Relative Select. | 1 | 0.35 | 2015 |
| Longest Common Prefix with Mismatches. | 5 | 0.50 | 2015 |
| Design and analysis of periodic multiple seeds | 4 | 0.41 | 2014 |
| Compressed Spaced Suffix Arrays. | 0 | 0.34 | 2014 |
| Relative FM-Indexes | 6 | 0.41 | 2014 |
| Reusing an FM-index. | 0 | 0.34 | 2014 |
| Better spaced seeds using Quadratic Residues. | 8 | 0.49 | 2013 |
| Lightweight Data Indexing and Compression in External Memory | 56 | 2.50 | 2012 |
| Spaced seeds design using perfect rulers | 4 | 0.41 | 2011 |
| Move-to-Front, Distance Coding, and Inversion Frequencies revisited | 8 | 0.73 | 2010 |
| On compressing the textual web | 22 | 0.96 | 2010 |
| Permuted Longest-Common-Prefix Array | 55 | 1.75 | 2009 |
| Succinct Representations of Trees | 0 | 0.34 | 2009 |
| Compressing and indexing labeled trees, with applications | 62 | 1.71 | 2009 |
| The myriad virtues of Wavelet Trees | 32 | 1.30 | 2009 |
| Compressed representations of sequences and full-text indexes | 205 | 6.75 | 2007 |
| Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. | 65 | 1.88 | 2007 |
| The engineering of a compression boosting library: theory vs practice in BWT compression | 16 | 0.83 | 2006 |
| Indexing compressed text | 201 | 7.51 | 2005 |
