{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:39Z","timestamp":1759637859570,"version":"3.30.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"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":[[2000,2]]},"DOI":"10.1016\/s0304-3975(97)00278-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:32:04Z","timestamp":1027596724000},"page":"33-50","source":"Crossref","is-referenced-by-count":37,"title":["On the approximation of largest common subtrees and largest common point sets"],"prefix":"10.1016","volume":"233","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]},{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00278-8_BIB1","unstructured":"T. Akutsu, An RNC algorithm for finding a largest common subtree of two trees, IEICE Trans. Inform. Systems E75-D (1992) 95\u2013101."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB2","unstructured":"T. Akutsu, A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree, IEICE Trans. Fundam. Electron. Comm. Comput. Sci. E76-A (1993) 1488\u20131493."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB3","doi-asserted-by":"crossref","unstructured":"T. Akutsu, M.M. Halld\u00f3rsson, On the approximation of largest common point sets and largest common subtrees, in: Proc. 5th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 405\u2013413.","DOI":"10.1007\/3-540-58325-4_205"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","article-title":"Congruence, similarity, and symmetries of geometric objects","volume":"3","author":"Alt","year":"1988","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0263-7855(84)80060-0","article-title":"Graphical representation of molecules and substructure-search queries in MACCS","volume":"2","author":"Anderson","year":"1984","journal-title":"J. Molecular Graphics"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB7","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Clique is hard to approximate within n1\u2212\u03b5, in: Proc. 37th IEEE Symp. on Foundations of Comput. Sci., 1996, pp. 627\u2013636.","DOI":"10.1109\/SFCS.1996.548522"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB8","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/S009753979223842X","article-title":"On the approximation of shortest common supersequences and longest common subsequences","volume":"24","author":"Jiang","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB9","doi-asserted-by":"crossref","unstructured":"D. Keselman, A. Amir, Maximum agreement of subtree in a set of evolutionary trees \u2013 metrics and efficient algorithms, in: Proc. 35th IEEE Symp. on Foundations of Comput. Sci., 1994, pp. 758\u2013769.","DOI":"10.1109\/SFCS.1994.365717"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB10","doi-asserted-by":"crossref","unstructured":"S. Khanna, R. Motwani, F.F. Yao, Approximation algorithms for the largest common subtree problem, Tech. Rep., Stanford University, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/spe.4380120103","article-title":"Backtrack search algorithms and the maximal common subgraph problem","volume":"12","author":"Mcgregor","year":"1982","journal-title":"Software-Practice Experience"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB13","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","article-title":"An analysis of a good algorithm for the subtree problems","volume":"6","author":"Reyner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB14","doi-asserted-by":"crossref","unstructured":"R.B. Russel, G.J. Barton, Multiple protein sequence alignment from tertiary structure comparison: assignment of global and residue confidence levels, PROTEINS: Structure, Function Genetics 14 (1992) 309\u2013323.","DOI":"10.1002\/prot.340140216"},{"key":"10.1016\/S0304-3975(97)00278-8_BIB15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1021\/ci00047a025","article-title":"Chemical substructure searching","volume":"25","author":"Stobaugh","year":"1985","journal-title":"J. Chem. Inform. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00278-8_BIB16","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\/S0304-3975(97)00278-8_BIB17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1002\/prot.340110107","article-title":"Detection of common three-dimensional substructures in proteins","volume":"11","author":"Vriend","year":"1991","journal-title":"PROTEINS: Structure Function Genetics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002788?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002788?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T18:32:11Z","timestamp":1733250731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397597002788"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00278-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}