{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:01:16Z","timestamp":1726520476446},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00250-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"489-503","source":"Crossref","is-referenced-by-count":27,"title":["Reconstructing minimal rooted trees"],"prefix":"10.1016","volume":"127","author":[{"given":"Charles","family":"Semple","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(02)00250-0_BIB1","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","article-title":"Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions","volume":"10","author":"Aho","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00250-0_BIB2","unstructured":"D. Bryant, Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis, Ph.D. Thesis, University of Canterbury, 1997."},{"key":"10.1016\/S0166-218X(02)00250-0_BIB3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1006\/aama.1995.1020","article-title":"Extension operations on sets of leaf-labelled trees","volume":"16","author":"Bryant","year":"1995","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00250-0_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01202270","article-title":"An efficient algorithm for supertrees","volume":"12","author":"Constantinescu","year":"1995","journal-title":"J. Classif."},{"key":"10.1016\/S0166-218X(02)00250-0_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00009268","article-title":"Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology","volume":"24","author":"Henzinger","year":"1999","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(02)00250-0_BIB6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","article-title":"Reconstruction of rooted trees from subtrees","volume":"69","author":"Ng","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00250-0_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02618470","article-title":"The complexity of reconstructing trees from qualitative characters and subtrees","volume":"9","author":"Steel","year":"1992","journal-title":"J. Classif."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002500?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:23:08Z","timestamp":1555140188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02002500"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00250-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}