{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:32Z","timestamp":1725566132526},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160004"},{"type":"electronic","value":"9783642160011"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16001-1_16","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:46:31Z","timestamp":1284489991000},"page":"183-194","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Supertree Methods Revisited"],"prefix":"10.1007","author":[{"given":"Malte","family":"Brinkmeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thasso","family":"Griebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"B\u00f6cker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01894195","volume":"3","author":"A.D. Gordon","year":"1986","unstructured":"Gordon, A.D.: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labelled leaves. J. Classif.\u00a03, 335\u2013348 (1986)","journal-title":"J. Classif."},{"key":"16_CR2","series-title":"Computational Biology Book Series","volume-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life","year":"2004","unstructured":"Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology Book Series, vol.\u00a04. Kluwer Academic, Dordrecht (2004)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/S0076-6879(05)95038-6","volume":"395","author":"O.R.P. Bininda-Emonds","year":"2005","unstructured":"Bininda-Emonds, O.R.P.: Supertree construction in the genomic age. Methods Enzymol.\u00a0395, 745\u2013757 (2005)","journal-title":"Methods Enzymol."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TCBB.2006.4","volume":"3","author":"S. Roch","year":"2006","unstructured":"Roch, S.: A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a03(1), 92\u201394 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math.\u00a03, 43\u201349 (1982)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"B.R. Baum","year":"1992","unstructured":"Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon\u00a041(1), 3\u201310 (1992)","journal-title":"Taxon"},{"issue":"1-3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0303-2647(92)90007-L","volume":"28","author":"M.A. Ragan","year":"1992","unstructured":"Ragan, M.A.: Matrix representation in reconstructing phylogenetic relationships among the eukaryotes. Biosystems\u00a028(1-3), 47\u201355 (1992)","journal-title":"Biosystems"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TCBB.2006.26","volume":"3","author":"D. Chen","year":"2006","unstructured":"Chen, D., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.: Minimum-flip supertrees: complexity and algorithms. IEEE\/ACM Trans. Comput. Biol. Bioinform.\u00a03(2), 165\u2013173 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-1-4020-2330-9_3","volume-title":"Phylogenetic Supertrees (combining information to reveal the tree of life)","author":"H.A. Ross","year":"2004","unstructured":"Ross, H.A., Rodrigo, A.G.: An assessment of matrix representation with compatibility in supertree construction. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic Supertrees (combining information to reveal the tree of life), vol.\u00a03, pp. 35\u201363. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"1-3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","volume":"105","author":"C. Semple","year":"2000","unstructured":"Semple, C., Steel, M.: A supertree method for rooted trees. Discrete Appl. Math.\u00a0105(1-3), 147\u2013158 (2000)","journal-title":"Discrete Appl. Math."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45784-4_41","volume-title":"Algorithms in Bioinformatics","author":"R.D.M. Page","year":"2002","unstructured":"Page, R.D.M.: Modified mincut supertrees. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 537\u2013552. Springer, Heidelberg (2002)"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.bulm.2004.04.006","volume":"66","author":"S.J. Willson","year":"2004","unstructured":"Willson, S.J.: Constructing rooted supertrees using distances. Bull. Math. Biol.\u00a066(6), 1755\u20131783 (2004)","journal-title":"Bull. Math. Biol."},{"issue":"5","key":"16_CR13","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1080\/10635150701639754","volume":"56","author":"V. Ranwez","year":"2007","unstructured":"Ranwez, V., Berry, V., Criscuolo, A., Fabre, P.-H., Guillemot, S., Scornavacca, C., Douzery, E.J.P.: PhySIC: a veto supertree method with desirable properties. Syst. Biol.\u00a056(5), 798\u2013817 (2007)","journal-title":"Syst. Biol."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1186\/1471-2105-9-413","volume":"9","author":"C. Scornavacca","year":"2008","unstructured":"Scornavacca, C., Berry, V., Lefort, V., Douzery, E.J.P., Ranwez, V.: PhySIC_IST: cleaning source trees to infer more informative supertrees. BMC Bioinformatics\u00a09, 413 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1080\/10635150120358","volume":"50","author":"O.R.P. Bininda-Emonds","year":"2001","unstructured":"Bininda-Emonds, O.R.P., Sanderson, M.J.: Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Syst. Biol.\u00a050(4), 565\u2013579 (2001)","journal-title":"Syst. Biol."},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1177\/117693430600200018","volume":"2","author":"C. Levasseur","year":"2006","unstructured":"Levasseur, C., Lapointe, F.-J.: Total evidence, average consensus and matrix representation with parsimony: What a difference distances make. Evol. Bioinform.\u00a02, 249\u2013253 (2006)","journal-title":"Evol. Bioinform."},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0210030","volume":"10","author":"A.V. Aho","year":"1981","unstructured":"Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comput.\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM J. Comput."},{"key":"16_CR18","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/061\/12","volume-title":"Bioconsensus","author":"J.L. Thorley","year":"2003","unstructured":"Thorley, J.L., Wilkinson, M.: A view of supertree methods. In: Jannowitz, M.F., Lapointe, F.J., McMorris, F.R., Roberts, F.S. (eds.) Bioconsensus, vol.\u00a061. The American Mathematical Society, Providence (2003)"},{"issue":"5","key":"16_CR19","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1111\/j.1096-0031.2002.tb00289.x","volume":"18","author":"P.A. Goloboff","year":"2002","unstructured":"Goloboff, P.A., Pol, D.: Semi-strict supertrees. Cladistics\u00a018(5), 514\u2013525 (2002)","journal-title":"Cladistics"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1093\/bioinformatics\/19.2.301","volume":"19","author":"M.J. Sanderson","year":"2003","unstructured":"Sanderson, M.J.: r8s: inferring absolute rates of molecular evolution and divergence times in the absence of a molecular clock. Bioinformatics\u00a019(2), 301\u2013302 (2003)","journal-title":"Bioinformatics"},{"issue":"3","key":"16_CR21","first-page":"235","volume":"13","author":"A. Rambaut","year":"1997","unstructured":"Rambaut, A., Grassly, N.C.: Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Comput. Appl. Biosci.\u00a013(3), 235\u2013238 (1997)","journal-title":"Comput. Appl. Biosci."},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/BF00160154","volume":"39","author":"Z. Yang","year":"1994","unstructured":"Yang, Z.: Maximum likelihood phylogenetic estimation from DNA sequences with variable rates over sites: approximate methods. J. Mol. Evol.\u00a039(3), 306\u2013314 (1994)","journal-title":"J. Mol. Evol."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1186\/1471-2148-7-216","volume":"7","author":"J.W. Higdon","year":"2007","unstructured":"Higdon, J.W., Bininda-Emonds, O.P., Beck, R.M.D., Ferguson, S.H.: Phylogeny and divergence of the pinnipeds (carnivora: Mammalia) assessed using a multigene dataset. BMC Evol. Biol.\u00a07, 216 (2007)","journal-title":"BMC Evol. Biol."},{"issue":"21","key":"16_CR24","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1093\/bioinformatics\/btl446","volume":"22","author":"A. Stamatakis","year":"2006","unstructured":"Stamatakis, A.: RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics\u00a022(21), 2688\u20132690 (2006)","journal-title":"Bioinformatics"},{"unstructured":"Swafford, D.: Paup*: Phylogenetic analysis using parsimony (*and other methods), Version 4 (2002)","key":"16_CR25"},{"issue":"1-2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci.\u00a053(1-2), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"unstructured":"Gordon, A.D.: On the assessment and comparison of classifications. In: Tomassine, R. (ed.) Analyse de Donn\u00e9es et Informatique, Le Chesnay, INRIA, France, pp. 149\u2013160 (1980)","key":"16_CR27"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16001-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T20:33:22Z","timestamp":1553114002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16001-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160004","9783642160011"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16001-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}