TY - JOUR AU - Fitch, W. M. PY - 1970 DA - 1970// TI - Distinguishing homologous from analogous proteins JO - Syst Biol VL - 19 ID - Fitch1970 ER - TY - JOUR AU - Altenhoff, A. M. AU - Dessimoz, C. PY - 2012 DA - 2012// TI - Inferring orthology and paralogy JO - Evol Genomics Stat Comput Methods VL - 1 UR - https://doi.org/10.1007/978-1-61779-582-4_9 DO - 10.1007/978-1-61779-582-4_9 ID - Altenhoff2012 ER - TY - JOUR AU - Schreiber, F. AU - Patricio, M. AU - Muffato, M. AU - Pignatelli, M. AU - Bateman, A. PY - 2014 DA - 2014// TI - Treefam v9: a new website, more species and orthology-on-the-fly JO - Nucleic Acids Res VL - 42 UR - https://doi.org/10.1093/nar/gkt1055 DO - 10.1093/nar/gkt1055 ID - Schreiber2014 ER - TY - JOUR AU - Doyon, J. P. AU - Ranwez, V. AU - Daubin, V. AU - Berry, V. PY - 2011 DA - 2011// TI - Models, algorithms and programs for phylogeny reconciliation JO - Brief Bioinform VL - 12 UR - https://doi.org/10.1093/bib/bbr045 DO - 10.1093/bib/bbr045 ID - Doyon2011 ER - TY - JOUR AU - Li, L. AU - Stoeckert, C. J. AU - Roos, D. S. PY - 2003 DA - 2003// TI - Orthomcl: identification of ortholog groups for eukaryotic genomes JO - Genome Res VL - 13 UR - https://doi.org/10.1101/gr.1224503 DO - 10.1101/gr.1224503 ID - Li2003 ER - TY - JOUR AU - Bergsten, J. PY - 2005 DA - 2005// TI - A review of long-branch attraction JO - Cladistics VL - 21 UR - https://doi.org/10.1111/j.1096-0031.2005.00059.x DO - 10.1111/j.1096-0031.2005.00059.x ID - Bergsten2005 ER - TY - JOUR AU - Hernandez-Rosales, M. AU - Hellmuth, M. AU - Wieseke, N. AU - Huber, K. T. AU - Moulton, V. AU - Stadler, P. F. PY - 2012 DA - 2012// TI - From event-labeled gene trees to species trees JO - BMC Bioinforma VL - 13 ID - Hernandez-Rosales2012 ER - TY - JOUR AU - Hellmuth, M. AU - Hernandez-Rosales, M. AU - Huber, K. T. AU - Moulton, V. AU - Stadler, P. F. AU - Wieseke, N. PY - 2013 DA - 2013// TI - Orthology relations, symbolic ultrametrics, and cographs JO - J Math Biol VL - 66 UR - https://doi.org/10.1007/s00285-012-0525-x DO - 10.1007/s00285-012-0525-x ID - Hellmuth2013 ER - TY - JOUR AU - Lafond, M. AU - El-Mabrouk, N. PY - 2014 DA - 2014// TI - Orthology and paralogy constraints: satisfiability and consistency JO - BMC Genomics VL - 15 UR - https://doi.org/10.1186/1471-2164-15-S6-S12 DO - 10.1186/1471-2164-15-S6-S12 ID - Lafond2014 ER - TY - JOUR AU - Hellmuth, M. AU - Wieseke, N. AU - Lechner, M. AU - Lenhof, H. P. AU - Middendorf, M. AU - Stadler, P. F. PY - 2015 DA - 2015// TI - Phylogenomics with paralogs JO - Proc Natl Acad Sci U S A VL - 112 UR - https://doi.org/10.1073/pnas.1412770112 DO - 10.1073/pnas.1412770112 ID - Hellmuth2015 ER - TY - JOUR AU - Ma, B. AU - Li, M. AU - Zhang, L. PY - 2000 DA - 2000// TI - From gene trees to species trees JO - SIAM J Comput VL - 30 UR - https://doi.org/10.1137/S0097539798343362 DO - 10.1137/S0097539798343362 ID - Ma2000 ER - TY - JOUR AU - Koonin, E. V. PY - 2005 DA - 2005// TI - Orthologs, paralogs, and evolutionary genomics 1 JO - Annu Rev Genet VL - 39 UR - https://doi.org/10.1146/annurev.genet.39.073003.114725 DO - 10.1146/annurev.genet.39.073003.114725 ID - Koonin2005 ER - TY - JOUR AU - Corneil, D. AU - Lerchs, H. AU - Stewart-Burlingham, L. K. PY - 1981 DA - 1981// TI - Complement reducible graphs JO - Discret Appl Math VL - 3 UR - https://doi.org/10.1016/0166-218X(81)90013-5 DO - 10.1016/0166-218X(81)90013-5 ID - Corneil1981 ER - TY - JOUR AU - Bőcker, S. AU - Dress, A. W. M. PY - 1998 DA - 1998// TI - Recovering symbolically dated, rooted trees from symbolic ultrametrics JO - Adv Math VL - 138 UR - https://doi.org/10.1006/aima.1998.1743 DO - 10.1006/aima.1998.1743 ID - Bőcker1998 ER - TY - JOUR AU - Bretscher, A. AU - Corneil, D. AU - Habib, M. AU - Paul, C. PY - 2008 DA - 2008// TI - A simple linear time lexbfs cograph recognition algorithm JO - SIAM J Discret Math VL - 22 UR - https://doi.org/10.1137/060664690 DO - 10.1137/060664690 ID - Bretscher2008 ER - TY - JOUR AU - Corneil, D. AU - Perl, Y. AU - Stewart, L. K. PY - 1985 DA - 1985// TI - A linear time recognition algorithm for cographs JO - SIAM J Comput VL - 14 UR - https://doi.org/10.1137/0214065 DO - 10.1137/0214065 ID - Corneil1985 ER - TY - JOUR AU - Golumbic, M. AU - Kaplan, H. AU - Shamir, R. PY - 1995 DA - 1995// TI - Graph sandwich problems JO - J Algorithm VL - 19 UR - https://doi.org/10.1006/jagm.1995.1047 DO - 10.1006/jagm.1995.1047 ID - Golumbic1995 ER - TY - JOUR AU - Aho, A. V. AU - Sagiv, Y. AU - Szymanski, T. G. AU - Ullman, J. D. PY - 1981 DA - 1981// TI - Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions JO - SIAM J Comput VL - 10 UR - https://doi.org/10.1137/0210030 DO - 10.1137/0210030 ID - Aho1981 ER - TY - STD TI - Lafond M, Swenson KM, El-Mabrouk N. An optimal reconciliation algorithm for gene trees with polytomies. In: International Workshop on Algorithms in Bioinformatics. Springer Berlin Heidelberg: 2012. p. 106–22. ID - ref19 ER - TY - JOUR AU - Boussau, B. AU - Szöllősi, G. J. AU - Duret, L. AU - Gouy, M. AU - Tannier, E. AU - Daubin, V. PY - 2013 DA - 2013// TI - Genome-scale coestimation of species and gene trees JO - Genome Res VL - 23 UR - https://doi.org/10.1101/gr.141978.112 DO - 10.1101/gr.141978.112 ID - Boussau2013 ER - TY - BOOK AU - Downey, R. G. AU - Fellows, M. R. PY - 1999 DA - 1999// TI - Parameterized Complexity PB - Springer CY - New York, NY, USA UR - https://doi.org/10.1007/978-1-4612-0515-9 DO - 10.1007/978-1-4612-0515-9 ID - Downey1999 ER - TY - BOOK AU - Garey, M. R. AU - Johnson, D. S. PY - 1979 DA - 1979// TI - Computers and Intractability: A Guide to the Theory of NP-Completeness PB - Co. CY - New York, NY, USA ID - Garey1979 ER - TY - JOUR AU - Zuckerman, D. PY - 2007 DA - 2007// TI - Linear degree extractors and the inapproximability of max clique and chromatic number JO - Theory Comput VL - 3 UR - https://doi.org/10.4086/toc.2007.v003a006 DO - 10.4086/toc.2007.v003a006 ID - Zuckerman2007 ER - TY - STD TI - Lafond M, Jones M. GitHub - UdeM-LBIT/OrthoPara-ConstraintChecker: A program to check if a given set of orthology/paralogy relations, with possible unknowns, is satisfiable or consistent with a species tree. https://github.com/UdeM-LBIT/OrthoPara-ConstraintChecker. Accessed 22 July 2016. UR - https://github.com/UdeM-LBIT/OrthoPara-ConstraintChecker ID - ref24 ER - TY - JOUR AU - Flicek, P. AU - Ahmed, I. AU - Amode, M. R. AU - Barrell, D. AU - Beal, K. AU - Brent, S. AU - Carvalho-Silva, D. AU - Clapham, P. AU - Coates, G. AU - Fairley, S. PY - 2012 DA - 2012// TI - Ensembl 2013 JO - Nucleic Acids Res VL - 41 ID - Flicek2012 ER - TY - JOUR AU - Lechner, M. AU - Findeiß, S. AU - Steiner, L. AU - Marz, M. AU - Stadler, P. F. AU - Prohaska, S. J. PY - 2011 DA - 2011// TI - Proteinortho: Detection of (co-) orthologs in large-scale analysis JO - BMC Bioinforma VL - 12 UR - https://doi.org/10.1186/1471-2105-12-124 DO - 10.1186/1471-2105-12-124 ID - Lechner2011 ER - TY - STD TI - Ensembl. Ensembl Species Tree. http://www.ensembl.org/info/about/speciestree.html. Accessed 22 July 2016. UR - http://www.ensembl.org/info/about/speciestree.html ID - ref27 ER - TY - JOUR AU - Scornavacca, C. AU - Berry, V. AU - Lefort, V. AU - Douzery, E. J. AU - Ranwez, V. PY - 2008 DA - 2008// TI - Physic_ist: cleaning source trees to infer more informative supertrees JO - BMC Bioinforma VL - 9 UR - https://doi.org/10.1186/1471-2105-9-413 DO - 10.1186/1471-2105-9-413 ID - Scornavacca2008 ER -