Giuseppe Romana
Scholar

Giuseppe Romana

Google Scholar ID: XFd2_3MAAAAJ
PhD in Mathematics and Computational Sciences, Università degli Studi di Palermo
Combinatorics on WordsData CompressionFormal Languages
Citations & Impact
All-time
Citations
144
 
H-index
7
 
i10-index
6
 
Publications
20
 
Co-authors
0
 
Resume (English only)
Academic Achievements
  • Journal Publications:
  • - J. Comb. Theory - Series A 208 (2024): New string attractor-based complexities for infinite words
  • - Theor. Comput. Sci. 850: 236-248 (2021): A combinatorial view on string attractors
  • Conference Publications:
  • - ICTCS 2023: 169-180: Algorithmic View on Circular String Attractors
  • - ICTCS 2023: 129-142: On the Number of Equal-Letter Runs of the Bijective Burrows-Wheeler Transform
  • - CPM 2023: 10:1-10:18: On the Impact of Morphisms on BWT-Runs
  • - DLT 2023 86-99: Bit catastrophes for the Burrows-Wheeler Transform
  • - WORDS 2023 192-205: String Attractors of Fixed Points of k-Bonacci-Like Morphisms
  • - LATIN 2022: 426-442: String Attractors and Infinite Words
  • - SEA 2022: 22:1-16: Computing Maximal Unique Matches with the r-index
  • - DLT 2022: 1-13: Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words
  • - ICTCS 2019: 57-71: String Attractors and Combinatorics on Words
Research Experience
  • Member of the organizing committee for the Italian Conference of Theoretical Computer Science 2023 (ICTCS 2023); developed an algorithm to compute maximal unique matches for highly repetitive texts in compact space as part of a project assigned for the course in Compact Data Structures for Computational Pangenomics by Prof. Travis Gagie.
Education
  • Postdoctoral researcher at the University of Palermo, Department of Mathematics and Computer Science, supervised by Prof. Marinella Sciortino.
Background
  • Research Interests: Combinatorics on Words, Data Compression, Algorithms on Strings, Formal Languages, Data Structures and Algorithms for Biological Sequences and Pangenomic datasets. His work has been focused on the study of compressor-based measures of repetitiveness.
Co-authors
0 total
Co-authors: 0 (list not available)