{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:34Z","timestamp":1759638934723,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6225,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00156-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"289-300","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Inferring a tree from walks"],"prefix":"10.1016","volume":"161","author":[{"given":"Osamu","family":"Maruyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00156-5_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00156-5_BIB2","series-title":"Proc. 33rd IEEE Symp. Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/0304-3975(95)00156-5_BIB3","series-title":"Proc. 3rd Workshop on Computational Learning Theory","first-page":"359","article-title":"Inferring graphs from walks","author":"Aslam","year":"1990"},{"key":"10.1016\/0304-3975(95)00156-5_BIB4","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1145\/179812.179818","article-title":"Linear approximation of shortest superstrings","volume":"41","author":"Blum","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00156-5_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","article-title":"On finding minimal length superstrings","volume":"20","author":"Gallant","year":"1980","journal-title":"J. Comput. System Sci."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0304-3975(95)00156-5_BIB6"},{"key":"10.1016\/0304-3975(95)00156-5_BIB7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00156-5_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(92)90084-9","article-title":"A note on shortest superstrings with flipping","volume":"44","author":"Jiang","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00156-5_BIB9","series-title":"Proc. 20th Mathematical Foundations of Computer Science","first-page":"257","article-title":"Graph inference from a walk for trees of bounded degree 3 is NP-complete","volume":"Vol. 969","author":"Maruyama","year":"1995"},{"key":"10.1016\/0304-3975(95)00156-5_BIB10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/0304-3975(95)00156-5_BIB11"},{"key":"10.1016\/0304-3975(95)00156-5_BIB12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/138027.138042","article-title":"The minimum consistent DFA problem cannot be approximated within any polynomial","volume":"40","author":"Pitt","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(95)00156-5_BIB13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/S0022-0000(05)80089-3","article-title":"Bounded degree graph inference from walks","volume":"49","author":"Raghavan","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00156-5_BIB14","series-title":"Proc. 26th IEEE Symp. Foundations of Computer Science","first-page":"321","article-title":"Inferring the structure of a Markov chain from its output","author":"Rudich","year":"1985"},{"key":"10.1016\/0304-3975(95)00156-5_BIB15","article-title":"Approximating minimum common supertrees for complete k-ary trees","volume":"66","author":"Yamaguchi","year":"1993","journal-title":"Tech. Report, Research Institute of Fundamental Information Science, Kyushu University, RIFIS-TR-CS"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001565?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001565?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:17:39Z","timestamp":1757477859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595001565"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00156-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1996,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inferring a tree from walks","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(95)00156-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}