default search action
Céline Scornavacca
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j41]Reza Kalhor
, Guillaume Beslon, Manuel Lafond
A Rigorous Framework to Classify the Postduplication Fate of Paralogous Genes. J. Comput. Biol. 31(9): 815-833 (2024) - [e1]Céline Scornavacca, Maribel Hernández-Rosales
Comparative Genomics - 21st International Conference, RECOMB-CG 2024, Boston, MA, USA, April 27-28, 2024, Proceedings. Lecture Notes in Computer Science 14616, Springer 2024, ISBN 978-3-031-58071-0 [contents] - [i19]Leo van Iersel, Mark Jones, Jannik Schestag, Céline Scornavacca, Mathias Weller:
Maximizing Network Phylogenetic Diversity. CoRR abs/2405.01091 (2024) - 2023
- [c11]Reza Kalhor, Guillaume Beslon, Manuel Lafond, Céline Scornavacca:
Classifying the Post-duplication Fate of Paralogous Genes. RECOMB-CG 2023: 1-18 - 2022
- [j40]Céline Scornavacca, Mathias Weller:
Treewidth-based algorithms for the small parsimony problem on networks. Algorithms Mol. Biol. 17(1): 15 (2022) - [j39]Sarah Lutteropp
NetRAX: accurate and fast maximum likelihood phylogenetic network inference. Bioinform. 38(15): 3725-3733 (2022) - 2021
- [j38]Charles-Elie Rabier, Vincent Berry
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo. PLoS Comput. Biol. 17(9) (2021) - [c10]Céline Scornavacca, Mathias Weller:
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks. WABI 2021: 6:1-6:21 - 2020
- [j37]Nicolas Comte, Benoit Morel, Damir Hasic, Laurent Guéguen, Bastien Boussau, Vincent Daubin, Simon Penel, Céline Scornavacca, Manolo Gouy, Alexandros Stamatakis
Treerecs: an integrated phylogenetic tool, from sequences to reconciliations. Bioinform. 36(18): 4822-4824 (2020) - [j36]Joan Carles Pons
Generation of Level-kk LGT Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 158-164 (2020) - [c9]Vincent Berry
Scanning Phylogenetic Networks Is NP-hard. SOFSEM 2020: 519-530 - [i18]Jakub Truszkowski, Céline Scornavacca, Fabio Pardi:
Computing the probability of gene trees concordant with the species tree in the multispecies coalescent. CoRR abs/2001.06741 (2020)
2010 – 2019
- 2019
- [j35]David Bryant
An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees. Algorithmica 81(9): 3692-3706 (2019) - [j34]Riccardo Dondi, Manuel Lafond
Reconciling multiple genes trees via segmental duplications and losses. Algorithms Mol. Biol. 14(1): 7:1-7:19 (2019) - [j33]Gabriel Cardona
Generation of Binary Tree-Child phylogenetic networks. PLoS Comput. Biol. 15(9) (2019) - [j32]Gabriel Cardona, Joan Carles Pons, Céline Scornavacca:
Correction: Generation of Binary Tree-Child phylogenetic networks. PLoS Comput. Biol. 15(10) (2019) - [j31]Manuel Lafond
On the Weighted Quartet Consensus problem. Theor. Comput. Sci. 769: 1-17 (2019) - [i17]Gabriel Cardona, Joan Carles Pons, Céline Scornavacca:
Generation of Tree-Child phylogenetic networks. CoRR abs/1902.09015 (2019) - [i16]Mark Jones, Philippe Gambette, Leo van Iersel, Remie Janssen, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Cutting an alignment with Ockham's razor. CoRR abs/1910.11041 (2019) - 2018
- [j30]Wandrille Duchemin
RecPhyloXML: a format for reconciled gene trees. Bioinform. 34(21): 3646-3652 (2018) - [j29]Matija Brozovic, Christelle Dantec
ANISEED 2017: extending the integrated ascidian database to the exploration and evolutionary comparison of genome-scale datasets. Nucleic Acids Res. 46(Database-Issue): D718-D725 (2018) - [c8]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. WABI 2018: 5:1-5:16 - [i15]Riccardo Dondi, Manuel Lafond, Céline Scornavacca:
Reconciling Multiple Genes Trees via Segmental Duplications and Losses. CoRR abs/1806.03988 (2018) - [i14]David Bryant, Céline Scornavacca:
An O(n log n) time Algorithm for computing the Path-length Distance between Trees. CoRR abs/1811.00619 (2018) - 2017
- [j28]Katharina T. Huber, Leo van Iersel, Vincent Moulton
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica 77(1): 173-200 (2017) - [j27]Edwin Jacox, Mathias Weller, Eric Tannier, Céline Scornavacca:
Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses. Bioinform. 33(7): 980-987 (2017) - [j26]Philippe Gambette
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8) (2017) - [j25]Julia Matsieva, Steven Kelk, Céline Scornavacca, Chris Whidden
A Resolution of the Static Formulation Question for the Problem of Computing the History Bound. IEEE ACM Trans. Comput. Biol. Bioinform. 14(2): 404-417 (2017) - [c7]Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus Problem. CPM 2017: 28:1-28:18 - [c6]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract). SPIRE 2017: 129-143 - [i13]Mark Jones, Manuel Lafond, Céline Scornavacca:
Consistency of orthology and paralogy constraints in the presence of gene transfers. CoRR abs/1705.01240 (2017) - [i12]Cédric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller:
Constructing a Consensus Phylogeny from a Leaf-Removal Distance. CoRR abs/1705.05295 (2017) - [i11]Steven Kelk, Fabio Pardi, Céline Scornavacca, Leo van Iersel:
Finding the most parsimonious or likely tree in a network with respect to an alignment. CoRR abs/1707.03648 (2017) - [i10]Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca:
Exploring the tiers of rooted phylogenetic network space using tail moves. CoRR abs/1708.07656 (2017) - 2016
- [j24]François Chevenet
SylvX: a viewer for phylogenetic tree reconciliations. Bioinform. 32(4): 608-610 (2016) - [j23]Edwin Jacox, Cédric Chauve
ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony. Bioinform. 32(13): 2056-2058 (2016) - [j22]Manuel Binet, Olivier Gascuel, Céline Scornavacca, Emmanuel J. P. Douzery, Fabio Pardi:
Fast and accurate branch lengths estimation for phylogenomic trees. BMC Bioinform. 17: 23 (2016) - [j21]Mark Jones, Christophe Paul
On the consistency of orthology relationships. BMC Bioinform. 17(S-14): 251-262 (2016) - [j20]Leo van Iersel, Steven Kelk, Céline Scornavacca:
Kernelizations for the hybridization number problem on multiple nonbinary trees. J. Comput. Syst. Sci. 82(6): 1075-1089 (2016) - [j19]Steven Kelk, Leo van Iersel, Céline Scornavacca, Mathias Weller:
Phylogenetic incongruence through the lens of Monadic Second Order logic. J. Graph Algorithms Appl. 20(2): 189-215 (2016) - [j18]Matija Brozovic, Cyril Martin, Christelle Dantec
ANISEED 2015: a digital framework for the comparative developmental biology of ascidians. Nucleic Acids Res. 44(Database-Issue): 808-818 (2016) - [c5]Julien Baste
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. AAIM 2016: 53-64 - [i9]Julien Baste, Christophe Paul, Ignasi Sau
Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees. CoRR abs/1604.03008 (2016) - [i8]Philippe Gambette, Leo van Iersel, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Do branch lengths help to locate a tree in a phylogenetic network? CoRR abs/1607.06285 (2016) - [i7]Manuel Lafond, Céline Scornavacca:
On the Weighted Quartet Consensus problem. CoRR abs/1610.00505 (2016) - 2015
- [j17]Céline Scornavacca, Edwin Jacox, Gergely J. Szöllosi
Joint amalgamation of most parsimonious reconciled gene trees. Bioinform. 31(6): 841-848 (2015) - [j16]Thu-Hien To, Edwin Jacox, Vincent Ranwez
A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality. BMC Bioinform. 16: 384:1-384:15 (2015) - [j15]Fabio Pardi, Céline Scornavacca:
Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable. PLoS Comput. Biol. 11(4) (2015) - [j14]Mareike Fischer
On Computing the Maximum Parsimony Score of a Phylogenetic Network. SIAM J. Discret. Math. 29(1): 559-585 (2015) - [i6]Steven Kelk, Leo van Iersel, Céline Scornavacca:
Phylogenetic incongruence through the lens of Monadic Second Order logic. CoRR abs/1503.00368 (2015) - 2014
- [j13]Steven Kelk, Céline Scornavacca:
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable. Algorithmica 68(4): 886-915 (2014) - [j12]Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca:
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinform. 15: 127 (2014) - [j11]Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant:
The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18(3): 385-392 (2014) - [i5]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. CoRR abs/1411.6804 (2014) - 2013
- [j10]Yao-ban Chan, Vincent Ranwez
Reconciliation-based detection of co-evolving gene families. BMC Bioinform. 14: 332 (2013) - [j9]Céline Scornavacca, Wojciech Paprotny, Vincent Berry, Vincent Ranwez
Representing a Set of Reconciliations in a Compact Way. J. Bioinform. Comput. Biol. 11(2) (2013) - 2012
- [j8]Benjamin Albrecht, Céline Scornavacca, Alberto Cenci
Fast computation of minimum hybridization networks. Bioinform. 28(2): 191-197 (2012) - [j7]Céline Scornavacca, Simone Linz
A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. J. Comput. Biol. 19(11): 1227-1242 (2012) - [j6]Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. SIAM J. Discret. Math. 26(4): 1635-1656 (2012) - [j5]Steven Kelk, Céline Scornavacca, Leo van Iersel:
On the Elusiveness of Clusters. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 517-534 (2012) - [c4]Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca:
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. WABI 2012: 430-440 - [i4]Steven Kelk, Céline Scornavacca:
Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees. CoRR abs/1207.7034 (2012) - 2011
- [j4]Céline Scornavacca, Franziska Zickmann, Daniel H. Huson:
Tanglegrams for rooted phylogenetic trees and networks. Bioinform. 27(13): 248-256 (2011) - [j3]Céline Scornavacca, Vincent Berry
Building species trees from larger parts of phylogenomic databases. Inf. Comput. 209(3): 590-605 (2011) - [i3]Steven Kelk, Céline Scornavacca, Leo van Iersel:
On the elusiveness of clusters. CoRR abs/1103.1834 (2011) - [i2]Steven Kelk, Céline Scornavacca:
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. CoRR abs/1108.3653 (2011) - [i1]Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie:
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. CoRR abs/1112.5359 (2011) - 2010
- [b2]Daniel H. Huson, Regula Rupp, Céline Scornavacca:
Phylogenetic Networks - Concepts, Algorithms and Applications. Cambridge University Press 2010, ISBN 978-0-521-75596-2, pp. I-XII, 1-362 - [c3]Jean-Philippe Doyon, Céline Scornavacca, K. Yu. Gorbunov, Gergely J. Szöllosi
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers. RECOMB-CG 2010: 93-108
2000 – 2009
- 2009
- [b1]Céline Scornavacca:
Supertree methods for phylogenomics. (Méthodes de superarbres pour la phylogénomique). Montpellier 2 University, France, 2009 - [c2]Céline Scornavacca, Vincent Berry
From Gene Trees to Species Trees through a Supertree Approach. LATA 2009: 702-714 - 2008
- [j2]Céline Scornavacca, Vincent Berry
PhySIC_IST: cleaning source trees to infer more informative supertrees. BMC Bioinform. 9 (2008) - [j1]Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier:
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 348-356 (2008) - 2007
- [c1]Marília D. V. Braga, Marie-France Sagot, Céline Scornavacca, Eric Tannier:
The Solution Space of Sorting by Reversals. ISBRA 2007: 293-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: