PREZZA Nicola

Qualifica Ricercatore
E-mail nicola.prezza@unive.it
Sito web www.unive.it/persone/nicola.prezza (scheda personale)
Struttura Dipartimento di Scienze Ambientali, Informatica e Statistica
Sito web struttura: https://www.unive.it/dais
Sede: Campus scientifico via Torino
Stanza: studio Z.B17 / Assegnisti B2 (edificio Zeta B)

Pubblicazioni per tipologia

Articolo su rivista
  • Prezza, Nicola; Rosone, Giovanna (2021), Space-efficient construction of compressed suffix trees in THEORETICAL COMPUTER SCIENCE, vol. 852, pp. 138-156 (ISSN 0304-3975)
    Link DOI Link al documento: 10278/3734792
  • Prezza, Nicola (2021), Subpath Queries on Compressed Graphs: A Survey in ALGORITHMS, vol. 14, pp. 14 (ISSN 1999-4893)
    Link DOI Link al documento: 10278/3734911
  • GAGIE Travis; NAVARRO Gonzalo; PREZZA Nicola (2020), Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space in JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, vol. 67, pp. 1-54 (ISSN 0004-5411)
    Link DOIURL correlato Link al documento: 10278/3729797
  • Louza F.A.; Telles G.P.; Gog S.; Prezza N.; Rosone G. (2020), Gsufsort: Constructing suffix arrays, LCP arrays and BWTs for string collections in ALGORITHMS FOR MOLECULAR BIOLOGY, vol. 15, pp. 18 (ISSN 1748-7188)
    Link DOI Link al documento: 10278/3733359
  • Navarro G.; Ochoa C.; Prezza N. (2020), On the Approximation Ratio of Ordered Parsings in IEEE TRANSACTIONS ON INFORMATION THEORY, vol. early access, pp. 1-1 (ISSN 0018-9448)
    Link DOI Link al documento: 10278/3734793
  • Prezza, Nicola (2020), Optimal Substring Equality Queries with Applications to Sparse Text Indexing in ACM TRANSACTIONS ON ALGORITHMS, vol. 17, pp. 1-23 (ISSN 1549-6325)
    Link DOI Link al documento: 10278/3734791
  • Christiansen, Anders Roy; Ettienne, Mikko Berggren; Kociumaka, Tomasz; Navarro, Gonzalo; Prezza, Nicola (2020), Optimal-Time Dictionary-Compressed Indexes in ACM TRANSACTIONS ON ALGORITHMS, vol. 17, pp. 1-39 (ISSN 1549-6325)
    Link DOI Link al documento: 10278/3734790
  • Prezza, Nicola; Pisanti, Nadia; Sciortino, Marinella; Rosone, Giovanna (2020), Variable-order reference-free variant discovery with the Burrows-Wheeler Transform in BMC BIOINFORMATICS, vol. 21 (ISSN 1471-2105)
    Link DOI Link al documento: 10278/3729835
  • Fariña, Antonio; Martínez-Prieto, Miguel A.; Claude, Francisco; Navarro, Gonzalo; Lastra-Díaz, Juan J.; Prezza, Nicola; Seco, Diego (2019), On the reproducibility of experiments of indexing repetitive document collections in INFORMATION SYSTEMS, vol. 83, pp. 181-194 (ISSN 0306-4379)
    Link DOIURL correlato Link al documento: 10278/3729796
  • Nicola Prezza; Nadia Pisanti; Marinella Sciortino; Giovanna Rosone (2019), SNPs Detection by eBWT Positional Clustering in ALGORITHMS FOR MOLECULAR BIOLOGY, vol. 14, pp. 1-18 (ISSN 1748-7188)
    Link DOIURL correlato Link al documento: 10278/3729816
  • Navarro, Gonzalo; Prezza, Nicola (2019), Universal compressed text indexing in THEORETICAL COMPUTER SCIENCE, vol. 762, pp. 41-50 (ISSN 0304-3975)
    Link DOIURL correlato Link al documento: 10278/3729803
  • Bille, Philip; Gagie, Travis; Gørtz, Inge Li; Prezza, Nicola (2018), A separation between RLSLPs and LZ77 in JOURNAL OF DISCRETE ALGORITHMS, vol. 50, pp. 36-39 (ISSN 1570-8667)
    Link DOIURL correlato Link al documento: 10278/3729802
  • Policriti, Alberto; Prezza, Nicola (2018), LZ77 Computation Based on the Run-Length Encoded BWT in ALGORITHMICA, vol. 80, pp. 1986-2011 (ISSN 0178-4617)
    Link DOI Link al documento: 10278/3729799
  • PREZZA, Nicola; VEZZI, Francesco; Käller, Max; POLICRITI, Alberto (2016), Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2 in BMC BIOINFORMATICS, vol. 17 (Suppl. 4), pp. 235-245 (ISSN 1471-2105)
    Link DOIURL correlato Link al documento: 10278/3729804
  • Engström, Karin; Wojdacz, Tomasz K.; Marabita, Francesco; Ewels, Philip; Käller, Max; Vezzi, Francesco; PREZZA, Nicola; Gruselius, Joel; Vahter, Marie; Broberg, Karin (2016), Transcriptomics and methylomics of CD4-positive T cells in arsenic-exposed women in ARCHIVES OF TOXICOLOGY, vol. 91, pp. 2067-2078 (ISSN 0340-5761)
    Link DOIURL correlato Link al documento: 10278/3729801
  • POLICRITI, Alberto; PREZZA, Nicola (2015), Fast randomized approximate string matching with succinct hash data structures in BMC BIOINFORMATICS, vol. 16 (Suppl 9), pp. 1-8 (ISSN 1471-2105)
    Link DOI Link al documento: 10278/3729800
Articolo in Atti di convegno
  • Cotumaccio, Nicola; Prezza, Nicola (2021), On Indexing and Compressing Finite Automata , Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 2585-2599, Convegno: ACM-SIAM Symposium on Discrete Algorithms 2021 (SODA) (ISBN 978-1-61197-646-5)
    Link DOI Link al documento: 10278/3735063
  • Prezza, Nicola (2021), On Locating Paths in Compressed Tries , Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 744-760, Convegno: ACM-SIAM Symposium on Discrete Algorithms 2021 (SODA) (ISBN 978-1-61197-646-5)
    Link DOI Link al documento: 10278/3735062
  • Bille P.; Berggren Ettienne M.; Gagie T.; Li Gortz I.; Prezza N. (2020), Decompressing lempel-ziv compressed text , Data Compression Conference, DCC 2020, IEEE, pp. 143-152, Convegno: 2020 Data Compression Conference, DCC 2020, March 20-27, 2020 (ISBN 978-1-7281-6457-1)
    Link DOI Link al documento: 10278/3729813
  • Prezza, Nicola; Rosone, Giovanna (2020), Faster Online Computation of the Succinct Longest Previous Factor Array , Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings, Springer, vol. 12098, pp. 339-352, Convegno: Computability in Europe 2020, June 29th – July 3th, 2020 (ISBN 978-3-030-51465-5)
    Link DOI Link al documento: 10278/3729805
  • Alanko, Jarno; D'Agostino, Giovanna; Policriti, Alberto; Prezza, Nicola (2020), Regular Languages meet Prefix Sorting , SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, pp. 911-930, Convegno: Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-8, 2020 (ISBN 978-1-61197-599-4)
    Link DOI Link al documento: 10278/3729808
  • Kociumaka, Tomasz; Navarro, Gonzalo; Prezza, Nicola (2020), Towards a Definitive Measure of Repetitiveness , Proceedings of Latin American Symposium on Theoretical Informatics 2021, Springer, vol. 12118, pp. 207-219, Convegno: Latin American Symposium on Theoretical Informatics (LATIN) 2021 (ISBN 978-3-030-61791-2; 978-3-030-61792-9) (ISSN 0302-9743)
    Link DOI Link al documento: 10278/3734912
  • Della Giustina D.; Prezza N.; Venturini R. (2019), A New Linear-Time Algorithm for Centroid Decomposition , String Processing and Information Retrieval: 26th International Symposium, SPIRE 2019, Proceedings, Springer, pp. 274-282, Convegno: 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019, October 7–9, 2019 (ISBN 978-3-030-32685-2)
    Link DOIURL correlato Link al documento: 10278/3729821
  • M. Alzamel; A. Conte; D. Greco; GUERRINI, VERONICA; C. Iliopoulos; N. Pisanti; N. Prezza; PUNZI, GIULIA; G. Rosone (2019), Online Algorithms on Antipowers and Antiperiods , String Processing and Information Retrieval: 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings, Springer, pp. 175-188, Convegno: 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), October 7-9, 2019 (ISBN 978-3030326852)
    Link DOI Link al documento: 10278/3729828
  • Prezza N. (2019), Optimal rank and select queries on dictionary-compressed text , 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), LIPIcs, pp. 1-12, Convegno: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, 18-20 giugno 2019 (ISBN 978-3-95977-103-0)
    Link DOI Link al documento: 10278/3729807
  • Prezza N.; Rosone G. (2019), Space-efficient computation of the LCP array from the Burrows-Wheeler transform , 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Leibniz International Proceedings in Informatics, LIPIcs, LIPIcs, vol. 128, pp. 1-18, Convegno: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019 (ISBN 978-3-95977-103-0)
    Link DOIURL correlato Link al documento: 10278/3729822
  • Kempa D.; Prezza N. (2018), At the roots of dictionary compression: String attractors , STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, USA, ACM (Association for Computing Machinery), pp. 827-840, Convegno: 50th Annual ACM Symposium on Theory of Computing, STOC 2018, June 25-29, 2018 (ISBN 9781450355599)
    Link DOI Link al documento: 10278/3729809
  • Nicola Prezza; Nadia Pisanti; Marinella Sciortino; Giovanna Rosone (2018), Detecting Mutations by eBWT , Proceedings of 18th Conference on Algorithms in Bioinformatics (WABI), 2018, Leibniz International Proceedings in Informatics, LIPIcs, pp. 1-15, Convegno: 18th Conference on Algorithms in Bioinformatics (WABI 2018), August 20-24, 2018 (ISBN 978-3-95977-082-8)
    Link DOIURL correlato Link al documento: 10278/3729815
  • Prezza N. (2018), In-place sparse suffix sorting , Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, pp. 1496-1508, Convegno: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, January 7-10, 2018 (ISBN 978-1-61197-503-1)
    Link DOI Link al documento: 10278/3729812
  • Gagie T.; Navarro G.; Prezza N. (2018), On the approximation ratio of Lempel-Ziv parsing , 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, Springer, pp. 490-503, Convegno: 13th International Symposium on Latin American Theoretical Informatics, LATIN 2018, April 16-19, 2018 (ISBN 978-3-319-77403-9)
    Link DOI Link al documento: 10278/3729833
  • Gagie, T; Navarro, G; Prezza, N (2018), Optimal-Time Text Indexing in BWT-runs Bounded Space , SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, pp. 1459-1477, Convegno: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, January, 2018
    Link DOI Link al documento: 10278/3729823
  • Kempa D.; Policriti A.; Prezza N.; Rotenberg E. (2018), String attractors: Verification and optimization , 26th European Symposium on Algorithms, ESA 2018. Leibniz International Proceedings in Informatics, LIPIcs, Leibniz International Proceedings in Informatics, LIPIcs, vol. 112, pp. 1-13, Convegno: 26th European Symposium on Algorithms, ESA 2018, August 20-22, 2018 (ISBN 978-3-95977-081-1)
    Link DOI Link al documento: 10278/3729806
  • Prezza N. (2017), A framework of dynamic data structures for string processing , 16th Symposium on Experimental Algorithms, SEA 2017, Leibniz International Proceedings in Informatics, LIPIcs, LIPIcs, vol. 75, pp. 1-15, Convegno: 16th Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017
    Link DOI Link al documento: 10278/3729827
  • Belazzougui D.; Cunial F.; Gagie T.; Prezza N.; Raffinot M. (2017), Flexible indexing of repetitive collections , Unveiling Dynamics and Complexity: 13th Conference on Computability in Europe, CiE 2017, Proceedings, Springer, pp. 162-174, Convegno: 13th Conference on Computability in Europe, CiE 2017, June 12-16, 2017 (ISBN 978-3-319-58740-0)
    Link DOI Link al documento: 10278/3729811
  • Policriti, Alberto; Prezza, Nicola (2017), From LZ77 to the run-length encoded burrows-wheeler transform, and back , 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Leibniz International Proceedings in Informatics, LIPIcs, LIPIcs, vol. 78, pp. 1-10, Convegno: 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017 (ISBN 9783959770392)
    Link DOIURL correlato Link al documento: 10278/3729820
  • Bille P.; Gortz I. L.; Prezza N. (2017), Space-Efficient Re-Pair Compression , Data Compression Conference Proceedings, IEEE, vol. 127767, pp. 171-180, Convegno: 2017 Data Compression Conference, DCC 2017, April 4-7, 2017 (ISBN 978-1-5090-6721-3)
    Link DOI Link al documento: 10278/3729829
  • Bille P.; Christiansen A. R.; Prezza N.; Skjoldjensen F. R. (2017), Succinct partial sums and fenwick trees , String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Proceedings, Springer, pp. 91-96, Convegno: 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, 26-29 settembre 2017 (ISBN 978-3-319-67427-8)
    Link DOI Link al documento: 10278/3729819
  • POLICRITI, Alberto; PREZZA, Nicola (2016), Computing LZ77 in Run-Compressed Space , Data Compression Conference Proceedings, IEEE, pp. 23-32, Convegno: Data Compression Conference 2016, March 29 - April 1, 2016 (ISBN 978-1-5090-1853-6)
    Link DOI Link al documento: 10278/3729810
  • POLICRITI, Alberto; GIGANTE, Nicola; PREZZA, Nicola (2015), Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform , Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, Springer, pp. 587-598, Convegno: 9th International Conference, LATA 2015, March 2-6, 2015 (ISBN 978-3-319-15578-4)
    Link DOIURL correlato Link al documento: 10278/3729817
  • Belazzougui, Djamal; Cunial, Fabio; Gagie, Travis; PREZZA, NICOLA; Raffinot, Mathieu (2015), Composite repetition-aware data structures , 26th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Springer, vol. 9133, pp. 26-39, Convegno: Combinatorial Pattern Matching, June 29 - July 1, 2015 (ISBN 3319199293)
    Link DOI Link al documento: 10278/3729825
  • POLICRITI, Alberto; PREZZA, Nicola (2015), Fast online Lempel-Ziv factorization in compressed space , String Processing and Information Retrieval 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, Springer, pp. 13-20, Convegno: 22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015, September 1-4, 2015 (ISBN 9783319238258)
    Link DOIURL correlato Link al documento: 10278/3729832
  • POLICRITI, Alberto; PREZZA, Nicola (2014), Hashing and Indexing: Succinct DataStructures and Smoothed Analysis , Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, Springer, pp. 157-168, Convegno: 25th International Symposium, ISAAC 2014, December 15-17, 2014 (ISBN 9783319130743)
    Link DOIURL correlato Link al documento: 10278/3729830
  • PREZZA, Nicola; DEL FABBRO, Cristian; Francesco Vezzi; DE PAOLI, Emanuele; POLICRITI, Alberto (2012), ERNE-BS5: Aligning BS-treated sequences by multiple hits on a 5-letters alphabet , Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '12, ACM (Association for Computing Machinery), pp. 12-19, Convegno: ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '12, October 7-10, 2012 (ISBN 9781450316705)
    Link DOI Link al documento: 10278/3729831
Abstract in Atti di convegno
  • Nicola Prezza (2020), Indexing Compressed Text: A Tale of Time and Space (Invited Talk) , 18th Symposium on Experimental Algorithms (SEA 2020), LIPIcs, Convegno: 18th Symposium on Experimental Algorithms (SEA 2020), June 16-18, 2020
    Link DOI Link al documento: 10278/3729834