{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:04Z","timestamp":1725490444270},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739395"},{"type":"electronic","value":"9783540739401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73940-1_62","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:30:14Z","timestamp":1188307814000},"page":"615-622","source":"Crossref","is-referenced-by-count":0,"title":["3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction"],"prefix":"10.1007","author":[{"given":"Kun-Ming","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5044","key":"62_CR1","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1126\/science.1736360","volume":"255","author":"M.H. David","year":"1992","unstructured":"David, M.H., James, J.B., Mary, E.W., Marty, R.B., Ian, J.M.: Experimental Phylogenetics: Generation of a Known Phlogeny. Science\u00a0255(5044), 589\u2013592 (1992)","journal-title":"Science"},{"key":"62_CR2","unstructured":"Fan, C.T.: The evaluation of evolutionary tree. Master Thesis, National Tsing Hua University (2000)"},{"key":"62_CR3","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":"62_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences, computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences, computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"62_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 algorithm to determine minimal evolutionary trees. Mathematical Biosciences\u00a059, 277\u2013290 (1982)","journal-title":"Mathematical Biosciences"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Janakiram, V.K., Agrawal, D.P., Mehrotra, R.: A randomized parallel branch-and-bound algorithm. In: Proc. Int. Conf. Prallel Process, pp. 69\u201375 (1988)","DOI":"10.1007\/BF02427853"},{"issue":"5","key":"62_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0020-0190(88)90090-7","volume":"27","author":"M. Krivanek","year":"1988","unstructured":"Krivanek, M.: The complexity of ultrametric partitions on graphs. Information Processing Letter\u00a027(5), 265\u2013270 (1988)","journal-title":"Information Processing Letter"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E.L. Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.W.: Branch-and-bound methods: A survey. Oper. Res.\u00a014, 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"62_CR9","unstructured":"Li, W.H.: Molecular Evolution. Sinauer Associates, Inc (1997)"},{"key":"62_CR10","unstructured":"Li, W.H., Graur, D.: Fundamentals of Molecular Evolution. Sinauer Associates (1991)"},{"issue":"5027","key":"62_CR11","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1126\/science.1840702","volume":"253","author":"V. Linda","year":"1991","unstructured":"Linda, V., Mark, S., Henry, H., Kristen, H., Allan, C.W.: African Populations and the Evolution of Human Mitochondrial DNA. Science\u00a0253(5027), 1503\u20131507 (1991)","journal-title":"Science"},{"key":"62_CR12","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 Algorithm for Constructing Minimum Ultrametric Trees from Distance Matrices. J. of Combinatorial Optimization\u00a03, 199\u2013211 (1999)","journal-title":"J. of Combinatorial Optimization"},{"key":"62_CR13","unstructured":"Yu, K.-M., Zhou, J.-Y., Lin, C.-Y., Tang, C.Y.: Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrices. In: IEEE Proceedings of the 8th International Conference on High Performance Computing in Asia Pacific Region, pp. 66\u201372 (2005)"},{"key":"62_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11942634_23","volume-title":"Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops","author":"K.-M. Yu","year":"2006","unstructured":"Yu, K.-M., Zhou, J., Lin, C.-Y., Tang, C.Y.: An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Ruenger, G. (eds.) Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops. LNCS, vol.\u00a04331, pp. 215\u2013220. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73940-1_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:17:20Z","timestamp":1605763040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73940-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739395","9783540739401"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73940-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}