{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:24Z","timestamp":1759638024507},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_12","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"140-151","source":"Crossref","is-referenced-by-count":8,"title":["The Complexity of Constructing Evolutionary Trees Using Experiments"],"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"}]},{"given":"Anna","family":"\u00d6stlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-51542-9_33","volume-title":"Proc. 1st Workshop on Algorithms and Data Structures (WADS)","author":"A. Andersson","year":"1989","unstructured":"A. Andersson. Improving partial rebuilding by using simple balance criteria. In Proc. 1st Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 393\u2013402. Springer-Verlag, 1989."},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-52846-6_82","volume-title":"Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT)","author":"A. Andersson","year":"1990","unstructured":"A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT), volume 447 of Lecture Notes in Computer Science, pages 111\u2013121. Springer-Verlag, 1990."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(81)90005-3","volume":"12","author":"A. Borodin","year":"1981","unstructured":"A. Borodin, L. J. Guibas, N. A. Lynch, and A. C. Yao. Efficient searching using partial ordering. Information Processing Letters, 12:71\u201375, 1981.","journal-title":"Information Processing Letters"},{"issue":"4","key":"12_CR4","first-page":"337","volume":"3","author":"G. S. Brodal","year":"1996","unstructured":"G. S. Brodal, S. Chaudhuri, and J. Radhakrishnan. The randomized complexity of maintaining the minimum. Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), 3(4):337\u2013351, 1996.","journal-title":"Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT)"},{"key":"12_CR5","series-title":"Technical Report BRICS-RS-01-1","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. Technical Report BRICS-RS-01-1, BRICS, Department of Computer Science, University of Aarhus, 2001."},{"key":"12_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":"12_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 Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 184\u2013196, 1999.","DOI":"10.1007\/3-540-49116-3_17"},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-48523-6_51","volume-title":"Proc. 26th Int. Colloquium on Automata, Languages and Programming (ICALP)","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 (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 544\u2013553. Springer-Verlag, 1999."},{"key":"12_CR9","doi-asserted-by":"crossref","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:52:19Z","timestamp":1551034339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}