{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:11Z","timestamp":1725559151874},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_65","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T14:15:37Z","timestamp":1279030537000},"page":"754-765","source":"Crossref","is-referenced-by-count":4,"title":["An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees"],"prefix":"10.1007","author":[{"given":"Zeshan","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hingfung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"65_CR1","doi-asserted-by":"publisher","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(nlogn) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing\u00a030(5), 1385\u20131404 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"65_CR2","doi-asserted-by":"crossref","unstructured":"Farach, M., Throup, 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":"65_CR3","doi-asserted-by":"crossref","unstructured":"Farach, M., Throup, 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":"65_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C. Finden","year":"1985","unstructured":"Finden, C., Gordan, A.: Obtaining common pruned trees. Journal of Classification\u00a02, 255\u2013276 (1985)","journal-title":"Journal of Classification"},{"key":"65_CR5","doi-asserted-by":"publisher","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\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"key":"65_CR6","unstructured":"Kannan, S., Lawler, E.L., Warnow, T.: Determining the evolutionary tree. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 475\u2013484 (1990)"},{"key":"65_CR7","doi-asserted-by":"publisher","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 Journal on Computing\u00a027, 1592\u20131616 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"65_CR8","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: Proceddings of the 7th Annual European Symposium on Algorithms, pp. 438\u2013449 (1999)","DOI":"10.1007\/3-540-48481-7_38"},{"issue":"2","key":"65_CR9","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a020(2), 212\u2013233 (2001)","journal-title":"Journal of Algorithms"},{"key":"65_CR10","doi-asserted-by":"crossref","unstructured":"Keselman, D., Amir, A.: Maximum agreement subtree in a set of evolutionary trees\u2013 metrics 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":"65_CR11","doi-asserted-by":"publisher","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. Journal of Classification\u00a012, 91\u201399 (1995)","journal-title":"Journal of Classification"},{"issue":"2","key":"65_CR12","doi-asserted-by":"publisher","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. Information Processing Letters\u00a048(2), 77\u201382 (1994)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:31Z","timestamp":1605741691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}