{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:11:00Z","timestamp":1725559860639},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281269"},{"type":"electronic","value":"9783540318262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535294_30","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:50:17Z","timestamp":1127814617000},"page":"346-354","source":"Crossref","is-referenced-by-count":0,"title":["A Fast Technique for Constructing Evolutionary Tree with the Application of Compact Sets"],"prefix":"10.1007","author":[{"given":"Kun-Ming","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Weir","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YaoHua","family":"Yang","sequence":"additional","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":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0403001","volume":"3","author":"H.J. Bandelt","year":"1990","unstructured":"Bandelt, H.J.: Recognition of tree metrics. SIAM Journal on Discrete Mathematics\u00a03(1), 1\u20136 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"30_CR2","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1137\/0406041","volume":"6","author":"E. Dahlhaus","year":"1993","unstructured":"Dahlhaus, E.: Fast parallel recognition of ultrametrics and tree metrics. SIAM Journal on Discrete Mathematics\u00a06(4), 523\u2013532 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"30_CR3","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. Journal of Theoretic Biology\u00a0103, 429\u2013438 (1983)","journal-title":"Journal of Theoretic Biology"},{"issue":"4","key":"30_CR4","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 Mathematical Biology\u00a049(4), 461\u2013467 (1987)","journal-title":"Bulletin of Mathematical Biology"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0020-0190(92)90215-H","volume":"44","author":"E. Dekel","year":"1992","unstructured":"Dekel, E., Hu, J., Ouyang, W.: An optimal algorithm for finding compact sets. Information Processing Letters\u00a044, 285\u2013289 (1992)","journal-title":"Information Processing Letters"},{"key":"30_CR6","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":"30_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01733209","volume":"18","author":"W.M. Fitch","year":"1981","unstructured":"Fitch, W.M.: A non-sequential method for constructing trees and hierarchical classifications. Journal of Molecular Evolution\u00a018, 30\u201337 (1981)","journal-title":"Journal of Molecular Evolution"},{"key":"30_CR8","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 problem in phylogency. Journal of theoretic Biology\u00a0107, 471\u2013474 (1984)","journal-title":"Journal of theoretic Biology"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Advances in Applied Mathematics\u00a03, 43\u201349 (1982)","journal-title":"Advances in Applied Mathematics"},{"key":"30_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Fransisco (1979)"},{"key":"30_CR11","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":"30_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0025-5564(82)90027-X","volume":"59","author":"M.D. Henry","year":"1982","unstructured":"Henry, M.D., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences\u00a059, 277\u2013290 (1982)","journal-title":"Mathematical Biosciences"},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0020-0190(96)00017-8","volume":"57","author":"S. Kim","year":"1996","unstructured":"Kim, S.: A note on finding compact sets in graphs represented by an adjacency list. Information Processing Letters\u00a057, 335\u2013338 (1996)","journal-title":"Information Processing Letters"},{"issue":"5","key":"30_CR15","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":"30_CR16","unstructured":"Li, W.H., Graur, D.: Fundamentals of Molecular Evolution. Sinauer Associates (1991)"},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF01990522","volume":"33","author":"C.-K. Liang","year":"1993","unstructured":"Liang, C.-K.: An O(n\n                        2) Algorithm for Finding the Compact Sets of a Graph. BIT\u00a033, 390\u2013395 (1993)","journal-title":"BIT"},{"key":"30_CR18","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":"30_CR19","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 Tree from Distance Matrices. Journal of Combinatorial Optimization\u00a03, 199\u2013211 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535294_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:52:01Z","timestamp":1619491921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535294_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281269","9783540318262"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11535294_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}