{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:56:34Z","timestamp":1725472594775},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540498605"},{"type":"electronic","value":"9783540498629"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11942634_23","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T18:43:11Z","timestamp":1163616191000},"page":"215-220","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR"],"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":[{"key":"23_CR1","volume-title":"Introduction to Algorithm","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm. MIT Press, Cambridge (1990)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0022-5193(83)90296-5","volume":"103","author":"W.H.E. Day","year":"1983","unstructured":"Day, W.H.E.: Computationally difficult parsimony problems in phylogenetic systematics. J. Theoretic Biol.\u00a0103, 429\u2013438 (1983)","journal-title":"J. Theoretic Biol."},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF02458863","volume":"49","author":"W.H.E. Day","year":"1987","unstructured":"Day, W.H.E.: Computational complexity of inferring phylogenies from dissimilarity matrices. Bulletin of Math. Biol.\u00a049, 461\u2013467 (1987)","journal-title":"Bulletin of Math. Biol."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0025-5564(86)90161-6","volume":"81","author":"W.H.E. Day","year":"1986","unstructured":"Day, W.H.E., Johnson, D.S., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci.\u00a081, 33\u201342 (1986)","journal-title":"Math. Biosci."},{"key":"23_CR5","unstructured":"Fan, C.T.: The evaluation model of evolutionary tree. Master Thesis, Nationa Tsing Hua University (2000)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0022-5193(84)80103-4","volume":"107","author":"L.R. Foulds","year":"1984","unstructured":"Foulds, L.R.: Maximum savings in the Steiner problemin phylogeny. J. Theoretic Biol.\u00a0107, 471\u2013474 (1984)","journal-title":"J. Theoretic Biol."},{"key":"23_CR7","doi-asserted-by":"publisher","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":"23_CR8","first-page":"277","volume":"59","author":"M.D. Hendy","year":"1982","unstructured":"Hendy, M.D., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Math. Biol.\u00a059, 277\u2013290 (1982)","journal-title":"Math. Biol."},{"key":"23_CR9","first-page":"189","volume":"10","author":"S. Kumer","year":"1994","unstructured":"Kumer, S., Tamura, K., Nei, M.: MEGA: Molecular Evolutionary Genetics Analysis software for miceocomputers. Comput. Appl. Biosci.\u00a010, 189\u2013191 (1994)","journal-title":"Comput. Appl. Biosci."},{"key":"23_CR10","unstructured":"Li, W.H.: Molecular Evolution. Sinauer Associates (1997)"},{"key":"23_CR11","first-page":"357","volume":"12","author":"R.D.M. Page","year":"1996","unstructured":"Page, R.D.M.: TreeView: An application to display phylogenetic trees on personal computers. Comput. Appl. Biosci.\u00a012, 357\u2013358 (1996)","journal-title":"Comput. Appl. Biosci."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1126\/science.1840702","volume":"253","author":"L. Vigilant","year":"1991","unstructured":"Vigilant, L., Stoneking, M., Harpending, H., Hawkes, K., Wilson, A.C.: African Populations and the Evolution of Human Mitochondrial DNA. Science\u00a0253, 1503\u20131507 (1991)","journal-title":"Science"},{"key":"23_CR13","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. J. Combinatorial Optimization\u00a03, 199\u2013211 (1999)","journal-title":"J. Combinatorial Optimization"},{"key":"23_CR14","first-page":"1342","volume":"14","author":"C.F. Yu","year":"1988","unstructured":"Yu, C.F., Wah, B.W.: Efficient Branch-and-Bound Algorithms on a Two-Level Memory System. IEEE Trans. Parallel and Distributed Systems\u00a014, 1342\u20131356 (1988)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Frontiers of High Performance Computing and Networking \u2013 ISPA 2006 Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11942634_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:01:18Z","timestamp":1558270878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11942634_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540498605","9783540498629"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11942634_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}