{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T14:31:23Z","timestamp":1674743483492},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00453-012-9639-1","type":"journal-article","created":{"date-parts":[[2012,4,12]],"date-time":"2012-04-12T20:47:36Z","timestamp":1334263656000},"page":"329-345","source":"Crossref","is-referenced-by-count":5,"title":["Constructing the R* Consensus Tree of Two Trees in Subcubic Time"],"prefix":"10.1007","volume":"66","author":[{"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,13]]},"reference":[{"key":"9639_CR1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-78773-0_7","volume-title":"Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN\u00a02008)","author":"M.S. Bansal","year":"2008","unstructured":"Bansal, M.S., Dong, J., Fern\u00e1ndez-Baca, D.: Comparing and aggregating partially resolved trees. In: Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN\u00a02008). LNCS, vol. 4957, pp. 72\u201383. Springer, Berlin (2008)"},{"key":"9639_CR2","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN\u00a02000)","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics (LATIN\u00a02000). LNCS, vol. 1776, pp. 88\u201394. Springer, Berlin (2000)"},{"key":"9639_CR3","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. 61, pp. 163\u2013184. Am. Math. Soc., Providence (2003)"},{"issue":"4","key":"9639_CR4","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."},{"issue":"11","key":"9639_CR5","doi-asserted-by":"crossref","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 Appl. Math. 158(11), 1136\u20131147 (2010)","journal-title":"Discrete Appl. Math."},{"key":"9639_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/1.9781611973075.15","volume-title":"Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02010)","author":"T.M. Chan","year":"2010","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, Philadelphia (2010)"},{"issue":"1","key":"9639_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"W.H.E. Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2(1), 7\u201328 (1985)","journal-title":"J. Classif."},{"issue":"1","key":"9639_CR8","doi-asserted-by":"crossref","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. Syst. Biol. 58(1), 35\u201354 (2009)","journal-title":"Syst. Biol."},{"key":"9639_CR9","volume-title":"Inferring Phylogenies","author":"J. Felsenstein","year":"2004","unstructured":"Felsenstein, J.: Inferring Phylogenies. Sinauer, Sunderland (2004)"},{"key":"9639_CR10","doi-asserted-by":"crossref","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)"},{"key":"9639_CR11","first-page":"166","volume-title":"Proceedings of the 6th Annual International Conference on Computational Biology (RECOMB\u00a02002)","author":"D. Gusfield","year":"2002","unstructured":"Gusfield, D.: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. In: Proceedings of the 6th Annual International Conference on Computational Biology (RECOMB\u00a02002), pp. 166\u2013175. ACM, New York (2002)"},{"issue":"2","key":"9639_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."},{"key":"9639_CR13","series-title":"LNCS","first-page":"573","volume-title":"Proceedings of the 18th Annual European Symposium on Algorithms (ESA\u00a02010)","author":"J. Jansson","year":"2010","unstructured":"Jansson, J., Sung, W.-K.: Constructing the R* consensus tree of two trees in subcubic time. In: Proceedings of the 18th Annual European Symposium on Algorithms (ESA\u00a02010). LNCS, vol. 6346, pp. 573\u2013584. Springer, Berlin (2010)"},{"issue":"6","key":"9639_CR14","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":"9639_CR15","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":"9639_CR16","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":"9639_CR17","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24\/A. Springer, Berlin (2003)"},{"key":"9639_CR18","unstructured":"Scornavacca, C.: Supertree methods for phylogenomics. PhD thesis, University of Montpellier\u00a0II, France (2009)"},{"key":"9639_CR19","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, Boca Raton (2010)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9639-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:12:00Z","timestamp":1497978720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9639-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,13]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9639"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9639-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,13]]}}}