Céline Scornavacca
According to our database1,
Céline Scornavacca
authored at least 62 papers
between 2007 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
J. Comput. Biol., 2024
2023
Proceedings of the Comparative Genomics - 20th International Conference, 2023
2022
Bioinform., 2022
Algorithms Mol. Biol., 2022
2021
PLoS Comput. Biol., 2021
2020
IEEE ACM Trans. Comput. Biol. Bioinform., 2020
Computing the probability of gene trees concordant with the species tree in the multispecies coalescent.
CoRR, 2020
Bioinform., 2020
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020
2019
PLoS Comput. Biol., 2019
Algorithms Mol. Biol., 2019
Algorithmica, 2019
2018
ANISEED 2017: extending the integrated ascidian database to the exploration and evolutionary comparison of genome-scale datasets.
Nucleic Acids Res., 2018
2017
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017
CoRR, 2017
Finding the most parsimonious or likely tree in a network with respect to an alignment.
CoRR, 2017
CoRR, 2017
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.
Bioinform., 2017
Algorithmica, 2017
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
J. Graph Algorithms Appl., 2016
J. Comput. Syst. Sci., 2016
BMC Bioinform., 2016
Bioinform., 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
SIAM J. Discret. Math., 2015
PLoS Comput. Biol., 2015
A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality.
BMC Bioinform., 2015
2014
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
J. Bioinform. Comput. Biol., 2013
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
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
2011
Inf. Comput., 2011
2010
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers.
Proceedings of the Comparative Genomics - International Workshop, 2010
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
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
BMC Bioinform., 2008
2007
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007