{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:10:25Z","timestamp":1773274225518,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1009837726913","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"213-225","source":"Crossref","is-referenced-by-count":13,"title":["Fitting Distances by Tree Metrics with Increment Error"],"prefix":"10.1007","volume":"3","author":[{"given":"Bin","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"211429_CR1","unstructured":"R. Agarwala, V. Bafna, M. Farach, B. Narayanan, M. Paterson, and M. Thorup, \u201cOn the approximability of numerical taxonomy,\u201d in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 365-372."},{"key":"211429_CR2","first-page":"101","volume":"1276","author":"K. Atteson","year":"1997","unstructured":"K. Atteson, \u201cThe performance of neighbor-joining algorithms of phylogeny reconstruction,\u201d in Proc. of The 3rd International Conference on Computing and Combinatorics, Shanghai, 1997, Lecture Notes in Computer Sciences, vol. 1276, pp. 101-110.","journal-title":"Proc. of The 3rd International Conference on Computing and Combinatorics"},{"key":"211429_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"H.J. Bandelt","year":"1986","unstructured":"H.J. Bandelt and A. Dress, \u201cReconstructing the shape of a tree from observed dissimilarity data,\u201d Advances in Applied Mathematics, vol. 7, pp. 309-343, 1986.","journal-title":"Advances in Applied Mathematics"},{"issue":"4","key":"211429_CR4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0092-8240(87)80007-1","volume":"49","author":"W.H.E. Day","year":"1987","unstructured":"W.H.E. Day, \u201cComputational complexity of inferring phylogenies from dissimilarity matrices,\u201d Bulletin of Mathematical Biology, vol. 49, no. 4, pp. 461-467, 1987.","journal-title":"Bulletin of Mathematical Biology"},{"key":"211429_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M. Farach","year":"1995","unstructured":"M. Farach, S. Kannan, and T. Warnow, \u201cA robust model for finding optimal evolutionary trees,\u201d Algorithmica, vol. 13, pp. 155-179, 1995.","journal-title":"Algorithmica"},{"key":"211429_CR6","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1086\/282802","volume":"106","author":"J.S. Farris","year":"1972","unstructured":"J.S. Farris, \u201cEstimating phylogenetic trees from distance matrices,\u201d Am. Nat., vol. 106, pp. 645-668, 1972.","journal-title":"Am. Nat."},{"key":"211429_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1086\/412935","volume":"57","author":"J. Felsenstein","year":"1982","unstructured":"J. Felsenstein, \u201cNumerical methods for inferring evolutionary trees,\u201d Quart. Rev. Bio., vol. 57, pp. 379-404, 1982.","journal-title":"Quart. Rev. Bio."},{"key":"211429_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(88)90090-7","volume":"27","author":"M. K\u0159iv\u00e1nek","year":"1988","unstructured":"M. K\u0159iv\u00e1nek, \u201cThe complexity of ultrametric partitions on graphs,\u201d Infor. Proc. Letters, vol. 27, pp. 265-270, 1988.","journal-title":"Infor. Proc. Letters"},{"key":"211429_CR9","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall: Englewood Cliffs, NJ, 1982."},{"key":"211429_CR10","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"N. Saitou and M. Nei, \u201cThe neighbor-joining method: A new method for reconstructing phylogenetic trees,\u201d Mol. Biol. Evol., vol. 4, pp. 406-425, 1987.","journal-title":"Mol. Biol. Evol."},{"key":"211429_CR11","volume-title":"Molecular Systematics","author":"D. Swofford","year":"1996","unstructured":"D. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis, \u201cPhylogenetic inference,\u201d in Molecular Systematics, 2nd edition, D.M. Hillis, C. Moritz, and B.K. Mable (Eds.), Sinauer Associates: Massachusetts, 1996.","edition":"2nd edition"},{"key":"211429_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-5193(77)90351-4","volume":"64","author":"M.S. Waterman","year":"1977","unstructured":"M.S. Waterman, T.F. Smith, M. Singh, and W.A. Beyer, \u201cAdditive evolutionary trees,\u201d J. Theoret. Biol., vol. 64, pp. 199-213, 1977.","journal-title":"J. Theoret. Biol."},{"key":"211429_CR13","doi-asserted-by":"crossref","unstructured":"B.Y. Wu, K.M. Chao, and C.Y. Tang, \u201cApproximation and exact algorithms for constructing minimum ultrametric trees from distance matrices,\u201d in Proc. of the 4th Annual International Conference on Computing and Combinatorics, Taiwan, 1998, pp. 299-308.","DOI":"10.1007\/3-540-68535-9_34"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009837726913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009837726913\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009837726913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:15:49Z","timestamp":1751282149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009837726913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["211429"],"URL":"https:\/\/doi.org\/10.1023\/a:1009837726913","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}