{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T06:10:58Z","timestamp":1782108658414,"version":"3.54.5"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)80029-9","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T20:07:09Z","timestamp":1306872429000},"page":"137-148","source":"Crossref","is-referenced-by-count":121,"title":["Alignment of trees \u2014 an alternative to tree edit"],"prefix":"10.1016","volume":"143","author":[{"given":"Tao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)80029-9_BIB1","series-title":"Proof verification and hardness of approximation problems","first-page":"14","author":"Arora","year":"1992"},{"key":"10.1016\/0304-3975(95)80029-9_BIB2","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)80029-9_BIB3","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\/0304-3975(95)80029-9_BIB4","series-title":"Ordered and unordered tree inclusion","author":"Kilpelainen","year":"1991"},{"key":"10.1016\/0304-3975(95)80029-9_BIB5_1","unstructured":"SIAM J. Comput., to appear."},{"key":"10.1016\/0304-3975(95)80029-9_BIB5_2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0010-4809(89)90039-6","article-title":"Tree graphs of RNA secondary structures and their comparisons","volume":"22","author":"Le","year":"1989","journal-title":"Comput. Biomed. Res."},{"key":"10.1016\/0304-3975(95)80029-9_BIB6","first-page":"205","article-title":"RNA secondary structures: comparison and determination of frequently recurring substructures by consensus","volume":"5","author":"Le","year":"1989","journal-title":"Comp. Appl. Biosci."},{"key":"10.1016\/0304-3975(95)80029-9_BIB7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","article-title":"A tree-tree distance and its application to cluster analysis","volume":"1","author":"Lu","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0304-3975(95)80029-9_BIB8","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\/0304-3975(95)80029-9_BIB9","year":"1983"},{"key":"10.1016\/0304-3975(95)80029-9_BIB10","first-page":"387","article-title":"An algorithm for comparing multiple RNA secondary structures","author":"Shapiro","year":"1988","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/0304-3975(95)80029-9_BIB11","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\/0304-3975(95)80029-9_BIB12","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\/0304-3975(95)80029-9_BIB13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/34.23111","article-title":"Threshold decomposition of grayscale morphology into binary morphology","volume":"PAMI-11","author":"Shih","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0304-3975(95)80029-9_BIB14","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","article-title":"The tree-to-tree correction problem","volume":"26","author":"Tai","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)80029-9_BIB15","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":"Analyt. Sci."},{"key":"10.1016\/0304-3975(95)80029-9_BIB16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","article-title":"Some MAX SNP-hard results concerning unordered labeled trees","volume":"49","author":"Zhang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)80029-9_BIB17","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\/0304-3975(95)80029-9_BIB18","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T11:56:19Z","timestamp":1543751779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595800299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397595800299"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)80029-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}