{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:25:24Z","timestamp":1753889124103},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_17","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"184-196","source":"Crossref","is-referenced-by-count":6,"title":["Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions"],"prefix":"10.1007","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"\u00d6stlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(89)90216-0","volume":"30","author":"J. C. Culbertson","year":"1989","unstructured":"J. C. Culbertson and P. Rudnicki. A fast algorithm for constructing trees from distance matrices. Information Processing Letters, 30(4):215\u2013220, 1989.","journal-title":"Information Processing Letters"},{"issue":"1\/2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M. Farach","year":"1995","unstructured":"M. Farach, S. Kannan, and T. J. Warnow. A robust model for finding optimal evolutionary trees. Algorithmica, 13(1\/2):155\u2013179, 1995.","journal-title":"Algorithmica"},{"key":"17_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-60313-1_157","volume-title":"Proceedings of the Third Annual European Symposium on Algorithms","author":"M. Farach","year":"1995","unstructured":"M. Farach, T. M. Przytycka, and M. Thorup. Computing the agreement of trees with bounded degrees. In P. Spirakis, editor, Lecture Notes in Computer Science 979: Proceedings of the Third Annual European Symposium on Algorithms, pages 381\u2013393. Springer-Verlag, New York, NY, 1995."},{"key":"17_CR4","unstructured":"M. Farach and M. Thorup. Fast comparison of evolutionary trees (extended abstract). In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481\u2013488, 1994."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C. R. Finden","year":"1985","unstructured":"C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255\u2013276, 1985.","journal-title":"Journal of Classification"},{"key":"17_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0045080","volume-title":"Proceedings of the 3rd Annual International Computing and Combinatorics Conference","author":"L. Gasieniec","year":"1997","unstructured":"L. Gasieniec, J. Jansson, A. Lingas, and A. \u00d6stlin. On the complexity of computing evolutionary trees. In Lecture Notes in Computer Science 1276: Proceedings of the 3rd Annual International Computing and Combinatorics Conference, pages 134\u2013145, 1997."},{"key":"17_CR7","unstructured":"M. R. Henzinger, V. King, and T. J. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational biology. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 333\u2013340, 1996."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/jagm.1996.0035","volume":"21","author":"S. K. Kannan","year":"1996","unstructured":"S. K. Kannan, E. L. Lawler, and T. J. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21:26\u201350, 1996.","journal-title":"Journal of Algorithms"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"M. Y. Kao. Tree contractions and evolutionary trees. SIAM Journal on Computing, 1998. To appear.","DOI":"10.1137\/S0097539795283504"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"M. Y. Kao, T. W. Lam, T. M. Przytycka, W. K. Sung, and H. F. Ting. General techniques for comparing unrooted evolutionary trees. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 54\u201365, 1997.","DOI":"10.1145\/258533.258550"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"D. Keselman and A. Amir. Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms. In Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pages 758\u2013769, 1994. To appear in SIAM Journal on Computing.","DOI":"10.1109\/SFCS.1994.365717"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"C. Phillips and T. J. Warnow. The asymmetric median tree-a new model for building consensus trees. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, pages 234\u2013252, 1996.","DOI":"10.1007\/3-540-61258-0_18"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M. Steel","year":"1993","unstructured":"M. Steel and T. J. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48:77\u201382, 1993.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T23:44:48Z","timestamp":1550792688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}