Distinguishing homologous from analogous proteins, Syst Biol, vol.19, issue.2, pp.99-113, 1970. ,
Inferring orthology and paralogy, Evol Genomics Stat Comput Methods, vol.1, pp.259-79, 2012. ,
Treefam v9: a new website, more species and orthology-on-the-fly, Nucleic Acids Res, vol.42, pp.922-927, 2013. ,
Models, algorithms and programs for phylogeny reconciliation, Brief Bioinform, vol.12, issue.5, pp.392-400, 2011. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00825041
Orthomcl: identification of ortholog groups for eukaryotic genomes, Genome Res, vol.13, issue.9, pp.2178-89, 2003. ,
A review of long-branch attraction, Cladistics, vol.21, issue.2, pp.163-93, 2005. ,
From event-labeled gene trees to species trees, BMC Bioinforma, vol.13, p.6, 2012. ,
Orthology relations, symbolic ultrametrics, and cographs, J Math Biol, vol.66, issue.1-2, pp.399-420, 2013. ,
Orthology and paralogy constraints: satisfiability and consistency, BMC Genomics, vol.15, issue.6, p.12, 2014. ,
Phylogenomics with paralogs, Proc Natl Acad Sci U S A, vol.112, issue.7, pp.2058-63, 2015. ,
From gene trees to species trees, SIAM J Comput, vol.30, issue.3, pp.729-52, 2000. ,
Orthologs, paralogs, and evolutionary genomics 1, Annu Rev Genet, vol.39, pp.309-347, 2005. ,
Complement reducible graphs, Discret Appl Math, vol.3, issue.1, pp.163-74, 1981. ,
Recovering symbolically dated, rooted trees from symbolic ultrametrics, Adv Math, vol.138, issue.1, pp.105-130, 1998. ,
A simple linear time lexbfs cograph recognition algorithm, SIAM J Discret Math, vol.22, issue.4, pp.1277-96, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00269525
A linear time recognition algorithm for cographs, SIAM J Comput, vol.14, issue.4, pp.926-960, 1985. ,
Graph sandwich problems, J Algorithm, vol.19, pp.449-73, 1995. ,
Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J Comput, vol.10, issue.3, pp.405-426, 1981. ,
An optimal reconciliation algorithm for gene trees with polytomies, International Workshop on Algorithms in Bioinformatics, pp.106-128, 2012. ,
,
, Genome-scale coestimation of species and gene trees, Genome Res, vol.23, issue.2, pp.323-353, 2013.
Parameterized Complexity, p.530, 1999. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Linear degree extractors and the inapproximability of max clique and chromatic number, Theory Comput, vol.3, issue.6, pp.103-131, 2007. ,
A program to check if a given set of orthology/paralogy relations, with possible unknowns, is satisfiable or consistent with a species tree, 2016. ,
, Nucleic Acids Res, vol.41, pp.48-55, 2012.
Proteinortho: Detection of (co-) orthologs in large-scale analysis, BMC Bioinforma, vol.12, issue.1, p.1, 2011. ,
Ensembl Species Tree, 2016. ,
Physic_ist: cleaning source trees to infer more informative supertrees, BMC Bioinforma, vol.9, issue.1, p.413, 2008. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00324069