Giulia Bernardini

Giulia Bernardini

Auto-generated profile, based on publicly available information

Giulia Bernardini

University of Trieste, trieste, Italy

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2019 in iScience
Verified
Journal Article
Open access
LDLuca Denti
Luca Denti
MPMarco Previtali
Marco Previtali
GBGiulia Bernardini
Giulia Bernardini
ASAlexander Schönhuth
Alexander Schönhuth
PBPaola Bonizzoni
Paola Bonizzoni
The amount of genetic variation discovered in human populations is growing rapidly leading to challenging computational tasks, such as variant calling. Standard methods for addressing this problem include read mapping, a computationally expensive procedure; thus, mapping-free tools have been proposed in recent years. These tools focus on isolated, biallelic SNPs, providing limited support for multi-allelic SNPs and short insertions and deletions of nucleotides (indels). Here we introduce MALVA, a mapping-free method to genotype an individual from a sample of reads. MALVA is the first mapping-free tool able to genotype multi-allelic SNPs and indels, even in high-density genomic regions, and to effectively handle a huge number of variants. MALVA requires one order of magnitude less time to genotype a donor than alignment-based pipelines, providing similar accuracy. Remarkably, on indels, MALVA provides even better results than the most widely adopted variant discovery tools.

30 July 2020 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SCSimone Ciccolella
Simone Ciccolella
GBGiulia Bernardini
Giulia Bernardini
LDLuca Denti
Luca Denti
PBPaola Bonizzoni
Paola Bonizzoni
MPMarco Previtali
Marco Previtali
GVGianluca Della Vedova
Gianluca Della Vedova
The latest advances in cancer sequencing, and the availability of a wide range of methods to infer the evolutionary history of tumors, have made it important to evaluate, reconcile and cluster different tumor phylogenies. Recently, several notions of distance or similarities have been proposed in the literature, but none of them has emerged as the golden standard. Moreover, none of the known similarity measures is able to manage mutations occurring multiple times in the tree, a circumstance often occurring in real cases. To overcome these limitations, in this article, we propose MP3, the first similarity measure for tumor phylogenies able to effectively manage cases where multiple mutations can occur at the same time and mutations can occur multiple times. Moreover, a comparison of MP3 with other measures shows that it is able to classify correctly similar and dissimilar trees, both on simulated and on real data. An open source implementation of MP3 is publicly available at https://github.com/AlgoLab/mp3treesim. Supplementary data are available at Bioinformatics online.

1 April 2020 in Theoretical Computer Science
Verified
Journal Article
Closed access
GBGiulia Bernardini
Giulia Bernardini
NPNadia Pisanti
Nadia Pisanti
SPSolon Pissis
Solon Pissis
GRGiovanna Rosone
Giovanna Rosone

17 July 2024 in Molecular Phylogenetics and Evolution
Verified
Journal Article
Open access
GBGiulia Bernardini
Giulia Bernardini
LILeo van Iersel
Leo van Iersel
EJEsther Julien
Esther Julien
LSLeen Stougie
Leen Stougie
The Hybridization problem asks to reconcile a set of conflicting phylogenetic trees into a single phylogenetic network with the smallest possible number of reticulation nodes. This problem is computationally hard and previous solutions are limited to small and/or severely restricted data sets, for example, a set of binary trees with the same taxon set or only two non-binary trees with non-equal taxon sets. Building on our previous work on binary trees, we present FHyNCH, the first algorithmic framework to heuristically solve the Hybridization problem for large sets of multifurcating trees whose sets of taxa may differ. Our heuristics combine the cherry-picking technique, recently proposed to solve the same problem for binary trees, with two carefully designed machine-learning models. We demonstrate that our methods are practical and produce qualitatively good solutions through experiments on both synthetic and real data sets.

19 May 2022 in SIAM Journal on Computing
Verified
Journal Article
Closed access
GBGiulia Bernardini
Giulia Bernardini
PGPaweł Gawrychowski
Paweł Gawrychowski
NPNadia Pisanti
Nadia Pisanti
SPSolon P. Pissis
Solon P. Pissis
GRGiovanna Rosone
Giovanna Rosone
An elastic-degenerate (ED) string is a sequence of $n$ sets of strings of total length $N$ which was recently proposed to model a set of similar sequences. The ED string matching (EDSM) problem is ...

6 September 2017
Verified
Book Chapter
Closed access
PDF file
GBGiulia Bernardini
Giulia Bernardini
NPNadia Pisanti
Nadia Pisanti
SPSolon Pissis
Solon Pissis
GRGiovanna Rosone
Giovanna Rosone