Below you find a list of my publications.

PhD thesis

  • Nicola Prezza, 2017. Compressed Computation for Text Indexing. University of Udine. Supervisor: prof. Alberto Policriti. Awarded one of the two Best Scientific PhD thesis award 2017, University of Udine.

International Journals

  1. Antonio Fariña, Miguel A. Martı́nez-Prieto, Francisco Claude, Gonzalo Navarro, Juan J. Lastra-Díaz [r], Nicola Prezza [r], and Diego Seco [r], 2019 ([r] = reproducibility reviewers). On the Reproducibility of Experiments of Indexing Repetitive Document Collections. Accepted for publication in Information Systems.

  2. Nicola Prezza, Nadia Pisanti, Marinella Sciortino, and Giovanna Rosone, 2019. SNPs detection by eBWT positional clustering. Algorithms for Molecular Biology, 14(1), p.3.

  3. Gonzalo Navarro and Nicola Prezza, 2019. Universal compressed text indexing. Theoretical Computer Science, 762, pp.41-50.

  4. Philip Bille, Travis Gagie, Inge Li Gørtz, and Nicola Prezza, 2018. A separation between RLSLPs and LZ77. Journal of Discrete Algorithms, 50, pp.36-39.

  5. Karin Engström, Tomasz K. Wojdacz, Francesco Marabita, Philip Ewels, Max Käller, Francesco Vezzi, Nicola Prezza, Joel Gruselius, Marie Vahter, and Karin Broberg, 2017. Transcriptomics and methylomics of CD4-positive T cells in arsenic-exposed women. Archives of toxicology 91, no. 5 (2017): 2067-2078.

  6. Alberto Policriti and Nicola Prezza, 2018. LZ77 computation based on the run-length encoded BWT. Algorithmica. 80(7), pp.1986-2011.

  7. Nicola Prezza, Francesco Vezzi, Max Käller, and Alberto Policriti, 2016. Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2. BMC bioinformatics 17, no. 4: 69.

  8. Alberto Policriti and Nicola Prezza, 2015. Fast randomized approximate string matching with succinct hash data structures. BMC bioinformatics 16, no. 9: S4.

International Conferences

  1. Nicola Prezza, 2019. Optimal Rank and Select Queries on Dictionary-Compressed Text. Accepted for publication in proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM).

  2. Nicola Prezza and Giovanna Rosone, 2019. Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. Accepted for publication in proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM).

  3. Dominik Kempa and Nicola Prezza, 2018. At the Roots of Dictionary Compression: String Attractors. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), June 25-29, 2018, Los Angeles, CA. pp. 827-840. ACM.

  4. Travis Gagie, Gonzalo Navarro, and Nicola Prezza, 2018. Optimal-Time Text Indexing in BWT-runs Bounded Space. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Pages 1459-1477.

  5. Nicola Prezza, 2018. In-Place Sparse Suffix Sorting. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Pages 1496-1508.

  6. Travis Gagie, Gonzalo Navarro, and Nicola Prezza, 2018. On the Approximation Ratio of Lempel-Ziv Parsing. In Proceedings of the 13th Latin American Symposium on Theoretical Informatics (LATIN). pp. 490-503. Springer, Cham.

  7. Nicola Prezza, Nadia Pisanti, Marinella Sciortino, and Giovanna Rosone, 2018. Detecting mutations by eBWT. In 18th International Workshop on Algorithms in Bioinformatics, (WABI 2018). Vol. 113, pp. 1-15. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.

  8. Dominik Kempa, Alberto Policriti, Nicola Prezza, and Eva Rotenberg, 2018. String Attractors: Verification and Optimization. In 26th Annual European Symposium on Algorithms (ESA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

  9. Nicola Prezza, 2018. On String Attractors. Proceedings of the 19th Italian Conference on Theoretical Computer Science (ICTCS), Urbino, Italy. September 18-20. Pages 12-16.

  10. Philip Bille, Inge Li Gørtz, and Nicola Prezza, 2017. Space-Efficient Re-Pair Compression. In Proceedings of the Data Compression Conference (DCC). pp. 171-180. IEEE.

  11. Nicola Prezza, 2017. A Framework of Dynamic Data Structures for String Processing. Proceedings of the 16th International Symposium on Experimental Algorithms (SEA).

  12. Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, and Mathieu Raffinot, 2017. Flexible indexing of repetitive collections. In Proceedings of the 13th Conference on Computability in Europe (CiE), pp. 162-174. Springer, Cham.

  13. Philip Bille, Anders Roy Christiansen, Nicola Prezza, and Frederik Rye Skjoldjensen, 2017. Succinct Partial Sums and Fenwick Trees. In 24th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 91-96. Springer, Cham.

  14. Alberto Policriti and Nicola Prezza, 2017. From LZ77 to the Run-Length Encoded Burrows-Wheeler Transform, and Back. In proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM), 2017.

  15. Alberto Policriti and Nicola Prezza, 2016 Computing LZ77 in run-compressed space. In Data Compression Conference (DCC), 2016, pp. 23-32. IEEE.

  16. Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, and Mathieu Raffinot, 2015. Composite repetition-aware data structures. In Proceedings of the 26th Symposium on Combinatorial Pattern Matching (CPM), pp. 26-39. Springer, Cham.

  17. Alberto Policriti and Nicola Prezza, 2015. Fast online Lempel-Ziv factorization in compressed space. In Proceedings of the 22nd International Symposium on String Processing and Information Retrieval (SPIRE), pp. 13-20. Springer, Cham.

  18. Alberto Policriti, Nicola Gigante, and Nicola Prezza, 2015. Average linear time and compressed space construction of the Burrows-Wheeler transform. In 9th International Conference on Language and Automata Theory and Applications (LATA), pp. 587-598. Springer, Cham.

  19. Alberto Policriti and Nicola Prezza, 2014. Hashing and indexing: Succinct data structures and smoothed analysis. In 25th International Symposium on Algorithms and Computation (ISAAC), pp. 157-168. Springer, Cham.

  20. Nicola Prezza, Cristian Del Fabbro, Francesco Vezzi, Emanuale De Paoli, and Alberto Policriti, 2012. ERNE-BS5: aligning BS-treated sequences by multiple hits on a 5-letters alphabet. In Proceedings of the ACM conference on bioinformatics, computational biology and biomedicine (ACM-BCB), pp. 12-19. ACM.