Giulia Bernardini

 

I am a Ph.D. student in Computer Science (Algorithms & Bioinformatics) at University of Milano Bicocca (DISCo), starting in November 2017.

Research interests:

  • Algorithms and data structures on sequences and graphs
  • Computational complexity
  • Applications in genomic data analysis and data mining

Publications:

lipics

G.Bernardini, P.Bonizzoni, P.Gawrychowski:
On Two Measures of Distance Between Fully-Labelled Trees
31th Annual Symposium on Combinatorial Pattern Matching (CPM), 2020 (Extended version)

lipics

G.Bernardini, H.Chen, A.Conte, R.Grossi, G.Loukides, N.Pisanti, S.P.Pissis, G.Rosone, M.Sweering: String Sanitization Under Edit Distance
31th Annual Symposium on Combinatorial Pattern Matching (CPM), 2020 (Extended version)

Theoretical Computer Science

L.Ayad, G.Bernardini, R.Grossi, C.S.Iliopoulos, N.Pisanti, S.P.Pissis, G.Rosone:
Longest property-preserved common factor: A new string-processing framework
Theoretical Computer Science, 2020.

ALENEXcover

G.Bernardini, H.Chen, G.Fici, G.Loukides, S.P.Pissis:
Reverse-Safe Data Structures for Text Indexing
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX).

ECML-PKDD

G.Bernardini, H.Chen, A.Conte, R.Grossi, G.Loukides, N.Pisanti, S.P.Pissis, G.Rosone:
String Sanitization: A Combinatorial Approach
Machine Learning and Knowledge Discovery in Databases (ECML/PKDD), 2019 (Preprint)

Theoretical Computer Science

G.Bernardini, N.Pisanti, S.P.Pissis, G.Rosone:
Approximate Pattern Matching on Elastic-Degenerate Text
Theoretical Computer Science, 2019.

iScience

G.Bernardini, P.Bonizzoni, L.Denti, M.Previtali, A.Schönhuth:
MALVA: genotyping by Mapping-free ALlele detection of known VAriants
iScience, Special Issue: RECOMB-SEQ, 2019

lipics

G.Bernardini, P.Gawrychowski, N.Pisanti, S.P.Pissis, G.Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
proceedings of 46th International Colloquium on Automata, Languages and Programming (ICALP), 2019. (Extended version)

lipics

G.Bernardini, P.Bonizzoni, G. Della Vedova, M.Patterson:
A Rearrangement Distance for Fully-Labelled Trees
30th Annual Symposium on Combinatorial Pattern Matching (CPM), 2019

spire05

L.Ayad, G.Bernardini, R.Grossi, C.S.Iliopoulos, N.Pisanti, S.P.Pissis, G.Rosone:
Longest Property-Preserved Common Factor
proceedings of 25th International Symposium on String Processing and Information Retrieval (SPIRE), 2018. (Preprint)

lipics

M.Alzamel, L.Ayad, G.Bernardini, R.Grossi, C.S.Iliopoulos, N.Pisanti, S.P.Pissis, G.Rosone: Degenerate String Comparison and Applications
proceedings of 18th Conference on Algorithms in Bioinformatics (WABI), 2018.

spire05

G.Bernardini, N.Pisanti, S.P.Pissis, G.Rosone:
Pattern matching on Elastic-Degenerate Text with Errors
proceedings of 24th International Symposium on String Processing and Information Retrieval (SPIRE), 2017. (Preprint)

Talks:

  • On Two Measures of Distance for Fully-Labelled Trees
    31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)(Slides)
    June 17-19, 2020 – Zoom
  • Reverse-Safe Data Structures for Text indexing
    SIAM Symposium on Algorithms Engineering and Experiments (ALENEX20)(Slides)
    January 5-6, 2020 – Salt Lake City, Utah, U.S.
  • Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication
    46th International Colloquium on Automata, Languages and Programming (ICALP 2019)(Slides)
    July 8-12, 2019 – Patras, Greece
  • A Rearrangement Distance for Fully-Labelled Trees
    30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
    June 18-20, 2019 – Pisa, Italy
  • Pattern matching on Elastic-Degenerate Text with Error
    24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)
    26th-29th September, 2017 – Palermo, Italy
  • Pattern matching on Elastic-Degenerate Text with Error
    Mathematical Foundations in Bioinformatics (MatBio 2017)
    14th September, 2017 – London, UK

Preprints:

S.Ciccolella, G.Bernardini, L.Denti, P.Bonizzoni, M.Previtali, G.Della Vedova:
Triplet-based similarity score for fully multi-labeled trees with poly-occurring labels
Accepted to RECOMB-CCB 2020

Education:

  • 2014-2017: M.Sc. in Mathematics,  University of Pisa. Master’s Thesis: Approximate Pattern Matching on Elastic-Degenerate Texts. Supervisor: Prof. Nadia Pisanti, University of Pisa. Co-supervisor: Dr. Solon Pissis, King’s College London.
  • 2009-2013: B.Sc. in Mathematics, University of Milan

Contacts:

Email: giulia [dot] bernardini@unimib [dot] it , g [dot] bernardini3 [atsymbol] campus [dot] unimib [dot] it

Address: Stanza 1001, c/o Edificio U14, Dip. di Informatica Sistemistica e Comunicazione, Viale Sarca, 336, I-20126 Milano (Italy)

Phone Number: +39 02 6448 7917