Buggs R (2013) Hybridization and speciation, J Evol Biol, vol.26, issue.2, pp.229-246 ,
Hardness of approximating problems on cubic graphs, Italian conference on algorithms and complexity (CIAC), pp.288-298, 1997. ,
On some tighter inapproximability results (extended abstract), International Colloquium on automata, languages and programming (ICALP), vol.1644, pp.200-209, 1999. ,
Cautionary tales of inapproximability, J Comput Biol, vol.24, issue.3, pp.213-216, 2017. ,
, Taxonomy with confidence. Math Biosci, vol.40, issue.3-4, pp.271-280, 1978.
A faster algorithm for the tree containment problem for binary nearly stable phylogenetic networks, 2015 12th international joint conference on computer science and software engineering (JCSSE), pp.337-342, 2015. ,
A probability model for inferring evolutionary trees, Syst Biol, vol.22, issue.3, pp.250-256, 1973. ,
On computing the maximum parsimony score of a phylogenetic network, SIAM J Discret Math, vol.29, issue.1, pp.559-585, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-02154929
Toward defining the course of evolution: minimum change for a specific tree topology, Syst Biol, vol.20, issue.4, pp.406-416, 1971. ,
Locating a tree in a phylogenetic network in quadratic time, pp.96-107, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01116231
An ancestral recombination graph, Progress in population genetics and human evolution, pp.257-270, 1997. ,
A program for verification of phylogenetic network models, Bioinformatics, vol.32, issue.17, pp.503-510, 2016. ,
ReCombinatorics: the algorithmics of ancestral recombination graphs and explicit phylogenetic networks, 2014. ,
Reconstructing evolution of sequences subject to recombination using parsimony, Math Biosci, vol.98, issue.2, pp.185-200, 1990. ,
Phylogenetic networks: concepts, algorithms and applications, 2010. ,
Maximum likelihood of phylogenetic networks, Bioinformatics, vol.22, issue.21, pp.2604-2611, 2006. ,
Efficient parsimony-based methods for phylogenetic network reconstruction, Bioinformatics, vol.23, issue.2, pp.123-128, 2007. ,
Seeing the trees and their branches in the network is hard, Theor Comput Sci, vol.401, issue.1-3, pp.153-164, 2008. ,
Maximum parsimony on phylogenetic networks, Algorithms Mol Biol, vol.7, issue.1, p.9, 2012. ,
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable, Algorithmica, vol.68, issue.4, pp.886-915, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-02154980
Reconstructing phylogenetic networks using maximum parsimony, Computational systems bioinformatics conference, 2005. Proceedings. 2005 IEEE, IEEE, pp.93-102, 2005. ,
Optimization, approximation, and complexity classes, J Comput Syst Sci, vol.43, pp.425-440, 1991. ,
A short proof that phylogenetic tree reconstruction by maximum likelihood is hard, IEEE/ACM Trans Comput Biol Bioinform, vol.3, issue.1, pp.92-94, 2006. ,
Links between maximum likelihood and maximum parsimony under a simple model of site substitution, Bull Math Biol, vol.59, issue.3, pp.581-607, 1997. ,
Locating a tree in a phylogenetic network, Inf Process Lett, vol.110, issue.23, pp.1037-1043, 2010. ,
Improved maximum parsimony models for phylogenetic networks, Syst Biol, vol.67, issue.3, pp.518-542, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02154860
Contribution of recombination to the evolutionary history of hiv, Curr Opin HIV AIDS, vol.10, issue.2, pp.84-89, 2015. ,
Bayesian inference of reticulate phylogenies under the multispecies network coalescent, PLoS Genet, vol.12, issue.5, p.6, 2016. ,
The probability of a gene tree topology within a phylogenetic network with applications to hybridization detection, PLoS Genet, vol.8, issue.4, p.660, 2012. ,
Bayesian inference of species networks from multilocus sequence data, Mol Biol Evol, vol.35, issue.2, pp.504-517, 2017. ,
Lateral gene transfer, Curr Biol, vol.21, issue.7, pp.242-246, 2011. ,