{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:56:00Z","timestamp":1780073760082,"version":"3.54.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["A-8053"],"award-info":[{"award-number":["A-8053"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["A-9207"],"award-info":[{"award-number":["A-9207"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0020-0190(89)90216-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"215-220","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":56,"title":["A fast algorithm for constructing trees from distance matrices"],"prefix":"10.1016","volume":"30","author":[{"given":"Joseph C.","family":"Culberson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Rudnicki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90216-0_BIB1","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1090\/qam\/265210","article-title":"Properties of the distance matrix of a tree","volume":"26","author":"Boesch","year":"1968","journal-title":"Q. Appl. Math."},{"issue":"1","key":"10.1016\/0020-0190(89)90216-0_BIB2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0604006","article-title":"An optimal diagonal tree code","volume":"4","author":"Chaiken","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(89)90216-0_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1090\/qam\/184873","article-title":"Distance matrix of a graph and its realizability","volume":"22","author":"Hakimi","year":"1964","journal-title":"Q. Appl. Math."},{"key":"10.1016\/0020-0190(89)90216-0_BIB4","series-title":"Graphical Evolution","article-title":"Wiley-Interscience Series in Discrete Mathematics","author":"Palmer","year":"1985"},{"key":"10.1016\/0020-0190(89)90216-0_BIB5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1090\/qam\/414405","article-title":"The distance matrix of a graph and its tree realization","volume":"30","author":"Patrinos","year":"1972","journal-title":"Q. Appl. Math."},{"key":"10.1016\/0020-0190(89)90216-0_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(82)90001-5","article-title":"Submatrices of non-tree-realizable distance matrices","volume":"44","author":"Sim\u00f5es-Pereira","year":"1982","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"10.1016\/0020-0190(89)90216-0_BIB7","first-page":"90","article-title":"Postroenie dereva po naboru rasstoiani\u01d0 mezhdu visiatchimi vershinami","volume":"20","author":"Zaretskii\u01d0","year":"1965","journal-title":"Uspehki Mat. Nauk"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089902160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T13:06:26Z","timestamp":1777381586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089902160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0020019089902160"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90216-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast algorithm for constructing trees from distance matrices","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(89)90216-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}