Celine Scornavacca

Celine Scornavacca

Auto-generated profile, based on publicly available information

Celine Scornavacca

Institut des Sciences de l’Évolution Montpellier, Université Montpellier, Montpellier, France

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
26 February 2016 in Bioinformatics
Verified
Journal Article
Open access
PDF file
EJEdwin Jacox
Edwin Jacox
CCCedric Chauve
Cedric Chauve
GSGergely J. Szöllősi
Gergely J. Szöllősi
YPYann Ponty
Yann Ponty
CSCeline Scornavacca
Celine Scornavacca
Summary: A gene tree-species tree reconciliation explains the evolution of a gene tree within the species tree given a model of gene-family evolution. We describe ecceTERA, a program that implements a generic parsimony reconciliation algorithm, which accounts for gene duplication, loss and transfer (DTL) as well as speciation, involving sampled and unsampled lineages, within undated, fully dated or partially dated species trees. The ecceTERA reconciliation model and algorithm generalize or improve upon most published DTL parsimony algorithms for binary species trees and binary gene trees. Moreover, ecceTERA can estimate accurate species-tree aware gene trees using amalgamation. Availability and implementation: ecceTERA is freely available under http://mbb.univ-montp2.fr/MBB/download_sources/16__ecceTERA and can be run online at http://mbb.univ-montp2.fr/MBB/subsection/softExec.php?soft=eccetera. Contact:celine.scornavacca@umontpellier.fr Supplementary information: Supplementary data are available at Bioinformatics online.

29 January 2019 in Molecular Biology and Evolution
Verified
Journal Article
Open access
PDF file
CSCeline Scornavacca
Celine Scornavacca
KBKhalid Belkhir
Khalid Belkhir
JLJimmy Lopez
Jimmy Lopez
RDRémy Dernat
Rémy Dernat
FDFrédéric Delsuc
Frédéric Delsuc
Vincent RanwezVincent Ranwez
Vincent Ranwez
We present version 10 of OrthoMaM, a database of orthologous mammalian markers. OrthoMaM is already 11 years old and since the outset it has kept on improving, providing alignments and phylogenetic trees of high-quality computed with state-of-the-art methods on up-to-date data. The main contribution of this version is the increase in the number of taxa: 116 mammalian genomes for 14,509 one-to-one orthologous genes. This has been made possible by the combination of genomic data deposited in Ensembl complemented by additional good-quality genomes only available in NCBI. Version 10 users will benefit from pipeline improvements and a completely redesigned web-interface.

9 April 2014 in Molecular Biology and Evolution
Verified
Journal Article
Open access
PDF file
EDEmmanuel J. P. Douzery
Emmanuel J. P. Douzery
CSCeline Scornavacca
Celine Scornavacca
JRJonathan Romiguier
Jonathan Romiguier
KBKhalid Belkhir
Khalid Belkhir
NGNicolas Galtier
Nicolas Galtier
Vincent RanwezVincent Ranwez
Vincent Ranwez
Comparative genomic studies extensively rely on alignments of orthologous sequences. Yet, selecting, gathering, and aligning orthologous exons and protein-coding sequences (CDS) that are relevant for a given evolutionary analysis can be a difficult and time-consuming task. In this context, we developed OrthoMaM, a database of ORTHOlogous MAmmalian Markers describing the evolutionary dynamics of orthologous genes in mammalian genomes using a phylogenetic framework. Since its first release in 2007, OrthoMaM has regularly evolved, not only to include newly available genomes but also to incorporate up-to-date software in its analytic pipeline. This eighth release integrates the 40 complete mammalian genomes available in Ensembl v73 and provides alignments, phylogenies, evolutionary descriptor information, and functional annotations for 13,404 single-copy orthologous CDS and 6,953 long exons. The graphical interface allows to easily explore OrthoMaM to identify markers with specific characteristics (e.g., taxa availability, alignment size, %G+C, evolutionary rate, chromosome location). It hence provides an efficient solution to sample preprocessed markers adapted to user-specific needs. OrthoMaM has proven to be a valuable resource for researchers interested in mammalian phylogenomics, evolutionary genomics, and has served as a source of benchmark empirical data sets in several methodological studies. OrthoMaM is available for browsing, query and complete or filtered downloads at http://www.orthomam.univ-montp2.fr/.

7 January 2016 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MBManuel Binet
Manuel Binet
OGOlivier Gascuel
Olivier Gascuel
CSCeline Scornavacca
Celine Scornavacca
EDEmmanuel J. P. Douzery
Emmanuel J. P. Douzery
FPFabio Pardi
Fabio Pardi
Background: Branch lengths are an important attribute of phylogenetic trees, providing essential information for many studies in evolutionary biology. Yet, part of the current methodology to reconstruct a phylogeny from genomic information — namely supertree methods — focuses on the topology or structure of the phylogenetic tree, rather than the evolutionary divergences associated to it. Moreover, accurate methods to estimate branch lengths — typically based on probabilistic analysis of a concatenated alignment — are limited by large demands in memory and computing time, and may become impractical when the data sets are too large. Results: Here, we present a novel phylogenomic distance-based method, named ERaBLE (Evolutionary Rates and Branch Length Estimation), to estimate the branch lengths of a given reference topology, and the relative evolutionary rates of the genes employed in the analysis. ERaBLE uses as input data a potentially very large collection of distance matrices, where each matrix is obtained from a different genomic region — either directly from its sequence alignment, or indirectly from a gene tree inferred from the alignment. Our experiments show that ERaBLE is very fast and fairly accurate when compared to other possible approaches for the same tasks. Specifically, it efficiently and accurately deals with large data sets, such as the OrthoMaM v8 database, composed of 6,953 exons from up to 40 mammals. Conclusions: ERaBLE may be used as a complement to supertree methods — or it may provide an efficient alternative to maximum likelihood analysis of concatenated alignments — to estimate branch lengths from phylogenomic data sets.

14 June 2018 in Bulletin of Mathematical Biology
Verified
Journal Article
Open access
PDF file
RJRemie Janssen
Remie Janssen
MJMark Jones
Mark Jones
PEPeter Erdos
Peter Erdos
LILeo van Iersel
Leo van Iersel
CSCeline Scornavacca
Celine Scornavacca
Popular methods for exploring the space of rooted phylogenetic trees use rearrangement moves such as rooted Nearest Neighbour Interchange (rNNI) and rooted Subtree Prune and Regraft (rSPR). Recently, these moves were generalized to rooted phylogenetic networks, which are a more suitable representation of reticulate evolutionary histories, and it was shown that any two rooted phylogenetic networks of the same complexity are connected by a sequence of either rSPR or rNNI moves. Here, we show that this is possible using only tail moves, which are a restricted version of rSPR moves on networks that are more closely related to rSPR moves on trees. The connectedness still holds even when we restrict to distance-1 tail moves (a localized version of tail moves). Moreover, we give bounds on the number of (distance-1) tail moves necessary to turn one network into another, which in turn yield new bounds for rSPR, rNNI and SPR (i.e. the equivalent of rSPR on unrooted networks). The upper bounds are constructive, meaning that we can actually find a sequence with at most this length for any pair of networks. Finally, we show that finding a shortest sequence of tail or rSPR moves is NP-hard.

17 June 2022 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SLSarah Lutteropp
Sarah Lutteropp
CSCéline Scornavacca
Céline Scornavacca
AKAlexey Kozlov
Alexey Kozlov
BMBenoit Morel
Benoit Morel
ASAlexandros Stamatakis
Alexandros Stamatakis
Phylogenetic networks can represent non-treelike evolutionary scenarios. Current, actively developed approaches for phylogenetic network inference jointly account for non-treelike evolution and incomplete lineage sorting (ILS). Unfortunately, this induces a very high computational complexity and current tools can only analyze small datasets. We present NetRAX, a tool for maximum likelihood (ML) inference of phylogenetic networks in the absence of ILS. Our tool leverages state-of-the-art methods for efficiently computing the phylogenetic likelihood function on trees, and extends them to phylogenetic networks via the notion of ‘displayed trees’. NetRAX can infer ML phylogenetic networks from partitioned multiple sequence alignments and returns the inferred networks in Extended Newick format. On simulated data, our results show a very low relative difference in Bayesian Information Criterion (BIC) score and a near-zero unrooted softwired cluster distance to the true, simulated networks. With NetRAX, a network inference on a partitioned alignment with 8000 sites, 30 taxa and 3 reticulations completes within a few minutes on a standard laptop. Our implementation is available under the GNU General Public License v3.0 at https://github.com/lutteropp/NetRAX. Supplementary data are available at Bioinformatics online.