• Publications
  • Influence
The grapevine genome sequence suggests ancestral hexaploidization in major angiosperm phyla
A high-quality draft of the genome sequence of grapevine is obtained from a highly homozygous genotype, revealing the contribution of three ancestral genomes to the grapevine haploid content and explaining the chronology of previously described whole-genome duplication events in the evolution of flowering plants. Expand
The high-quality draft genome of peach (Prunus persica) identifies unique patterns of genetic diversity, domestication and genome evolution
Comparisons showed that peach has not undergone recent whole-genome duplication, and even though the ancestral triplicated blocks in peach are fragmentary compared to those in grape, all seven paleosets of paralogs from the putative paleoancestor are detectable. Expand
GapFiller: a de novo assembly approach to fill the gap within paired reads
GapFiller, starting from a sufficiently high short reads coverage, is able to produce high coverages of accurate longer sequences (from 300 bp up to 3500 bp) and turned out to be a powerful criterion to guarantee contigs' correctness. Expand
The SSR-based molecular profile of 1005 grapevine (Vitis vinifera L.) accessions uncovers new synonymy and parentages, and reveals a large admixture amongst varieties of different geographic origin
A collection of 1005 grapevine accessions was genotyped at 34 microsatellite loci with the aim of analysing genetic diversity and exploring parentages, revealing a large admixture of local varieties with those most widely cultivated, as a result of ancient commerce and population flow. Expand
From Bisimulation to Simulation: Coarsest Partition Problems
This paper revisits the state of the art about bisimulation and simulation, pointing out the analogies and differences between the two problems, and proposes a generalization of the relational coarsest partition problem, which is equivalent to the simulation problem. Expand
GAM-NGS: genomic assemblies merger for next generation sequencing
GAM-NGS (Genomic Assemblies Merger for Next Generation Sequencing) is a tool able to merge two or more assemblies in order to improve contiguity and correctness and avoids global alignment between contigs, making its strategy unique among other assembly reconciliation tools. Expand
An efficient algorithm for computing bisimulation equivalence
We propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure working both on the explicit and on the implicit (symbolic) representation. AsExpand
A Fast Bisimulation Algorithm
An algorithm is proposed that optimizes the solution to the Relational coarsest Partition problem given by Paige and Tarjan in 1987 and its use in model-checking packages is briefly discussed and tested. Expand
Computing strongly connected components in a linear number of symbolic steps
An algorithm that computes in a linear number of symbolic steps the strongly connected components of a graph represented by an Ordered Binary Decision Diagram (OBDD) matches the complexity of Tarjan's algorithm operating on explicit data structures. Expand
Modeling Biological Systems in Stochastic Concurrent Constraint Programming
It is shown that sCCP proves to be a general and extensible framework, allowing to describe a wide class of dynamical behaviours and kinetic laws. Expand