{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:25Z","timestamp":1725512125493},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797227"},{"type":"electronic","value":"9783540797234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79723-4_6","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T10:22:17Z","timestamp":1210069337000},"page":"43-54","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quang Bao Anh","family":"Bui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"Truss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"390","DOI":"10.2307\/2412432","volume":"21","author":"E.N. Adams III","year":"1972","unstructured":"Adams III, E.N.: Consensus techniques and the comparison of taxonomic trees. Syst. Zool.\u00a021(4), 390\u2013397 (1972)","journal-title":"Syst. Zool."},{"key":"6_CR2","series-title":"Computational Biology Book Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life","author":"O.R. Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology Book Series, vol.\u00a04. Kluwer Academic, Dordrecht (2004)"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/aama.1995.1020","volume":"16","author":"D. Bryant","year":"1995","unstructured":"Bryant, D., Steel, M.A.: Extension operations on sets of leaf-labelled trees. Adv. Appl. Math.\u00a016(4), 425\u2013453 (1995)","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"6_CR5","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/061\/10","volume-title":"Bioconsensus","author":"D. Chen","year":"2003","unstructured":"Chen, D., Diao, L., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.: Flipping: A supertree construction method. In: Bioconsensus. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a061, pp. 135\u2013160. American Mathematical Society, Providence, RI (2003)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-45655-4_42","volume-title":"Computing and Combinatorics","author":"D. Chen","year":"2002","unstructured":"Chen, D., Eulenstein, O., Fern\u00e1ndez-Baca, D., Sanderson, M.: Supertrees by flipping. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 391\u2013400. Springer, Heidelberg (2002)"},{"issue":"2","key":"6_CR7","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., Fernandez-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":"6_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"W. Day","year":"1986","unstructured":"Day, W., Johnson, D., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci.\u00a081, 33\u201342 (1986)","journal-title":"Math. Biosci."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"172","DOI":"10.2307\/2412452","volume":"19","author":"J. Farris","year":"1970","unstructured":"Farris, J., Kluge, A., Eckhardt, M.: A numerical approach to phylogenetic systemetics. Syst. Zool.\u00a019, 172\u2013189 (1970)","journal-title":"Syst. Zool."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"key":"6_CR11","unstructured":"Kannan, S., Warnow, T., Yooseph, S.: Computing the local consensus of trees. In: Proc. of Symposium on Discrete Algorithms (SODA 1995) (1995)"},{"issue":"1\u20132","key":"6_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M.P. Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Appl. Math.\u00a069(1\u20132), 19\u201331 (1996)","journal-title":"Discrete Appl. Math."},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1\u20133","key":"6_CR14","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\u20133), 147\u2013158 (2000)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79723-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:30:03Z","timestamp":1619523003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_6","relation":{},"subject":[]}}