{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T01:09:12Z","timestamp":1769735352737,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90062-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"249-254","source":"Crossref","is-referenced-by-count":96,"title":["Some MAX SNP-hard results concerning unordered labeled trees"],"prefix":"10.1016","volume":"49","author":[{"given":"Kaizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90062-0_BIB1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SFCS.1992.267823","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(94)90062-0_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(94)90062-0_BIB3","unstructured":"T. Jiang and M. Li, On the approximation of shortest common supersequences and longest common subsequences, Submitted for publication."},{"key":"10.1016\/0020-0190(94)90062-0_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90062-0_BIB5","series-title":"SIAM J. COMPUT","article-title":"Ordered and unordered tree inclusion","author":"Kilpelainen","year":"1991"},{"key":"10.1016\/0020-0190(94)90062-0_BIB6","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."},{"key":"10.1016\/0020-0190(94)90062-0_BIB7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02426925","article-title":"Object representation and recognition using mathematical morphology model","volume":"1","author":"Shih","year":"1991","journal-title":"J. System Integration"},{"key":"10.1016\/0020-0190(94)90062-0_BIB8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/34.23111","article-title":"Threshold decomposition of grayscale morphology into binary morphology","volume":"11","author":"Shih","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"issue":"4","key":"10.1016\/0020-0190(94)90062-0_BIB9","first-page":"309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/0020-0190(94)90062-0_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2116\/analsci.3.23","article-title":"Recognition of largest common structural fragment among a variety of chemical structures","volume":"3","author":"Takahashi","year":"1987","journal-title":"Analytical Sci."},{"issue":"6","key":"10.1016\/0020-0190(94)90062-0_BIB11","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0020-0190(94)90062-0_BIB12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","article-title":"On the editing distance between unordered labeled trees","volume":"42","author":"Zhang","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900620?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900620?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:35Z","timestamp":1555144175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020019094900620"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90062-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}