Giulia Bernardini

Full Name

G. Bernardini

Giulia.Bernardini@cwi.nl

Phone

+31 20 592 4073

Room

M246

Department(s)

Networks and Optimization

Function(s)

Researcher

Homepage

https://sites.google.com/view/giulia-bernardini

Biography

Giulia Bernardini completed her M.Sc in Mathematics at the University of Pisa in 2017. She later joined the University of Milano-Bicocca as a Ph.D student, obtaining her Ph.D in February 2021. In January 2021 she joined the Life Sciences and Health research group at CWI as a Postdoctoral fellow, funded by the project "Optimization for and with Machine Learning" (OPTIMAL).

Bernardini, G, Gabory, E.A.D, Pissis, S, Stougie, L, Sweering, M.J.M, & Zuba, W.P. (2022). Elastic-degenerate string matching with 1 error. In LATIN: Latin American Symposium on Theoretical Informatics (pp. 20–37). doi:10.1007/978-3-031-20624-5_2
Bernardini, G, van Iersel, L.J.J, Julien, E, & Stougie, L. (2022). Reconstructing phylogenetic networks via cherry picking and machine learning. In Workshop on Algorithms in Bioinformatics (WABI) (pp. 16:1–16:22). doi:10.4230/LIPIcs.WABI.2022.16
Bernardini, G, Denti, L, & Previtali, M. (2022). Alignment-free genotyping of known variations with MALVA. In Variant Calling. doi:10.1007/978-1-0716-2293-3_15
Bernardini, G, Chen, H, Loukides, G, Pissis, S, Stougie, L, & Sweering, M.J.M. (2022). Making de Bruijn graphs Eulerian. In Annual Symposium on Combinatorial Pattern Matching (pp. 12:1–12:18). doi:10.4230/LIPIcs.CPM.2022.12
Bernardini, G, Conte, A, Gabory, E.A.D, Grossi, R, Loukides, G, Pissis, S, … Sweering, M.J.M. (2022). On Strings Having the Same Length-k Substrings. In 33rd Annual Symposium on Combinatorial Pattern Matching (pp. 16:1–16:17). doi:10.4230/LIPIcs.CPM.2022.16
Bernardini, G, Gawrychowski, P, Pisanti, N, Pissis, S, & Rosone, G. (2022). Elastic-degenerate string matching via fast matrix multiplication. SIAM Journal on Computing, 51(3), 549–576. doi:10.1137/20M1368033
Bernardini, G, Conte, A, Gourdel, G., Grossi, R, Loukides, G, Pisanti, N, … Sweering, M.J.M. (2022). Hide and mine in strings: Hardness, algorithms, and experiments. IEEE Transactions on Knowledge and Data Engineering. doi:10.1109/TKDE.2022.3158063
Bernardini, G, Chen, H, Fici, G, Loukides, G, & Pissis, S. (2021). Reverse-safe data structures for text indexing. In Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 199–213). doi:10.1145/3461698
Bernardini, G, Bonizzoni, P, & Gawrychowski, P. (2021). Incomplete Directed Perfect Phylogeny in linear time. In Workshop on Algorithms and Data Structures (pp. 172–185). doi:10.1007/978-3-030-83508-8_13
Bernardini, G, Marchetti Spaccamela, A, Pissis, S, Stougie, L, & Sweering, M.J.M. (2021). Constructing strings avoiding forbidden substrings. In Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching CPM 2021 (pp. 9.1–9.18). doi:10.4230/LIPIcs.CPM.2021.9

Best Italian PhD Thesis in Theoretical Computer Science ex aequo (EATCS) (2021)

Optimization for and with Machine Learning (OPTIMAL2)

Giulia Bernardini

Biography

Publications

Awards

Current projects with external funding

Giulia Bernardini

Biography

Publications

Awards

Current projects with external funding

Cookies