Celine Scornavacca
103
Documents
Publications
- 10
- 8
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 19
- 15
- 14
- 10
- 10
- 8
- 8
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 8
- 6
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 2
- 4
- 8
- 10
- 10
- 7
- 10
- 13
- 8
- 6
- 4
- 5
- 4
- 3
- 2
- 2
- 2
|
Classifying the Post-duplication Fate of Paralogous GenesRECOMB-CG 2023 - 20th conference on Comparative Genomics, Apr 2023, Istanbul, Turkey. pp.1-18, ⟨10.1007/978-3-031-36911-7_1⟩
Communication dans un congrès
hal-04239853v1
|
|
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks21st International Workshop on Algorithms in Bioinformatics (WABI), Aug 2021, Chicago. Due to COVID-19, WABI 2021 will be held online., United States. pp.6:1, ⟨10.4230/LIPIcs.WABI.2021.6⟩
Communication dans un congrès
hal-03287112v1
|
|
Scanning Phylogenetic Networks is NP-hardSOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.519-530, ⟨10.1007/978-3-030-38919-2_42⟩
Communication dans un congrès
hal-02353161v2
|
On the Weighted Quartet Consensus problemCPM, 2018, Warsaw, Poland. pp.28:1-28:18, ⟨10.4230/LIPIcs.CPM.2017.28⟩
Communication dans un congrès
hal-02155127v1
|
|
Reconciling Multiple Genes Trees via Segmental Duplications and LossesWABI, 2018, Helsinki, Finland. pp.5:1--5:16
Communication dans un congrès
hal-02155103v1
|
|
|
Constructing a Consensus Phylogeny from a Leaf-Removal DistanceSPIRE 2017, Sep 2017, Palermo, Italy. pp.129--143, ⟨10.1007/978-3-319-67428-5\_12⟩
Communication dans un congrès
hal-02155266v1
|
|
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩
Communication dans un congrès
lirmm-01481368v1
|
Phylogenomics unravels the complex reticulated history and shifts in mating systems in wheat relatives (Aegilops/Triticum genus)ALPHY 2016: Belgium-French meeting on Bioinformatics and Evolutionary Genomics March 17-18 2016, Institut de Biologie Physico-Chimique (IBPC). Paris, FRA. Muséum National d’Histoire Naturelle (MNHN), FRA., Mar 2016, Lille, France
Communication dans un congrès
hal-02793573v1
|
|
Reconstructible phylogenetic networks: do not distinguish the indistinguishableEvolution, Jun 2015, Guarujà, Brazil
Communication dans un congrès
lirmm-01237428v1
|
|
Fast and accurate branch lengths estimation for phylogenomic treesEvolution, Jun 2015, Guarujà, Brazil
Communication dans un congrès
lirmm-01237507v1
|
|
|
Fast and accurate branch length estimation for phylogenomic trees: ERaBLE (Evolutionary Rates and Branch Length Estimation)Rencontres ALPHY - Génomique Evolutive, Bioinformatique, Alignement et Phylogénie, Mar 2015, Montpellier, France
Communication dans un congrès
lirmm-01237447v1
|
Identifiability of phylogenetic networksMCEB: Mathematical and Computational Evolutionary Biology, Jun 2014, Hameau de l'Etoile, St Martin de Londres, France
Communication dans un congrès
lirmm-01237418v1
|
|
Reconstructible phylogenetic networks: no need to distinguish the indistinguishableWaiheke, Feb 2014, Waiheke, New Zealand
Communication dans un congrès
lirmm-01237408v1
|
|
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary treesWABI, 2012, Ljubljana, Slovenia. pp.430-440
Communication dans un congrès
hal-02155227v1
|
|
|
Un algorithme de parcimonie efficace pour la réconciliation d'arbres de gènes/espèces avec pertes, duplications et transfertsJournées Ouvertes en Biologie, Informatique et Mathématiques, Institut National d'Etudes Supérieures Agronomiques de Montpellier (Montpellier SupAgro). Montpellier, FRA., Sep 2010, Montpellier, France. pp.8
Communication dans un congrès
lirmm-00833164v1
|
|
From Gene Trees to Species Trees Through a Supertree ApproachLanguage and Automata Theory and Applications : LATA 2009, Apr 2009, Tarragona, Spain. pp.10-19, ⟨10.1007/978-3-642-00982-2_60⟩
Communication dans un congrès
lirmm-00367086v1
|
|
The solution space of sorting by reversals3rd International Symposium on Bioinformatics Research and Applications (ISBRA 2007), May 2007, Atlanta, GA, United States. pp.293-304, ⟨10.1007/978-3-540-72031-7_27⟩
Communication dans un congrès
hal-00434566v1
|
|
On the inference of complex phylogenetic networks by Markov Chain Monte-CarloJOBIM 2020 - 20e Journées Ouvertes de Biologie, Informatique et Mathématique, Jun 2020, Montpellier, France.
Poster de conférence
lirmm-04027842v1
|
|
Phylogenetics in the Genomic EraScornavacca, Celine; Delsuc, Frédéric; Galtier, Nicolas. No commercial publisher | Authors open access book, p.p. 1-568, 2020, 978-2-9575069-0-3
Ouvrages
hal-02535070v3
|
Phylogenetic NetworksCambridge University Press, 2010
Ouvrages
hal-02155099v1
|
|
Reconciling Gene trees with Species TreesScornavacca, Celine; Delsuc, Frédéric; Galtier, Nicolas. Phylogenetics in the Genomic Era, No commercial publisher | Authors open access book, pp.3.2:1--3.2:23, 2020
Chapitre d'ouvrage
hal-02535529v1
|
|
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and TransfersEric Tannier. Comparative Genomics. RECOMB-CG 2010, LNCS (6398), Springer Berlin Heidelberg, pp.93-108, 2010, 978-3-642-16181-0. ⟨10.1007/978-3-642-16181-0_9⟩
Chapitre d'ouvrage
lirmm-00818889v1
|
|
Comparing reconciled gene trees in linear time2020, pp.100002. ⟨10.24072/pci.mcb.100002⟩
Autre publication scientifique
hal-03087729v1
|
A bird’s white-eye view on neosex chromosome evolution2019, ⟨10.1101/505610⟩
Autre publication scientifique
hal-02155307v1
|
|
|
MaxTiC: Fast Ranking Of A Phylogenetic Tree By Maximum Time Consistency With Lateral Gene Transfers2017, ⟨10.1101/127548⟩
Autre publication scientifique
hal-01532738v3
|
|
Link between the birth-death and the Kingman coalescent - Applications to phylogenetic epidemiology2024
Pré-publication, Document de travail
hal-04447144v1
|
|
Cutting an alignment with Ockham's razor2019
Pré-publication, Document de travail
lirmm-02413025v1
|
|
SARS-CoV-2 Through the Lens of Computational Biology: How bioinformatics is playing a key role in the study of the virus and its origins[Research Report] CNRS. 2021, pp.1-35
Rapport
hal-03170023v1
|
|
Supertree methods for phylogenomicsBioinformatics [q-bio.QM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2009. English. ⟨NNT : ⟩
Thèse
tel-00842893v1
|