Fully functional suffix trees and optimal text searching in BWT-runs bounded space T Gagie, G Navarro, N Prezza Journal of the ACM (JACM) 67 (1), 1-54, 2020 | 181 | 2020 |
New algorithms on wavelet trees and applications to information retrieval T Gagie, G Navarro, SJ Puglisi Theoretical Computer Science 426, 25-41, 2012 | 133 | 2012 |
Succinct colored de Bruijn graphs MD Muggli, A Bowe, NR Noyes, PS Morley, KE Belk, R Raymond, T Gagie, ... Bioinformatics 33 (20), 3181-3187, 2017 | 127 | 2017 |
Optimal-time text indexing in BWT-runs bounded space T Gagie, G Navarro, N Prezza Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 123 | 2018 |
A faster grammar-based self-index T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi International Conference on Language and Automata Theory and Applications …, 2012 | 115 | 2012 |
Lightweight data indexing and compression in external memory P Ferragina, T Gagie, G Manzini Algorithmica 63 (3), 707-730, 2012 | 111 | 2012 |
Wheeler graphs: A framework for BWT-based data structures T Gagie, G Manzini, J Sirén Theoretical computer science 698, 67-78, 2017 | 108 | 2017 |
Range quantile queries: Another virtue of wavelet trees T Gagie, SJ Puglisi, A Turpin International Symposium on String Processing and Information Retrieval, 1-6, 2009 | 98 | 2009 |
LZ77-based self-indexing with faster pattern matching T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi Latin American Symposium on Theoretical Informatics, 731-742, 2014 | 90 | 2014 |
Variable-order de Bruijn graphs C Boucher, A Bowe, T Gagie, SJ Puglisi, K Sadakane 2015 data compression conference, 383-392, 2015 | 86 | 2015 |
Colored range queries and document retrieval T Gagie, J Kärkkäinen, G Navarro, SJ Puglisi Theoretical Computer Science 483, 36-50, 2013 | 82 | 2013 |
Composite repetition-aware data structures D Belazzougui, F Cunial, T Gagie, N Prezza, M Raffinot Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015 | 76 | 2015 |
Alphabet partitioning for compressed rank/select and applications J Barbay, T Gagie, G Navarro, Y Nekrich International Symposium on Algorithms and Computation, 315-326, 2010 | 75 | 2010 |
Prefix-free parsing for building big BWTs C Boucher, T Gagie, A Kuhnle, B Langmead, G Manzini, T Mun Algorithms for Molecular Biology 14, 1-15, 2019 | 73 | 2019 |
Efficient fully-compressed sequence representations J Barbay, F Claude, T Gagie, G Navarro, Y Nekrich Algorithmica 69 (1), 232-268, 2014 | 61 | 2014 |
Refining the r-index H Bannai, T Gagie, I Tomohiro Theoretical Computer Science 812, 96-108, 2020 | 58 | 2020 |
Large alphabets and incompressibility T Gagie Information Processing Letters 99 (6), 246-251, 2006 | 57 | 2006 |
Queries on LZ-bounded encodings D Belazzougui, T Gagie, P Gawrychowski, J Kärkkäinen, A Ordónez, ... 2015 Data Compression Conference, 83-92, 2015 | 54 | 2015 |
Hybrid indexes for repetitive datasets H Ferrada, T Gagie, T Hirvola, SJ Puglisi Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2014 | 52 | 2014 |
MONI: a pangenomic index for finding maximal exact matches M Rossi, M Oliva, B Langmead, T Gagie, C Boucher Journal of Computational Biology 29 (2), 169-187, 2022 | 51 | 2022 |