{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:01Z","timestamp":1725563701675},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_49","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"573-584","source":"Crossref","is-referenced-by-count":1,"title":["Constructing the R* Consensus Tree of Two Trees in Subcubic Time"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"49_CR2","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1090\/dimacs\/061\/11","volume-title":"Bioconsensus","author":"D. Bryant","year":"2003","unstructured":"Bryant, D.: A classification of consensus methods for phylogenetics. In: Janowitz, M.F., Lapointe, F.-J., McMorris, F.R., Mirkin, B., Roberts, F.S. (eds.) Bioconsensus. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a061, pp. 163\u2013184. American Mathematical Society, Providence (2003)"},{"issue":"4","key":"49_CR3","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1006\/aama.2001.0758","volume":"27","author":"D. Bryant","year":"2001","unstructured":"Bryant, D., Berry, V.: A structured family of clustering and tree construction methods. Advances in Applied Mathematics\u00a027(4), 705\u2013732 (2001)","journal-title":"Advances in Applied Mathematics"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1093\/sysbio\/syp008","volume":"58","author":"J.H. Degnan","year":"2009","unstructured":"Degnan, J.H., DeGiorgio, M., Bryant, D., Rosenberg, N.A.: Properties of consensus methods for inferring species trees from gene trees. Systematic Biology\u00a058(1), 35\u201354 (2009)","journal-title":"Systematic Biology"},{"key":"49_CR5","volume-title":"Inferring Phylogenies","author":"J. Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)"},{"key":"49_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"49_CR8","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1137\/S0097539795287642","volume":"27","author":"S. Kannan","year":"1998","unstructured":"Kannan, S., Warnow, T., Yooseph, S.: Computing the local consensus of trees. SIAM Journal on Computing\u00a027(6), 1695\u20131724 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"49_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ipl.2005.02.005","volume":"94","author":"C.-M. Lee","year":"2005","unstructured":"Lee, C.-M., Hung, L.-J., Chang, M.-S., Shen, C.-B., Tang, C.-Y.: An improved algorithm for the maximum agreement subtree problem. Information Processing Letters\u00a094(5), 211\u2013216 (2005)","journal-title":"Information Processing Letters"},{"issue":"2","key":"49_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1111\/j.1467-968X.2005.00149.x","volume":"103","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., Warnow, T., Ringe, D., Evans, S.N.: A comparison of phylogenetic reconstruction methods on an Indo-European dataset. Transactions of the Philological Society\u00a0103(2), 171\u2013192 (2005)","journal-title":"Transactions of the Philological Society"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T13:51:02Z","timestamp":1553003462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}