Céline Scornavacca

According to our database1, Céline Scornavacca authored at least 60 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Classifying the Post-duplication Fate of Paralogous Genes.
Proceedings of the Comparative Genomics - 20th International Conference, 2023

2022
NetRAX: accurate and fast maximum likelihood phylogenetic network inference.
Bioinform., 2022

Treewidth-based algorithms for the small parsimony problem on networks.
Algorithms Mol. Biol., 2022

2021
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo.
PLoS Comput. Biol., 2021

2020
Generation of Level-<i>k</i>k LGT Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Computing the probability of gene trees concordant with the species tree in the multispecies coalescent.
CoRR, 2020

Treerecs: an integrated phylogenetic tool, from sequences to reconciliations.
Bioinform., 2020

Scanning Phylogenetic Networks Is NP-hard.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
On the Weighted Quartet Consensus problem.
Theor. Comput. Sci., 2019

Correction: Generation of Binary Tree-Child phylogenetic networks.
PLoS Comput. Biol., 2019

Generation of Binary Tree-Child phylogenetic networks.
PLoS Comput. Biol., 2019

Cutting an alignment with Ockham's razor.
CoRR, 2019

Generation of Tree-Child phylogenetic networks.
CoRR, 2019

Reconciling multiple genes trees via segmental duplications and losses.
Algorithms Mol. Biol., 2019

An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees.
Algorithmica, 2019

2018
ANISEED 2017: extending the integrated ascidian database to the exploration and evolutionary comparison of genome-scale datasets.
Nucleic Acids Res., 2018

RecPhyloXML: a format for reconciled gene trees.
Bioinform., 2018

2017
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Rearrangement moves on rooted phylogenetic networks.
PLoS Comput. Biol., 2017

Exploring the tiers of rooted phylogenetic network space using tail moves.
CoRR, 2017

Finding the most parsimonious or likely tree in a network with respect to an alignment.
CoRR, 2017

Consistency of orthology and paralogy constraints in the presence of gene transfers.
CoRR, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance.
CoRR, 2017

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.
Bioinform., 2017

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets.
Algorithmica, 2017

Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract).
Proceedings of the String Processing and Information Retrieval, 2017

2016
ANISEED 2015: a digital framework for the comparative developmental biology of ascidians.
Nucleic Acids Res., 2016

Phylogenetic incongruence through the lens of Monadic Second Order logic.
J. Graph Algorithms Appl., 2016

Kernelizations for the hybridization number problem on multiple nonbinary trees.
J. Comput. Syst. Sci., 2016

Do branch lengths help to locate a tree in a phylogenetic network?
CoRR, 2016

On the consistency of orthology relationships.
BMC Bioinform., 2016

Fast and accurate branch lengths estimation for phylogenomic trees.
BMC Bioinform., 2016

ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony.
Bioinform., 2016

SylvX: a viewer for phylogenetic tree reconciliations.
Bioinform., 2016

Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
On Computing the Maximum Parsimony Score of a Phylogenetic Network.
SIAM J. Discret. Math., 2015

Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable.
PLoS Comput. Biol., 2015

Phylogenetic incongruence through the lens of Monadic Second Order logic.
CoRR, 2015

A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality.
BMC Bioinform., 2015

Joint amalgamation of most parsimonious reconciled gene trees.
Bioinform., 2015

2014
The agreement problem for unrooted phylogenetic trees is FPT.
J. Graph Algorithms Appl., 2014

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.
BMC Bioinform., 2014

Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable.
Algorithmica, 2014

2013
Representing a Set of Reconciliations in a Compact Way.
J. Bioinform. Comput. Biol., 2013

Reconciliation-based detection of co-evolving gene families.
BMC Bioinform., 2013

2012
On the Elusiveness of Clusters.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set.
SIAM J. Discret. Math., 2012

A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees.
J. Comput. Biol., 2012

Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees
CoRR, 2012

Fast computation of minimum hybridization networks.
Bioinform., 2012

A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Building species trees from larger parts of phylogenomic databases.
Inf. Comput., 2011

Tanglegrams for rooted phylogenetic trees and networks.
Bioinform., 2011

2010
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers.
Proceedings of the Comparative Genomics - International Workshop, 2010

Phylogenetic Networks - Concepts, Algorithms and Applications.
Cambridge University Press, ISBN: 978-0-521-75596-2, 2010

2009
Supertree methods for phylogenomics. (Méthodes de superarbres pour la phylogénomique).
PhD thesis, 2009

From Gene Trees to Species Trees through a Supertree Approach.
Proceedings of the Language and Automata Theory and Applications, 2009

2008
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

PhySIC_IST: cleaning source trees to infer more informative supertrees.
BMC Bioinform., 2008

2007
The Solution Space of Sorting by Reversals.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007


  Loading...