{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T20:41:18Z","timestamp":1776026478525,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0114-z","type":"journal-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:39:38Z","timestamp":1504017578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Biologically feasible gene trees, reconciliation maps and informative triples"],"prefix":"10.1186","volume":"12","author":[{"given":"Marc","family":"Hellmuth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"114_CR1","first-page":"57","volume":"1","author":"GS Gray","year":"1983","unstructured":"Gray GS, Fitch WM. Evolution of antibiotic resistance genes: the DNA sequence of a kanamycin resistance gene from Staphylococcus aureus. Mol Biol Evol. 1983;1:57\u201366.","journal-title":"Mol Biol Evol"},{"key":"114_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","volume":"16","author":"WM Fitch","year":"2000","unstructured":"Fitch WM. Homology: a personal view on some of the problems. Trends Genet. 2000;16:227\u201331.","journal-title":"Trends Genet."},{"key":"114_CR3","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/gb-2001-2-8-interactions1002","volume":"2","author":"RA Jensen","year":"2001","unstructured":"Jensen RA. Orthologs and paralogs\u2014we need to get it right. Genome Biol. 2001;2:8.","journal-title":"Genome Biol"},{"key":"114_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1006\/aima.1998.1743","volume":"138","author":"S B\u00f6cker","year":"1998","unstructured":"B\u00f6cker S, Dress AWM. Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv Math. 1998;138:105\u201325.","journal-title":"Adv Math"},{"issue":"1\u20132","key":"114_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s00285-012-0525-x","volume":"66","author":"M Hellmuth","year":"2013","unstructured":"Hellmuth M, Hernandez-Rosales M, Huber KT, Moulton V, Stadler PF, Wieseke N. Orthology relations, symbolic ultrametrics, and cographs. J Math Biol. 2013;66(1\u20132):399\u2013420.","journal-title":"J Math Biol"},{"issue":"1","key":"114_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s00285-016-1084-3","volume":"75","author":"M Hellmuth","year":"2017","unstructured":"Hellmuth M, Stadler PF, Wieseke N. The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree- representable systems of binary relations. J Math Biol. 2017;75(1):199\u2013237.","journal-title":"J Math Biol"},{"key":"114_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-319-41324-2_21","volume-title":"Evolutionary biology: convergent evolution, evolution of complex traits, concepts and methods","author":"M Hellmuth","year":"2016","unstructured":"Hellmuth M, Wieseke N. From sequence data including orthologs, paralogs, and xenologs to gene and species trees. In: Pontarotti P, editor. Evolutionary biology: convergent evolution, evolution of complex traits, concepts and methods. Cham: Springer; 2016. p. 373\u201392."},{"issue":"5","key":"114_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1038\/nrg1603","volume":"6","author":"F Delsuc","year":"2005","unstructured":"Delsuc F, Brinkmann H, Philippe H. Phylogenomics and the reconstruction of the tree of life. Nat Rev Genet. 2005;6(5):361\u201375.","journal-title":"Nat Rev Genet"},{"issue":"2","key":"114_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1093\/sysbio\/28.2.132","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G. Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Biol. 1979;28(2):132\u201363.","journal-title":"Syst Biol"},{"issue":"Suppl 19","key":"114_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/1471-2105-13-S19-S6","volume":"13","author":"M Hernandez-Rosales","year":"2012","unstructured":"Hernandez-Rosales M, Hellmuth M, Wieseke N, Huber KT, Moulton PF. V. and Stadler: from event-labeled gene trees to species trees. BMC Bioinform. 2012;13(Suppl 19):6.","journal-title":"BMC Bioinform"},{"issue":"7","key":"114_CR11","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.1073\/pnas.1412770112","volume":"112","author":"M Hellmuth","year":"2015","unstructured":"Hellmuth M, Wieseke N, Lechner M, Lenhof H-P, Middendorf M, Stadler PF. Phylogenomics with paralogs. Proc Natl Acad Sci. 2015;112(7):2058\u201363. doi: 10.1073\/pnas.1412770112 .","journal-title":"Proc Natl Acad Sci"},{"issue":"6","key":"114_CR12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/1471-2164-15-S6-S12","volume":"15","author":"M Lafond","year":"2014","unstructured":"Lafond M, El-Mabrouk N. Orthology and paralogy constraints: satisfiability and consistency. BMC Genom. 2014;15(6):12.","journal-title":"BMC Genom"},{"issue":"5","key":"114_CR13","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1038\/nrg3456","volume":"14","author":"T Gabald\u00f3n","year":"2013","unstructured":"Gabald\u00f3n T, Koonin E. Functional and evolutionary implications of gene orthology. Nat Rev Genet. 2013;14(5):360\u20136. doi: 10.1038\/nrg3456 .","journal-title":"Nat Rev Genet"},{"issue":"1","key":"114_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1093\/nar\/28.1.33","volume":"28","author":"RL Tatusov","year":"2000","unstructured":"Tatusov RL, Galperin MY, Natale DA, Koonin EV. The COG database: a tool for genome-scale analysis of protein functions and evolution. Nucleic Acids Res. 2000;28(1):33\u20136.","journal-title":"Nucleic Acids Res"},{"issue":"5338","key":"114_CR15","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1126\/science.278.5338.631","volume":"278","author":"RL Tatusov","year":"1997","unstructured":"Tatusov RL, Koonin EV, Lipman DJ. A genomic perspective on protein families. Science. 1997;278(5338):631\u20137.","journal-title":"Science"},{"issue":"1","key":"114_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P Gorecki","year":"2006","unstructured":"Gorecki P, Tiuryn J. DLS-trees: a model of evolutionary scenarios. Theor Compute Sci. 2006;359(1):378\u201399.","journal-title":"Theor Compute Sci"},{"key":"114_CR17","doi-asserted-by":"crossref","unstructured":"Rusin, L.Y., Lyubetskaya, E., Gorbunov, K.Y., Lyubetsky, V.: Reconciliation of gene and species trees. BioMed Res Int. 2014.","DOI":"10.1155\/2014\/642089"},{"issue":"10","key":"114_CR18","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1089\/cmb.2009.0095","volume":"16","author":"J-P Doyon","year":"2009","unstructured":"Doyon J-P, Chauve C, Hamel S. Space of gene\/species trees reconciliations and parsimonious models. J Comput Biol. 2009;16(10):1399\u2013418.","journal-title":"J Comput Biol"},{"key":"114_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.jda.2013.06.001","volume":"25","author":"R Dondi","year":"2014","unstructured":"Dondi R, El-Mabrouk N, Swenson KM. Gene tree correction for reconciliation and species tree inference: complexity and algorithms. J Discret Algorithms. 2014;25:51\u201365.","journal-title":"J Discret Algorithms"},{"issue":"8","key":"114_CR20","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1089\/cmb.2008.0092","volume":"15","author":"B Vernot","year":"2008","unstructured":"Vernot B, Stolzer M, Goldman A, Durand D. Reconciliation with non-binary species trees. J Comput Biol. 2008;15(8):981\u20131006.","journal-title":"J Comput Biol"},{"key":"114_CR21","doi-asserted-by":"crossref","unstructured":"Lafond M, Swenson KM, El-Mabrouk N. An optimal reconciliation algorithm for gene trees with polytomies. In: International workshop on algorithms in bioinformatics. Berlin: Springer, 2012. pp 106\u2013122.","DOI":"10.1007\/978-3-642-33122-0_9"},{"issue":"18","key":"114_CR22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1093\/bioinformatics\/bts386","volume":"28","author":"M Stolzer","year":"2012","unstructured":"Stolzer M, Lai H, Xu M, Sathaye D, Vernot B, Durand D. Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinformatics. 2012;28(18):409.","journal-title":"Bioinformatics"},{"key":"114_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/gbe\/evq077","volume":"3","author":"DH Huson","year":"2011","unstructured":"Huson DH, Scornavacca C. A survey of combinatorial methods for phylogenetic networks. Genom Biol Evol. 2011;3:23\u201335.","journal-title":"Genom Biol Evol"},{"issue":"9","key":"114_CR24","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1093\/bioinformatics\/14.9.819","volume":"14","author":"R Page","year":"1998","unstructured":"Page R. Genetree: comparing gene and species phylogenies using reconciled trees. Bioinformatics. 1998;14(9):819\u201320.","journal-title":"Bioinformatics"},{"issue":"1","key":"114_CR25","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1093\/sysbio\/syu048","volume":"64","author":"GJ Sz\u00f6ll\u0151si","year":"2015","unstructured":"Sz\u00f6ll\u0151si GJ, Tannier E, Daubin V, Boussau B. The inference of gene trees with species trees. Syst Biol. 2015;64(1):42.","journal-title":"Syst Biol"},{"key":"114_CR26","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-61779-585-5_2","volume-title":"Evolutionary genomics: statistical and computational methods","author":"GJ Sz\u00f6ll\u0151si","year":"2012","unstructured":"Sz\u00f6ll\u0151si GJ, Daubin V. Modeling gene family evolution and reconciling phylogenetic discord. In: Anisimova M, editor. Evolutionary genomics: statistical and computational methods, vol. 2. Totowa: Humana Press; 2012. p. 29\u201351."},{"issue":"3","key":"114_CR27","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S0097539798343362","volume":"30","author":"B Ma","year":"2000","unstructured":"Ma B, Li M, Zhang L. From gene trees to species trees. SIAM J Comput. 2000;30(3):729\u201352.","journal-title":"SIAM J Comput"},{"issue":"5","key":"114_CR28","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1093\/bib\/bbr045","volume":"12","author":"J-P Doyon","year":"2011","unstructured":"Doyon J-P, Ranwez V, Daubin V, Berry V. Models, algorithms and programs for phylogeny reconciliation. Brief Bioinform. 2011;12(5):392\u2013400.","journal-title":"Brief Bioinform"},{"key":"114_CR29","first-page":"93","volume-title":"An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers","author":"J-P Doyon","year":"2010","unstructured":"Doyon J-P, Scornavacca C, Gorbunov KY, Sz\u00f6ll\u0151si GJ, Berry V. An efficient algorithm for gene\/species trees parsimonious reconciliation with losses, duplications and transfers. Berlin: Springer; 2010. p. 93\u2013108."},{"key":"114_CR30","doi-asserted-by":"crossref","unstructured":"Eulenstein O, Huzurbazar S, Liberles DA. Reconciling phylogenetic trees. Evol Gene Duplic. 2010;185\u2013206.","DOI":"10.1002\/9780470619902.ch10"},{"issue":"2","key":"114_CR31","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh A, Hallett M, Lagergren J. Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans Comput Biol Bioinform. 2011;8(2):517\u201335.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"114_CR32","doi-asserted-by":"crossref","first-page":"1000262","DOI":"10.1371\/journal.pcbi.1000262","volume":"5","author":"AM Altenhoff","year":"2009","unstructured":"Altenhoff AM, Dessimoz C. Phylogenetic and functional assessment of orthologs inference projects and methods. PLoS Comput Biol. 2009;5:1000262.","journal-title":"PLoS Comput Biol."},{"issue":"1","key":"114_CR33","doi-asserted-by":"crossref","first-page":"53786","DOI":"10.1371\/journal.pone.0053786","volume":"8","author":"AM Altenhoff","year":"2013","unstructured":"Altenhoff AM, Gil M, Gonnet GH, Dessimoz C. Inferring hierarchical orthologous groups from orthologous gene pairs. PLoS ONE. 2013;8(1):53786.","journal-title":"PLoS ONE"},{"issue":"D1","key":"114_CR34","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1093\/nar\/gku1158","volume":"43","author":"AM Altenhoff","year":"2015","unstructured":"Altenhoff AM, \u0160kunca N, Glover N, Train C-M, Sueki A, Pili\u017eota I, Gori K, Tomiczek B, M\u00fcller S, Redestig H, Gonnet GH, Dessimoz C. The OMA orthology database in 2015: function predictions, better plant support, synteny view and other improvements. Nucleic Acids Res. 2015;43(D1):240\u20139.","journal-title":"Nucleic Acids Res"},{"issue":"S1","key":"114_CR35","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1093\/nar\/gkj123","volume":"34","author":"F Chen","year":"2006","unstructured":"Chen F, Mackey AJ, Stoeckert CJ, Roos DS. OrthoMCL-db: querying a comprehensive multi-species collection of ortholog groups. Nucleic Acids Res. 2006;34(S1):363\u20138.","journal-title":"Nucleic Acids Res"},{"key":"114_CR36","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1186\/1471-2105-12-124","volume":"12","author":"M Lechner","year":"2011","unstructured":"Lechner M, Findei\u00df S, Steiner L, Marz M, Stadler PF, Prohaska SJ. Proteinortho: detection of (co-)orthologs in large-scale analysis. BMC Bioinform. 2011;12:124.","journal-title":"BMC Bioinform"},{"issue":"8","key":"114_CR37","doi-asserted-by":"crossref","first-page":"105015","DOI":"10.1371\/journal.pone.0105015","volume":"9","author":"M Lechner","year":"2014","unstructured":"Lechner M, Hernandez-Rosales M, Doerr D, Wiesecke N, Thevenin A, Stoye J, Hartmann RK, Prohaska SJ, Stadler PF. Orthology detection combining clustering and synteny for very large datasets. PLoS ONE. 2014;9(8):105015.","journal-title":"PLoS ONE"},{"issue":"suppl 1","key":"114_CR38","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1093\/nar\/gkp931","volume":"38","author":"G \u00d6stlund","year":"2010","unstructured":"\u00d6stlund G, Schmitt T, Forslund K, K\u00f6stler T, Messina DN, Roopra S, Frings O, Sonnhammer EL. InParanoid 7: new algorithms and tools for eukaryotic orthology analysis. Nucleic Acids Res. 2010;38(suppl 1):196\u2013203.","journal-title":"Nucleic Acids Res"},{"issue":"10","key":"114_CR39","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1002\/bies.201100062","volume":"33","author":"K Trachana","year":"2011","unstructured":"Trachana K, Larsson TA, Powell S, Chen W-H, Doerks T, Muller J, Bork P. Orthology prediction methods: a quality assessment using curated protein families. BioEssays. 2011;33(10):769\u201380.","journal-title":"BioEssays"},{"key":"114_CR40","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1093\/nar\/gkm1000","volume":"36","author":"DL Wheeler","year":"2008","unstructured":"Wheeler DL, Barrett T, Benson DA, Bryant SH, Canese K, Chetvernin V, Church DM, Dicuccio M, Edgar R, Federhen S, Feolo M, Geer LY, Helmberg W, Kapustin Y, Khovayko O, Landsman D, Lipman DJ, Madden TL, Maglott DR, Miller V, Ostell J, Pruitt KD, Schuler GD, Shumway M, Sequeira E, Sherry ST, Sirotkin K, Souvorov A, Starchenko G, Tatusov RL, Tatusova TA, Wagner L, Yaschenko E. Database resources of the national center for biotechnology information. Nucleic Acids Res. 2008;36:13\u201321.","journal-title":"Nucleic Acids Res"},{"issue":"8","key":"114_CR41","doi-asserted-by":"crossref","first-page":"2072","DOI":"10.1128\/JB.184.8.2072-2080.2002","volume":"184","author":"GDP Clarke","year":"2002","unstructured":"Clarke GDP, Beiko RG, Ragan MA, Charlebois RL. Inferring genome trees by using a filter to eliminate phylogenetically discordant sequences and a distance matrix based on mean normalized BLASTP scores. J Bacteriol. 2002;184(8):2072\u201380.","journal-title":"J Bacteriol"},{"key":"114_CR42","doi-asserted-by":"crossref","unstructured":"Dessimoz C, Margadant D, Gonnet GH. DLIGHT\u2014 lateral gene transfer detection using pairwise evolutionary distances in a statistical framework. In: Proceedings RECOMB 2008. Berlin: Springer; 2008. p. 315\u2013330.","DOI":"10.1007\/978-3-540-78839-3_27"},{"issue":"3","key":"114_CR43","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1093\/genetics\/131.3.753","volume":"131","author":"JG Lawrence","year":"1992","unstructured":"Lawrence JG, Hartl DL. Inference of horizontal genetic transfer from molecular data: an approach using the bootstrap. Genetics. 1992;131(3):753\u201360.","journal-title":"Genetics"},{"issue":"8","key":"114_CR44","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1073\/pnas.96.8.4285","volume":"96","author":"M Pellegrini","year":"1999","unstructured":"Pellegrini M, Marcotte EM, Thompson MJ, Eisenberg D, Yeates TO. Assigning protein functions by comparative genome analysis: Protein phylogenetic profiles. Proc Natl Acad Sci USA. 1999;96(8):4285\u20138.","journal-title":"Proc Natl Acad Sci USA"},{"issue":"5","key":"114_CR45","doi-asserted-by":"crossref","first-page":"1004095","DOI":"10.1371\/journal.pcbi.1004095","volume":"11","author":"M Ravenhall","year":"2015","unstructured":"Ravenhall M, \u0160kunca N, Lassalle F, Dessimoz C. Inferring horizontal gene transfer. PLoS Comput Biol. 2015;11(5):1004095.","journal-title":"PLoS Comput Biol"},{"key":"114_CR46","doi-asserted-by":"crossref","unstructured":"Lafond M, El-Mabrouk N. Orthology relation and gene tree correction: complexity results. In: International workshop on algorithms in bioinformatics. Berlin: Springer; 2015. p. 66\u201379.","DOI":"10.1007\/978-3-662-48221-6_5"},{"key":"114_CR47","doi-asserted-by":"crossref","unstructured":"Dondi R., El-Mabrouk N, Lafond M. Correction of weighted orthology and paralogy relations-complexity and algorithmic results. In: International workshop on algorithms in bioinformatics. Berlin: Springer; 2016. p. 121\u2013136.","DOI":"10.1007\/978-3-319-43681-4_10"},{"issue":"1","key":"114_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13015-016-0067-7","volume":"11","author":"M Lafond","year":"2016","unstructured":"Lafond M, Dondi R, El-Mabrouk N. The link between orthology relations and gene trees: a correction perspective. Algorithms Mol Biol. 2016;11(1):1.","journal-title":"Algorithms Mol Biol"},{"issue":"1","key":"114_CR49","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/s13015-017-0096-x","volume":"12","author":"R Dondi","year":"2017","unstructured":"Dondi R, Lafond M, El-Mabrouk N. Approximating the correction of weighted and unweighted orthology and paralogy relations. Algorithms Mol Biol. 2017;12(1):4.","journal-title":"Algorithms Mol Biol"},{"key":"114_CR50","doi-asserted-by":"crossref","unstructured":"Dondi R, Mauri G, Zoppis I. Orthology correction for gene tree reconstruction: theoretical and experimental results. In: Procedia computer science, vol. 108, p. 1115\u20131124. International Conference on Computational Science, ICCS; 2017, 12\u201314 June 2017, Zurich, Switzerland.","DOI":"10.1016\/j.procs.2017.05.047"},{"key":"114_CR51","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/978-1-61779-582-4_9","volume-title":"Evolutionary genomics: statistical and computational methods","author":"AM Altenhoff","year":"2012","unstructured":"Altenhoff AM, Dessimoz C. Inferring orthology and paralogy. In: Anisimova M, editor. Evolutionary genomics: statistical and computational methods, vol. 1. Totowa: Humana Press; 2012. p. 259\u201379."},{"issue":"10","key":"114_CR52","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1089\/cmb.2013.0073","volume":"20","author":"MS Bansal","year":"2013","unstructured":"Bansal MS, Alm EJ, Kellis M. Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss. J Comput Biol. 2013;20(10):738\u201354.","journal-title":"J Comput Biol"},{"issue":"7328","key":"114_CR53","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1038\/nature09649","volume":"469","author":"LA David","year":"2011","unstructured":"David LA, Alm EJ. Rapid evolutionary innovation during an archaean genetic expansion. Nature. 2011;469(7328):93.","journal-title":"Nature"},{"issue":"12","key":"114_CR54","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1093\/bioinformatics\/bts225","volume":"28","author":"MS Bansal","year":"2012","unstructured":"Bansal MS, Alm EJ, Kellis M. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss. Bioinformatics. 2012;28(12):283\u201391.","journal-title":"Bioinformatics"},{"issue":"2","key":"114_CR55","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0025-5564(97)10012-8","volume":"149","author":"MA Charleston","year":"1998","unstructured":"Charleston MA. Jungles: a new solution to the host\/parasite phylogeny reconciliation problem. Math Biosci. 1998;149(2):191\u2013223.","journal-title":"Math Biosci"},{"key":"114_CR56","unstructured":"Ronquist F. Parsimony analysis of coevolving species associations. Tangled Trees Phylogeny Cospeciation Coevol. 2003;22\u201364."},{"key":"114_CR57","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.thbio.2005.01.003","volume":"4","author":"D Merkle","year":"2005","unstructured":"Merkle D, Middendorf M. Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information. Theory Biosci. 2005;4:277\u201399.","journal-title":"Theory Biosci"},{"issue":"1","key":"114_CR58","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1089\/cmb.2008.0084","volume":"16","author":"R Libeskind-Hadas","year":"2009","unstructured":"Libeskind-Hadas R, Charleston MA. On the computational complexity of the reticulate cophylogeny reconstruction problem. J Comput Biol. 2009;16(1):105\u201317.","journal-title":"J Comput Biol"},{"issue":"1","key":"114_CR59","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1186\/1471-2105-11-S1-S60","volume":"11","author":"D Merkle","year":"2010","unstructured":"Merkle D, Middendorf M, Wieseke N. A parameter-adaptive dynamic programming approach for inferring cophylogenies. BMC Bioinform. 2010;11(1):60.","journal-title":"BMC Bioinform"},{"key":"114_CR60","doi-asserted-by":"crossref","unstructured":"Wieseke N, Bernt M, Middendorf M. Unifying parsimonious tree reconciliation. In: Darling, A., Stoye, J. editors Algorithms in bioinformatics: Proceedings 13th international workshop, WABI 2013, Sophia Antipolis, France. Berlin: Springer. 2\u20134 September 2013. p. 200\u2013214","DOI":"10.1007\/978-3-642-40453-5_16"},{"issue":"1","key":"114_CR61","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1186\/1748-7188-5-16","volume":"5","author":"C Conow","year":"2010","unstructured":"Conow C, Fielder D, Ovadia Y, Libeskind-Hadas R. Jane: a new tool for the cophylogeny reconstruction problem. Algorithms Mol Biol. 2010;5(1):16.","journal-title":"Algorithms Mol Biol"},{"issue":"1","key":"114_CR62","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1089\/cmb.2009.0240","volume":"18","author":"Y Ovadia","year":"2011","unstructured":"Ovadia Y, Fielder D, Conow C, Libeskind-Hadas R. The cophylogeny reconstruction problem is np-complete. J Comput Biol. 2011;18(1):59\u201365.","journal-title":"J Comput Biol"},{"key":"114_CR63","unstructured":"N\u00f8jgaard N, Gei\u00df M, Stadler PF, Merkle D, Wieseke N, Hellmuth M. Forbidden time travel: Characterization of time-consistent tree reconciliation maps. In: Leibniz GW International proceedings in informatics, Wabi, 2017. (to appear) arXiv:1705.02179"},{"key":"114_CR64","volume-title":"Phylogenetics. Oxford lecture series in mathematics and its applications","author":"C Semple","year":"2003","unstructured":"Semple C, Steel M. Phylogenetics. Oxford lecture series in mathematics and its applications. Oxford: Oxford University Press; 2003."},{"key":"114_CR65","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic supertrees","author":"ORP Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds ORP. Phylogenetic supertrees. Dordrecht: Kluwer Academic Press; 2004."},{"key":"114_CR66","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139019767","volume-title":"Basic phylogenetic combinatorics","author":"AWM Dress","year":"2011","unstructured":"Dress AWM, Huber KT, Koolen J, Moulton V, Spillner A. Basic phylogenetic combinatorics. Cambridge: Cambridge University Press; 2011."},{"key":"114_CR67","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974485","volume-title":"Phylogeny: discrete and random processes in evolution. CBMS-NSF regional conference series in applied mathematics","author":"M Steel","year":"2016","unstructured":"Steel M. Phylogeny: discrete and random processes in evolution. CBMS-NSF regional conference series in applied mathematics. Philadelphia: SIAM; 2016."},{"key":"114_CR68","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"AV Aho","year":"1981","unstructured":"Aho AV, Sagiv Y, Szymanski TG, Ullman JD. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J Comput. 1981;10:405\u201321.","journal-title":"SIAM J Comput"},{"key":"114_CR69","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-004-1147-5","volume":"43","author":"J Jansson","year":"2005","unstructured":"Jansson J, Ng JH-K, Sadakane K, Sung W-K. Rooted maximum agreement supertrees. Algorithmica. 2005;43:293\u2013307.","journal-title":"Algorithmica"},{"key":"114_CR70","unstructured":"Deng Y, Fern\u00e1ndez-Baca D. Fast Compatibility Testing for Rooted Phylogenetic Trees. In: Grossi R, Lewenstein M, editors. In: 27th Annual symposium on combinatorial pattern matching (CPM 2016), vol. 54, Leibniz International Proceedings in Informatics (LIPIcs) Germany: Dagstuhl, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik; 2016. p. 12\u201311212."},{"key":"114_CR71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M Rauch Henzinger","year":"1999","unstructured":"Rauch Henzinger M, King V, Warnow T. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. 1999;24:1\u201313.","journal-title":"Algorithmica"},{"issue":"4","key":"114_CR72","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm J, de Lichtenberg K, Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J ACM. 2001;48(4):723\u201360.","journal-title":"J ACM"},{"key":"114_CR73","doi-asserted-by":"crossref","unstructured":"Hellmuth M, Wieseke N. On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions. In: Xu D, Du D, Du D, editors. In: Proceedings Computing and combinatorics: 21st international conference, COCOON 2015, Beijing, China, 4\u20136 August 2015. Cham: Springer; 2015. p. 609\u201323.","DOI":"10.1007\/978-3-319-21398-9_48"},{"key":"114_CR74","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0111-7","author":"M Hellmuth","year":"2017","unstructured":"Hellmuth M, Wieseke N. On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. J Comb Opt. 2017. doi: 10.1007\/s10878-017-0111-7 .","journal-title":"J Comb Opt"},{"issue":"8","key":"114_CR75","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1038\/nrg3962","volume":"16","author":"SM Soucy","year":"2015","unstructured":"Soucy SM, Huang J, Gogarten JP. Horizontal gene transfer: building the web of life. Nat Rev Genet. 2015;16(8):472\u201382.","journal-title":"Nat Rev Genet"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0114-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T22:22:29Z","timestamp":1659392549000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0114-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,29]]},"references-count":75,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["114"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0114-z","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,29]]},"article-number":"23"}}