{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:11:22Z","timestamp":1725495082810},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429852"},{"type":"electronic","value":"9783540456780"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45678-3_62","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T16:12:14Z","timestamp":1195143134000},"page":"731-742","source":"Crossref","is-referenced-by-count":7,"title":["Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian N. S.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B. L. Allen","year":"2001","unstructured":"B. L. Allen and M. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5:1\u201313, 2001.","journal-title":"Annals of Combinatorics"},{"issue":"6","key":"62_CR2","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing, 26(6):1656\u20131669, 1997.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"62_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. P. Brent","year":"1974","unstructured":"R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201\u2013206, Apr. 1974.","journal-title":"Journal of the ACM"},{"key":"62_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-48224-5_12","volume-title":"The complexity of constructing evolutionary trees using experiments","author":"G. S. Brodal","year":"2001","unstructured":"G. S. Brodal, R. Fagerberg, C. N. S. Pedersen, and A. \u00d6stlin. The complexity of constructing evolutionary trees using experiments. In Proc. 28th International Colloquium on Automata, Languages, and Programming, volume 2076 of Lecture Notes in Computer Science, pages 140\u2013151. Springer-Verlag, 2001."},{"key":"62_CR5","unstructured":"D. Bryant, J. Tsang, P. E. Kearney, and M. Li. Computing the quartet distance between evolutionary trees. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 285\u2013286, N. Y., Jan. 9\u201311 2000. ACM Press."},{"key":"62_CR6","unstructured":"P. Buneman. The recovery of trees from measures of dissimilairty. Mathematics in Archeological and Historial Sciences, pages 387\u2013395, 1971."},{"issue":"3","key":"62_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01190506","volume":"13","author":"R. F. Cohen","year":"1995","unstructured":"R. F. Cohen and R. Tamassia. Dynamic expression trees. Algorithmica, 13(3):245\u2013265, 1995.","journal-title":"Algorithmica"},{"issue":"2","key":"62_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2413326","volume":"34","author":"G. Estabrook","year":"1985","unstructured":"G. Estabrook, F. McMorris, and C. Meacham. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst. Zool., 34(2):193\u2013200, 1985.","journal-title":"Syst. Zool."},{"issue":"1\/2","key":"62_CR9","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":"62_CR10","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"62_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/3-540-48523-6_51","volume-title":"Efficient merging, construction, and maintenance of evolutionary trees","author":"A. Lingas","year":"1999","unstructured":"A. Lingas, H. Olsson, and A. \u00d6stlin. Efficient merging, construction, and maintenance of evolutionary trees. In Proc. 26th Int. Colloquium on Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science, pages 544\u2013553. Springer-Verlag, 1999. 732"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"D. F. Robinson and L. R. Foulds. Comparison of weighted labelled trees. In Combinatorial mathematics, VI (Proc. Sixth Austral. Conf., Univ. New England, Armidale, 1978), Lecture Notes in Mathematics, pages 119\u2013126. Springer, Berlin, 1979.","DOI":"10.1007\/BFb0102690"},{"issue":"1\u20132","key":"62_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D. F. Robinson","year":"1981","unstructured":"D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Math. Biosci., 53(1\u20132):131\u2013147, 1981.","journal-title":"Math. Biosci."},{"issue":"2","key":"62_CR14","first-page":"126","volume":"42","author":"M. Steel","year":"1993","unstructured":"M. Steel and D. Penny. Distribution of tree comparison metrics-some new results syst. Syst. Biol., 42(2):126\u2013141, 1993.","journal-title":"Syst. Biol."},{"key":"62_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0030787","volume-title":"Simple and flexible detection of contiguous repeats using a suffix tree","author":"J. Stoye","year":"1998","unstructured":"J. Stoye and D. Gusfield. Simple and flexible detection of contiguous repeats using a suffix tree. In Proc. 9th Annual Symposium on Combinatorial Pattern Matching, volume 1448 of Lecture Notes in Computer Science, pages 140\u2013152. Springer-Verlag, 1998."},{"key":"62_CR16","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/0022-5193(78)90137-6","volume":"73","author":"M. S. Waterman","year":"1978","unstructured":"M. S. Waterman and T. F. Smith. On the similarity of dendrograms. Journal of Theoretical Biology, 73:789\u2013800, 1978.","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45678-3_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T15:23:02Z","timestamp":1551108182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45678-3_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429852","9783540456780"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45678-3_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]}}}