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. Gabriele Fici, Nicola Prezza, Rossano Venturini. Adaptive learning of compressible strings. Theoretical Computer Science, Volume 896, 2021, Pages 46-52, ISSN 0304-3975, https://doi.org/10.1016/j.tcs.2021.10.003.

  2. Jarno Alanko, Giovanna D’Agostino, Alberto Policriti, Nicola Prezza. Wheeler languages. Information and Computation, 2021, 104820, ISSN 0890-5401, https://doi.org/10.1016/j.ic.2021.104820.

  3. Nicola Prezza, 2021. Subpath Queries on Compressed Graphs: A Survey. Algorithms. https://www.mdpi.com/1999-4893/14/1/14

  4. Gonzalo Navarro, Carlos Ochoa, and Nicola Prezza, 2020. On the Approximation Ratio of Ordered Parsings. IEEE Transactions on Information Theory (IEEE TIT).

  5. Nicola Prezza and Giovanna Rosone, 2020. Space-Efficient Construction of Compressed Suffix Trees. Theoretical Computer Science (TCS).

  6. Nicola Prezza, 2020. Optimal Substring-Equality Queries with Applications to Sparse Text Indexing. ACM Transactions on Algorithms (TALG).

  7. Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza. Optimal-Time Dictionary-Compressed Indexes. ACM Transactions on Algorithms (TALG).

  8. Louza, F.A., Telles, G.P., Gog, S. et al, 2020. gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms for Molecular Biology (AMB) 15, 18 (2020). https://doi.org/10.1186/s13015-020-00177-y

  9. Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone. Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinformatics 21, 260 (2020). https://doi.org/10.1186/s12859-020-03586-3

  10. Travis Gagie, Gonzalo Navarro, and Nicola Prezza, 2020. Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space. Journal of the ACM (JACM). https://doi.org/10.1145/3375890.

  11. 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. Information Systems, Volume 83, Pages 181-194.

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

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

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

  15. 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.

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

  17. 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.

  18. 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. Jarno Alanko, Nicola Cotumaccio, Nicola Prezza. Linear-time Minimization of Wheeler DFAs. DCC 2022

  2. Dominik Köppl, Gonzalo Navarro, Nicola Prezza. HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC 2022

  3. Giuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini. Compressed Weighted de Bruijn Graphs. CPM 2021

  4. Nicola Prezza, 2021. On Locating Paths in Compressed Tries. SODA 2021.

  5. Nicola Cotumaccio and Nicola Prezza, 2021. On Indexing and Compressing Finite Automata. SODA 2021.

  6. Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptak, Nicola Prezza, Marinella Sciortino and Anna Toffanello, 2021. Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021.

  7. Nicola Prezza, 2020. Indexing Compressed Text: A Tale of Time and Space (Invited Talk). 18th Symposium on Experimental Algorithms June 16-18, 2020 Catania, Italy. SEA 2020.

  8. Nicola Prezza and Giovanna Rosone, 2020. Faster Online Computation of the Succinct Longest Previous Factor Array. In: Beyond the Horizon of Computability. CiE 2020 Lecture Notes in Computer Science, vol 12098. Springer, Cham

  9. Tomasz Kociumaka, Gonzalo Navarro and Nicola Prezza, 2020. Towards a Definitive Measure of Repetitiveness. LATIN 2020.

  10. Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, and Nicola Prezza. Decompressing Lempel-Ziv Compressed Text. 2020 Data Compression Conference, DCC 2020, Snowbird, UT, USA, 2020, pp. 143-152, doi: 10.1109/DCC47342.2020.00022.

  11. Jarno Alanko, Giovanna D’Agostino, Alberto Policriti, and Nicola Prezza. Regular Languages meet Prefix Sorting. SODA 2020.

  12. Davide Della Giustina, Nicola Prezza and Rossano Venturini, 2019. A new Linear-time Algorithm for Centroid Decomposition. Proceedings of the 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019.

  13. Mai Alzamel, Alessio Conte, Daniele Greco, Veronica Guerrini, Costas Iliopoulos, Nadia Pisanti, Nicola Prezza, Giulia Punzi and Giovanna Rosone, 2019. Online Algorithms on Antipowers and Antiperiods. Proceedings of the 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019.

  14. Nicola Prezza, 2019. Optimal Rank and Select Queries on Dictionary-Compressed Text. Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019.

  15. Nicola Prezza and Giovanna Rosone, 2019. Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019.

  16. 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 2018, June 25-29, 2018, Los Angeles, CA. pp. 827-840. ACM.

  17. 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 2018. Pages 1459-1477.

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

  19. 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 2018. pp. 490-503. Springer, Cham.

  20. 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.

  21. 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.

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

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

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

  25. 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 2017, pp. 162-174. Springer, Cham.

  26. 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 2017, pp. 91-96. Springer, Cham.

  27. 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.

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

  29. 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 2015, pp. 26-39. Springer, Cham.

  30. 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 2015, pp. 13-20. Springer, Cham.

  31. 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 2015, pp. 587-598. Springer, Cham.

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

  33. 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 2012, pp. 12-19. ACM.