{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T21:37:33Z","timestamp":1773869853749,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00128-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:55Z","timestamp":1027594555000},"page":"215-233","source":"Crossref","is-referenced-by-count":18,"title":["Retractions of finite distance functions onto tree metrics"],"prefix":"10.1016","volume":"91","author":[{"given":"Vincent","family":"Moulton","sequence":"first","affiliation":[]},{"given":"Mike","family":"Steel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00128-0_BIB1","series-title":"Proc.3rd Ann. Int. Comput. Combinatorics Conf.","first-page":"101","article-title":"The performance of neighbor-joining algorithms of phylogeny reconstruction","author":"Atteson","year":"1997"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0403001","article-title":"Recognition of tree metrics","volume":"3","author":"Bandelt","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","article-title":"Reconstructing the shape of a tree from observed dissimilarity data","volume":"7","author":"Bandelt","year":"1986","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0001-8708(92)90061-O","article-title":"A canonical decomposition theory for metrics on a finite set","volume":"92","author":"Bandelt","year":"1992","journal-title":"Adv. Math."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/1055-7903(92)90021-8","article-title":"A new and useful approach to phylogenetic analysis of distance data","volume":"1","author":"Bandelt","year":"1992","journal-title":"Mol. Phyl. Evol."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB6","series-title":"Group Theory from a Geometrical Viewpoint","first-page":"64","article-title":"Notes on Gromov's hyperbolicity criterion for path-metric spaces","author":"Bowditch","year":"1991"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB7","article-title":"A polynomial time algorithm for constructing the refined Buneman tree","author":"Bryant","year":"1998","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB8","series-title":"Mathematics in the Archaeological and Historical Sciences","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"Buneman","year":"1971"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0166-218X(96)00059-5","article-title":"Analyzing and visualizing sequence and distance data using SplitsTree","volume":"71","author":"Dress","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB10","first-page":"161","article-title":"T-Theory-an overview","volume":"17","author":"Dress","year":"1996"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB11","doi-asserted-by":"crossref","unstructured":"M. Farach, S. Kannan, Efficient algorithms for inverting evolution, Proc. 1996 ACM Symp. on the Foundations of Computer Science.","DOI":"10.1145\/237814.237868"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB12","series-title":"Essays in Group Theory","first-page":"75","article-title":"Hyperbolic Groups","volume":"vol. 8","author":"Gromov","year":"1987"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230210104","article-title":"Efficient algorithms for inferring evolutionary trees","volume":"21","author":"Gusfield","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB14","article-title":"Molecular Systematics","author":"Hillis","year":"1996"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1093\/comjnl\/11.2.177","article-title":"The construction of hierarchic and non-hierarchic classifications","volume":"11","author":"Jardine","year":"1968","journal-title":"Comput. J."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB16","first-page":"605","article-title":"Recovering evolutionary trees under a more realistic model of sequence evolution","volume":"11","author":"Lockhart","year":"1994","journal-title":"Mol. Biol. Evol."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB17","first-page":"119","article-title":"Comparison of weighted labelled trees","volume":"vol. 748","author":"Robinson","year":"1979"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB18","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0041-5553(63)90418-X","article-title":"A method for linear recording of graphs","volume":"2","author":"Smolensky","year":"1969","journal-title":"USSR Comput. Math. Phys."},{"key":"10.1016\/S0166-218X(98)00128-0_BIB19","series-title":"Proc. 13th Conf. of the Gesellschaft f\u00fcr Klasification","article-title":"On properties of additive tree algorithms. Conceptual and Numerical Analysis of Data","author":"Wolf","year":"1989"},{"key":"10.1016\/S0166-218X(98)00128-0_BIB20","first-page":"90","article-title":"Reconstruction of a tree from the distances between its pendant vertices","volume":"20","author":"Zaretsky","year":"1965","journal-title":"Uspekhi Math. Nauk. Russian Mathematical Surveys"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:30:16Z","timestamp":1556382616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001280"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00128-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}