| 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 | 187 | 2020 |
| At the roots of dictionary compression: string attractors D Kempa, N Prezza Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 145 | 2018 |
| 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 | 125 | 2018 |
| 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 | 77 | 2015 |
| Optimal-time dictionary-compressed indexes AR Christiansen, MB Ettienne, T Kociumaka, G Navarro, N Prezza ACM Transactions on Algorithms (TALG) 17 (1), 1-39, 2020 | 68 | 2020 |
| Towards a definitive measure of repetitiveness T Kociumaka, G Navarro, N Prezza Latin American Symposium on Theoretical Informatics, 207-219, 2020 | 61 | 2020 |
| LZ77 computation based on the run-length encoded BWT A Policriti, N Prezza Algorithmica 80 (7), 1986-2011, 2018 | 58 | 2018 |
| Universal compressed text indexing G Navarro, N Prezza Theoretical Computer Science 762, 41-50, 2019 | 53 | 2019 |
| Regular languages meet prefix sorting J Alanko, G D'Agostino, A Policriti, N Prezza Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 43 | 2020 |
| A framework of dynamic data structures for string processing N Prezza arXiv preprint arXiv:1701.07238, 2017 | 42 | 2017 |
| ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet N Prezza, C Del Fabbro, F Vezzi, E De Paoli, A Policriti Proceedings of the ACM conference on bioinformatics, computational biology …, 2012 | 41 | 2012 |
| On indexing and compressing finite automata N Cotumaccio, N Prezza Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 40 | 2021 |
| Toward a definitive compressibility measure for repetitive sequences T Kociumaka, G Navarro, N Prezza IEEE Transactions on Information Theory 69 (4), 2074-2092, 2022 | 39 | 2022 |
| Space-efficient re-pair compression P Bille, IL Gørtz, N Prezza 2017 Data Compression Conference (DCC), 171-180, 2017 | 38 | 2017 |
| Fast online Lempel-Ziv factorization in compressed space A Policriti, N Prezza International Symposium on String Processing and Information Retrieval, 13-20, 2015 | 31 | 2015 |
| Wheeler languages J Alanko, G D'Agostino, A Policriti, N Prezza Information and Computation 281, 104820, 2021 | 30 | 2021 |
| SNPs detection by eBWT positional clustering N Prezza, N Pisanti, M Sciortino, G Rosone Algorithms for Molecular Biology 14, 1-13, 2019 | 30 | 2019 |
| On the approximation ratio of Lempel-Ziv parsing T Gagie, G Navarro, N Prezza LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018 | 30 | 2018 |
| Transcriptomics and methylomics of CD4-positive T cells in arsenic-exposed women K Engström, TK Wojdacz, F Marabita, P Ewels, M Käller, F Vezzi, ... Archives of toxicology 91, 2067-2078, 2017 | 30 | 2017 |
| On the approximation ratio of ordered parsings G Navarro, C Ochoa, N Prezza IEEE Transactions on Information Theory 67 (2), 1008-1026, 2020 | 27 | 2020 |
Alberto PolicritiUniversity of Udine在 uniud.it 的电子邮件经过验证
