{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T13:16:44Z","timestamp":1774876604058,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540241317","type":"print"},{"value":"9783540305514","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_26","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"282-293","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem"],"prefix":"10.1007","author":[{"given":"Hsin-Fu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maw-Shang","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","volume":"35","author":"S.R. Arikati","year":"1990","unstructured":"Arikati, S.R., Rangan, C.P.: Linear algorithm for optimal path cover problem on interval graphs, Inform. Process. Lett.\u00a035, 149\u2013153 (1990)","journal-title":"Process. Lett."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Li, M., Ma, B.: Chain letters and evolutionary histories, pp. 76\u201381. Scientific American (2003)","DOI":"10.1038\/scientificamerican0603-76"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences\u00a038, 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M. Farach","year":"1995","unstructured":"Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. Algorithmica\u00a013, 155\u2013179 (1995)","journal-title":"Algorithmica"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0025-5564(82)90027-X","volume":"59","author":"M.D. Hendy","year":"1982","unstructured":"Hendy, M.D., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences\u00a059, 277\u2013290 (1982)","journal-title":"Mathematical Biosciences"},{"key":"26_CR6","unstructured":"Huang, C.-M., Yang, C.-B.: Approximation algorithms for constructing evolutionary trees. In: Proceedings of 2001 National Computer Symposium, Taipei, Taiwan, pp. 99\u2013109 (2001)"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.2307\/2406046","volume":"11","author":"C.D. Michener","year":"1957","unstructured":"Michener, C.D., Sokal, R.R.: A quantitative approach to a problem in classification. Evolution\u00a011, 130\u2013162 (1957)","journal-title":"Evolution"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0169-5347(92)90244-6","volume":"7","author":"D. Penny","year":"1992","unstructured":"Penny, D., Hendy, M.D., Steel, M.A.: Progress with methods for constructing evolutionary trees. Trends in Ecology and Evolution\u00a07, 73\u201379 (1992)","journal-title":"Trends in Ecology and Evolution"},{"key":"26_CR9","unstructured":"Setubal, J., Meidanis, J.: Introduction to computational molecular biology. PWS Publishing Company (1997)"},{"key":"26_CR10","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology and Evolution"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1009885610075","volume":"3","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Chao, K.-M., Tang, C.Y.: Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices. Journal of Combinatorial Optimization\u00a03, 199\u2013211 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T01:16:50Z","timestamp":1676078210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}