{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:29:46Z","timestamp":1787506186412,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152931","type":"print"},{"value":"9783642152948","type":"electronic"}],"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-15294-8_22","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"262-273","source":"Crossref","is-referenced-by-count":2,"title":["The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard S.","family":"Lemence","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","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 Journal on Computing\u00a010(3), 405\u2013421 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tree.2004.03.015","volume":"19","author":"O.R.P. Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: The evolution of supertrees. TRENDS in Ecology and Evolution\u00a019(6), 315\u2013322 (2004)","journal-title":"TRENDS in Ecology and Evolution"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-0-387-30162-4_134","volume-title":"Encyclopedia of Algorithms","author":"A. Bj\u00f6rklund","year":"2008","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Exact graph coloring using inclusion-exclusion. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, p. 289. Springer Science+Business Media, LLC, Heidelberg (2008)"},{"key":"22_CR4","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury, Christchurch, New Zealand (1997)"},{"issue":"11","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.dam.2010.03.004","volume":"158","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Guillemot, S., Jansson, J.: New results on optimizing rooted triplets consistency. Discrete Applied Mathematics\u00a0158(11), 1136\u20131147 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"6-7","key":"22_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.dam.2005.05.043","volume":"155","author":"B. Chor","year":"2007","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three taxon ML trees with variable rates across sites. Discrete Applied Mathematics\u00a0155(6-7), 750\u2013758 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR7","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"2-3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L. G\u0105sieniec","year":"1999","unstructured":"G\u0105sieniec, L., Jansson, J., Lingas, A., \u00d6stlin, A.: On the complexity of constructing evolutionary trees. Journal of Combinatorial Optimization\u00a03(2-3), 183\u2013197 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica\u00a024(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","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. Journal of the ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"Journal of the ACM"},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-004-1147-5","volume":"43","author":"J. Jansson","year":"2005","unstructured":"Jansson, J., Ng, J.H.-K., Sadakane, K., Sung, W.-K.: Rooted maximum agreement supertrees. Algorithmica\u00a043(4), 293\u2013307 (2005)","journal-title":"Algorithmica"},{"key":"22_CR12","first-page":"111","volume-title":"Current Topics in Computational Molecular Biology","author":"P. Kearney","year":"2002","unstructured":"Kearney, P.: Phylogenetics and the quartet method. In: Jiang, T., Xu, Y., Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology, pp. 111\u2013133. The MIT Press, Massachusetts (2002)"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"583","DOI":"10.2307\/1969046","volume":"49","author":"R. Otter","year":"1948","unstructured":"Otter, R.: The number of trees. Annals of Mathematics\u00a049(3), 583\u2013599 (1948)","journal-title":"Annals of Mathematics"},{"key":"22_CR14","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":"1-3","key":"22_CR15","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 Applied Mathematics\u00a0105(1-3), 147\u2013158 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S. Snir","year":"2006","unstructured":"Snir, S., Rao, S.: Using Max Cut to enhance rooted trees consistency. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(4), 323\u2013333 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing\u00a03(1), 103\u2013128 (2007)","journal-title":"Theory of Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T03:40:00Z","timestamp":1553053200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}