{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:17:32Z","timestamp":1779175052824,"version":"3.51.4"},"reference-count":15,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9065,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1982,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Backtrack algorithms are applicable to a wide variety of problems. An efficient but readable version of such an algorithm is presented and its use in the problem of finding the maximal common subgraph of two graphs is described. Techniques available in this application area for ordering and pruning the backtrack search are discussed. This algorithm has been used successfully as a component of a program for analysing chemical reactions and enumerating the bond changes which have taken place.<\/jats:p>","DOI":"10.1002\/spe.4380120103","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:19:20Z","timestamp":1163765960000},"page":"23-34","source":"Crossref","is-referenced-by-count":201,"title":["Backtrack search algorithms and the maximal common subgraph problem"],"prefix":"10.1002","volume":"12","author":[{"given":"James J.","family":"McGregor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0160-9327(68)90097-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1021\/c160016a007"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1021\/bk-1977-0046.ch001"},{"issue":"3","key":"e_1_2_1_5_2","doi-asserted-by":"crossref","DOI":"10.1021\/ci60015a009","article-title":"The automatic detection of chemical reaction sites","volume":"18","author":"Lynch M. F.","year":"1978","journal-title":"J. Chem. Inf. Comp. Sci."},{"issue":"3","key":"e_1_2_1_6_2","doi-asserted-by":"crossref","DOI":"10.1021\/ci00031a005","article-title":"Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions","volume":"21","author":"McGregor J. J.","year":"1981","journal-title":"J. Chem. Inf. Comp. Sci."},{"key":"e_1_2_1_7_2","first-page":"1","article-title":"A note on the derivation of maximal common subgraphs of two directed or undirected graphs","volume":"9","author":"Ievi C.","year":"1972","journal-title":"Calcolo"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1021\/ja00465a041"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/321296.321300"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/321510.321511"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/362515.362562"},{"key":"e_1_2_1_12_2","volume-title":"Graph Theory","author":"Flaray F.","year":"1969"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"S. A.Cook \u2018The complexity of theorem proving procedures\u2019 inProceedings of the 3rd Annual ACM Symposium on Theory of Computing 1971 pp.151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_1_15_2","volume-title":"Frontiers of Pattern Recognition","author":"Barrow H. G.","year":"1972"},{"key":"e_1_2_1_16_2","volume-title":"Pattern Recognition and Artificial Intelligence","author":"Freuder E. C.","year":"1976"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380120103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380120103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T04:13:24Z","timestamp":1696047204000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380120103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["10.1002\/spe.4380120103"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380120103","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}