{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:15:24Z","timestamp":1742951724462,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_33","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"414-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Algorithms for Computing the\u00a0R*\u00a0Consensus\u00a0Tree"],"prefix":"10.1007","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]},{"given":"Hoa","family":"Vu","sequence":"additional","affiliation":[]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"48","key":"33_CR1","doi-asserted-by":"publisher","first-page":"6634","DOI":"10.1016\/j.tcs.2011.08.027","volume":"412","author":"MS Bansal","year":"2011","unstructured":"Bansal, M.S., Dong, J., Fern\u00e1ndez-Baca, D.: Comparing and aggregating partially resolved trees. Theoretical Computer Science 412(48), 6634\u20136652 (2011)","journal-title":"Theoretical Computer Science"},{"key":"33_CR2","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":"MA 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. 1776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The Level Ancestor Problem simplified. Theoretical Computer Science 321(1), 5\u201312 (2004)","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","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. 61, pp. 163\u2013184. American Mathematical Society (2003)"},{"issue":"4","key":"33_CR5","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 27(4), 705\u2013732 (2001)","journal-title":"Advances in Applied Mathematics"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M., P\u01cetra\u015fcu, M.: Counting inversions, offline orthogonal range counting, and related problems. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 161\u2013173. SIAM (2010)","DOI":"10.1137\/1.9781611973075.15"},{"issue":"1","key":"33_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1093\/sysbio\/syp008","volume":"58","author":"JH 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 58(1), 35\u201354 (2009)","journal-title":"Systematic Biology"},{"key":"33_CR8","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates Inc., Sunderland (2004)"},{"issue":"2","key":"33_CR9","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 13(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00453-012-9639-1","volume":"66","author":"J Jansson","year":"2013","unstructured":"Jansson, J., Sung, W.-K.: Constructing the R* consensus tree of two trees in subcubic time. Algorithmica 66(2), 329\u2013345 (2013)","journal-title":"Algorithmica"},{"issue":"6","key":"33_CR11","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 27(6), 1695\u20131724 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"33_CR12","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 94(5), 211\u2013216 (2005)","journal-title":"Information Processing Letters"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Sung, W.-K.: Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC (2010)","DOI":"10.1201\/9781420070347"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T14:09:36Z","timestamp":1674742176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}