{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T13:50:58Z","timestamp":1746193858654,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_51","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"544-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Merging, Construction, and Maintenance of Evolutionary Trees"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Olsson","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,1,18]]},"reference":[{"key":"51_CR1","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:1656\u20131669, 1997.","journal-title":"SIAM Journal on Computing"},{"key":"51_CR2","unstructured":"D. Bryant and M. Steel. Fast algorithms for constructing optimal trees from quartets. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 147\u2013155, 1999."},{"issue":"4","key":"51_CR3","doi-asserted-by":"publisher","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"},{"key":"51_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":"51_CR5","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":"51_CR6","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":"51_CR7","doi-asserted-by":"crossref","unstructured":"M.Y. Kao, A. Lingas, and A. \u00d6stlin. Balanced randomized tree splitting with applications to evolutionary tree constructions. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 184\u2013196, 1999.","DOI":"10.1007\/3-540-49116-3_17"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-1-4615-6781-3_9","volume":"1","author":"C.G. Sibley","year":"1983","unstructured":"C.G. Sibley and J.E. Ahlquist. Phylogeny and classification of birds based on the data of dna-dna-hybridization. Current Ornithology, 1:245\u2013292, 1983.","journal-title":"Current Ornithology"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:09:26Z","timestamp":1642820966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}