{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T04:24:43Z","timestamp":1662179083151},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T00:00:00Z","timestamp":1192579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00453-007-9084-8","type":"journal-article","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:51:01Z","timestamp":1192546261000},"page":"369-385","source":"Crossref","is-referenced-by-count":3,"title":["From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time"],"prefix":"10.1007","volume":"50","author":[{"given":"V.","family":"Berry","sequence":"first","affiliation":[]},{"given":"Z. S.","family":"Peng","sequence":"additional","affiliation":[]},{"given":"H. F.","family":"Ting","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,17]]},"reference":[{"key":"9084_CR1","doi-asserted-by":"crossref","unstructured":"Amenta, K., Clarke, F.: A linear-time majority tree algorithm. In: Proceedings of the 3rd International Workshop on Algorithms in Bioinformatics, pp. 216\u2013227 (2003)","DOI":"10.1007\/978-3-540-39763-2_17"},{"key":"9084_CR2","doi-asserted-by":"crossref","unstructured":"Berger-Wolf, T.Y.: Online consensus and agreement of phylogenetic trees. In: Proceedings of the 4th International Workshop on Algorithms in Bioinformatics, pp. 350\u2013361 (2004)","DOI":"10.1007\/978-3-540-30219-3_30"},{"issue":"5","key":"9084_CR3","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R., Farach, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(nlog\u2009n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput. 30(5), 1385\u20131404 (2000)","journal-title":"SIAM J. Comput."},{"key":"9084_CR4","unstructured":"Dong, S., Kraemer, E.: Calculation, visualization and manipulation of MASTs (maximum agreement subtrees). In: Proceedings of the IEEE Computational Systems Bioinformatics Conference, pp. 1\u201310 (2004)"},{"key":"9084_CR5","doi-asserted-by":"crossref","unstructured":"Farach, M., Thorup, M.: Optimal evolutionary tree comparison by sparse dynamic programming. In: Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 770\u2013779 (1994)","DOI":"10.1109\/SFCS.1994.365716"},{"key":"9084_CR6","doi-asserted-by":"crossref","unstructured":"Farach, M., Thorup, M.: Fast comparison of evolutionary trees. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 481\u2013488 (1995)","DOI":"10.1006\/inco.1995.1155"},{"key":"9084_CR7","doi-asserted-by":"crossref","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 21, 19\u201328 (1991)","journal-title":"Networks"},{"key":"9084_CR8","doi-asserted-by":"crossref","first-page":"1592","DOI":"10.1137\/S0097539795283504","volume":"27","author":"M.Y. Kao","year":"1998","unstructured":"Kao, M.Y.: Tree contractions and evolutionary trees. SIAM J. Comput. 27, 1592\u20131616 (1998)","journal-title":"SIAM J. Comput."},{"key":"9084_CR9","doi-asserted-by":"crossref","unstructured":"Kao, M.Y., Lam, T.W., Sung, W.K., Ting, H.F.: A decomposition theorem for maximum weight bipartite matchings with applications in evolution trees. In: Proceedings of the 7th Annual European Symposium on Algorithms, pp. 438\u2013449 (1999)","DOI":"10.1007\/3-540-48481-7_38"},{"issue":"2","key":"9084_CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/jagm.2001.1163","volume":"20","author":"M.Y. Kao","year":"2001","unstructured":"Kao, M.Y., Lam, T.W., Sung, W.K., Ting, H.F.: An even faster and more unifying algorithm comparing trees via unbalanced bipartite matchings. J. Algorithms 20(2), 212\u2013233 (2001)","journal-title":"J. Algorithms"},{"key":"9084_CR11","doi-asserted-by":"crossref","unstructured":"Keselman, D., Amir, A.: Maximum agreement subtree in a set of evolutionary trees\u2014metrics and efficient algorithms. In: Proceedings of 35th Annual Symposium on the Foundations of Computer Sciences, pp. 758\u2013769 (1994)","DOI":"10.1109\/SFCS.1994.365717"},{"key":"9084_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01202269","volume":"12","author":"E. Kubicka","year":"1995","unstructured":"Kubicka, E., Kubicki, G., McMorris, F.: An algorithm to find agreement subtrees. J. Classif. 12, 91\u201399 (1995)","journal-title":"J. Classif."},{"key":"9084_CR13","doi-asserted-by":"crossref","unstructured":"Messmark, A., Jansson, J., Lingas, A., Lundell, E.: Polynomial-time algorithms for the ordered maximum agreement subtree problem. In: Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pp. 220\u2013229 (2004)","DOI":"10.1007\/978-3-540-27801-6_16"},{"key":"9084_CR14","doi-asserted-by":"crossref","unstructured":"Peng, Z.S., Ting, H.F.: An O(nlog\u2009n)-time algorithm for the maximum constrained agreement subtree problem for binary trees. In: Proceedings of the 15th Symposium on Algorithms and Computations, pp. 754\u2013765 (2004)","DOI":"10.1007\/978-3-540-30551-4_65"},{"key":"9084_CR15","doi-asserted-by":"crossref","unstructured":"Przytycka, T.: Sparse dynamic programming for maximum agreement subtree problem. In: Mathematical Hierarchies and Biology. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 249\u2013264 (1997)","DOI":"10.1090\/dimacs\/037\/17"},{"issue":"2","key":"9084_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M. Steel","year":"1994","unstructured":"Steel, M., Warnow, T.: Kaikoura tree theorems: computing the maximum agreement subtree. Inf. Process. Lett. 48(2), 77\u201382 (1994)","journal-title":"Inf. Process. Lett."},{"key":"9084_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511817106","volume-title":"The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities","author":"J.M. Steele","year":"2004","unstructured":"Steele, J.M.: The Cauchy-Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"9084_CR18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1006\/jagm.1994.1018","volume":"16","author":"T.J. Warnow","year":"1994","unstructured":"Warnow, T.J.: Tree compatibility and inferring evolutionary history. J. Algorithms 16(3), 388\u2013407 (1994)","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9084-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9084-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9084-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9084-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9084"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9084-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,17]]}}}