{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:17:56Z","timestamp":1725459476112},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045094","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"274-283","source":"Crossref","is-referenced-by-count":0,"title":["A matrix representation of phylogenetic trees"],"prefix":"10.1007","author":[{"given":"Sanzheng","family":"Qiao","sequence":"first","affiliation":[]},{"given":"W. S-Y","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1111\/j.1558-5646.1967.tb03411.x","volume":"32","author":"L.L. Cavalli-Sforsza","year":"1967","unstructured":"Cavalli-Sforsza, L.L. and A.W.F. Edwards. 1967. Phylogenetic Analysis Models and Estimation Procedures. Evolution, 32, pp.550\u2013570 (also published in Amer. J. Hum. Genet. 19, pp.233\u2013257).","journal-title":"Evolution"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1353\/lan.1986.0115","volume":"62","author":"L.L. Cavalli-Sforsza","year":"1986","unstructured":"Cavalli-Sforsza, L.L. and W. S-Y. Wang. 1986. Spatial Distance and Lexical Replacement. Language, 62, pp.38\u201355.","journal-title":"Language"},{"key":"29_CR3","first-page":"46","volume":"49","author":"W.H.E. Day","year":"1987","unstructured":"Day, W.H.E. 1987. Computational-Complexity of Inferring Phylogenies from Dissimilarity Matrices. Bulletin of Mathematical Biology, 49, pp.46\u2013467.","journal-title":"Bulletin of Mathematical Biology"},{"key":"29_CR4","unstructured":"Felsenstein, J. An Alternating Least Squares Approach to Inferring Phylogenies from Pairwise Distances, Manuscript."},{"issue":"3760","key":"29_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"W. Fitch","year":"1967","unstructured":"Fitch, W. and E. Margoliash. 1967. Construction of Phylogenetic Trees. Science, Vol. 155, No. 3760, pp.279\u2013284.","journal-title":"Science"},{"key":"29_CR6","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. 1979. Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman, New York."},{"issue":"4","key":"29_CR7","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N. and M. Nei. 1987. The Neighbor-joining Method: A New Method for Reconstructing Phylogenetic Trees. Molecular Biology and Evolution, 4(4), pp.406\u2013425.","journal-title":"Molecular Biology and Evolution"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T09:23:52Z","timestamp":1549704232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0045094","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}