{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:58:43Z","timestamp":1742392723725},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0031-3203(01)00055-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:56:44Z","timestamp":1027591004000},"page":"473-483","source":"Crossref","is-referenced-by-count":17,"title":["Finding approximate patterns in undirected acyclic graphs"],"prefix":"10.1016","volume":"35","author":[{"given":"Jason T.L.","family":"Wang","sequence":"first","affiliation":[]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"George","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(01)00055-3_BIB1","unstructured":"F.A. Akinniyi, A.K.C. Wong, A new product graph based algorithm for subgraph isomorphism, in: Proceedings of the International Conference on Computer Vision and Pattern Recognition (1983) 457\u2013467."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB2","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.211474","article-title":"A linear programming approach for the weighted graph matching problem","volume":"15","author":"Almohamad","year":"1993","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB3","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0031-3203(81)90093-5","article-title":"A subgraph isomorphism algorithm using resolution","volume":"13","author":"Cheng","year":"1981","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TPAMI.1986.4767835","article-title":"An image understanding system using attributed symbolic representation and inexact graph-matching","volume":"8","author":"Eshera","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-8655(83)90042-9","article-title":"A Hough transform technique for subgraph isomorphism","volume":"2","author":"Kasif","year":"1983","journal-title":"Pattern Recognition Lett."},{"issue":"5","key":"10.1016\/S0031-3203(01)00055-3_BIB6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/34.682179","article-title":"A new algorithm for error tolerant subgraph isomorphism detection","volume":"20","author":"Messmer","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"5","key":"10.1016\/S0031-3203(01)00055-3_BIB7","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"3","author":"Shapiro","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"4","key":"10.1016\/S0031-3203(01)00055-3_BIB8","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/21.286387","article-title":"Exact and approximate algorithms for unordered tree matching","volume":"24","author":"Shasha","year":"1994","journal-title":"IEEE Trans. Systems, Man and Cybernet."},{"issue":"5","key":"10.1016\/S0031-3203(01)00055-3_BIB9","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1109\/3477.537320","article-title":"Neural-network approach for solving the maximal common subgraph problem","volume":"26-B","author":"Shoukry","year":"1996","journal-title":"IEEE Trans. Systems, Man, and Cybernet."},{"issue":"12","key":"10.1016\/S0031-3203(01)00055-3_BIB10","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/34.387483","article-title":"A metric between unrooted and unordered trees and its bottom-up computing method","volume":"16","author":"Tanaka","year":"1994","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB11","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","article-title":"Error-correcting isomorphisms of attributed relational graphs for pattern analysis","volume":"12","author":"Tsai","year":"1979","journal-title":"IEEE Trans. Systems, Man and Cybernet."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB12","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/S0031-3203(01)00055-3_BIB13","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\/S0031-3203(01)00055-3_BIB14","series-title":"Communication, Storage and Retrieval of Chem. Inform.","author":"Ash","year":"1985"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB15","series-title":"Chemical Information Systems","author":"Ash","year":"1975"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB16","series-title":"Pattern Discovery in Biomolecular Data: Tools, Techniques, Applications","author":"Wang","year":"1999"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1021\/ci00066a018","article-title":"Substructure search system. 1. Performance comparison of the MACCS, DARC, HTSS, CAS registry MVSSS, and S4 substructure search systems","volume":"30","author":"Hicks","year":"1990","journal-title":"J. Chem. Inform. Comput. Sci."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB18","series-title":"Similarity and Clustering Methods in Chemical Information Systems","author":"Willett","year":"1987"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB19","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1021\/ci00017a008","article-title":"Matching two-dimensional chemical graphs using genetic algorithms","volume":"34","author":"Brown","year":"1994","journal-title":"J. Chem. Inform. Comput. Sci."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB21","series-title":"Concepts and Applications of Molecular Similarity","author":"Johnson","year":"1990"},{"issue":"2","key":"10.1016\/S0031-3203(01)00055-3_BIB22","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1021\/ci990081m","article-title":"Fast similarity search in three-dimensional structure databases","volume":"40","author":"Wang","year":"2000","journal-title":"J. Chem. Inform. Comput. Sci."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB23","series-title":"A pattern matching system for biosequences. Ph.D. Dissertation","author":"Mehldau","year":"1991"},{"issue":"1","key":"10.1016\/S0031-3203(01)00055-3_BIB24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1142\/S0129054196000051","article-title":"On the editing distance between undirected acyclic graphs","volume":"7","author":"Zhang","year":"1996","journal-title":"Int. J. Foundations Comput. Sci."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB25","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Z. Galil, T.H. Spencer, Efficient implementation of graph algorithms using contraction, in: Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, 1984, pp. 347\u2013357.","DOI":"10.1109\/SFCS.1984.715935"},{"issue":"1","key":"10.1016\/S0031-3203(01)00055-3_BIB26","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0031-3203(01)00055-3_BIB27","series-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","first-page":"237","article-title":"An analysis of the general tree-editing problem","author":"Noetzel","year":"1983"},{"issue":"5","key":"10.1016\/S0031-3203(01)00055-3_BIB28","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","article-title":"Faster scaling algorithms for network problems","volume":"18","author":"Gabow","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0031-3203(01)00055-3_BIB29","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1126\/science.257.5073.1078","article-title":"Structure-based strategies for drug design and discovery","volume":"257","author":"Kuntz","year":"1992","journal-title":"Science"},{"issue":"4","key":"10.1016\/S0031-3203(01)00055-3_BIB30","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1109\/69.298173","article-title":"A system for approximate tree matching","volume":"6","author":"Wang","year":"1994","journal-title":"IEEE Trans. Knowledge and Data Eng."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320301000553?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320301000553?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:24:53Z","timestamp":1556893493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320301000553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0031320301000553"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(01)00055-3","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}