{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:04:11Z","timestamp":1648580651915},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T00:00:00Z","timestamp":1453852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s00453-016-0122-2","type":"journal-article","created":{"date-parts":[[2016,1,27]],"date-time":"2016-01-27T19:36:17Z","timestamp":1453923377000},"page":"1224-1244","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithms for Computing the R* Consensus Tree"],"prefix":"10.1007","volume":"76","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoa","family":"Vu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siu-Ming","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,27]]},"reference":[{"issue":"48","key":"122_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 412(48), 6634\u20136652 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"122_CR2","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN 2000). Volume 1776 of LNCS, pp. 88\u201394. Springer, Berlin (2000)","DOI":"10.1007\/10719839_9"},{"issue":"1","key":"122_CR3","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"122_CR4","doi-asserted-by":"crossref","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, Volume\u00a061 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 163\u2013184. American Mathematical Society (2003)","DOI":"10.1090\/dimacs\/061\/11"},{"issue":"4","key":"122_CR5","doi-asserted-by":"crossref","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. Adv. Appl. Math. 27(4), 705\u2013732 (2001)","journal-title":"Adv. Appl. Math."},{"key":"122_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\u00a02010), pp. 161\u2013173. SIAM (2010)","DOI":"10.1137\/1.9781611973075.15"},{"issue":"5","key":"122_CR7","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An $${O}(n \\log n)$$ O ( n log n ) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput. 30(5), 1385\u20131404 (2000)","journal-title":"SIAM J. Comput."},{"key":"122_CR8","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge, MA (1990)"},{"issue":"1","key":"122_CR9","doi-asserted-by":"crossref","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. Syst. Biol. 58(1), 35\u201354 (2009)","journal-title":"Syst. Biol."},{"key":"122_CR10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1186\/1471-2148-8-118","volume":"8","author":"GB Ewing","year":"2008","unstructured":"Ewing, G.B., Ebersberger, I., Schmidt, H.A., von Haeseler, A.: Rooted triple consensus and anomalous gene trees. BMC Evol. Biol. 8, 118 (2008)","journal-title":"BMC Evol. Biol."},{"key":"122_CR11","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer Associates Inc, Sunderland, MA (2004)"},{"issue":"2","key":"122_CR12","doi-asserted-by":"crossref","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 J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"122_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"issue":"2","key":"122_CR14","doi-asserted-by":"crossref","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":"122_CR15","doi-asserted-by":"crossref","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 J. Comput. 27(6), 1695\u20131724 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"122_CR16","doi-asserted-by":"crossref","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. Inf. Process. Lett. 94(5), 211\u2013216 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"122_CR17","first-page":"239","volume":"43","author":"T Margush","year":"1981","unstructured":"Margush, T., McMorris, F.R.: Consensus $$n$$ n -trees. Bull. Math. Biol. 43(2), 239\u2013244 (1981)","journal-title":"Bull. Math. Biol."},{"issue":"2","key":"122_CR18","doi-asserted-by":"crossref","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. Trans. Philol. Soc. 103(2), 171\u2013192 (2005)","journal-title":"Trans. Philol. Soc."},{"key":"122_CR19","unstructured":"Semple, C., Steel, M.: Phylogenetics, Volume\u00a024 of Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2003)"},{"key":"122_CR20","volume-title":"Algorithms in Bioinformatics: A Practical Introduction","author":"W-K Sung","year":"2010","unstructured":"Sung, W.-K.: Algorithms in Bioinformatics: A Practical Introduction. Chapman & Hall\/CRC, London (2010)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0122-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0122-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0122-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0122-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:23Z","timestamp":1559087243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0122-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,27]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0122-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,27]]}}}