{"id":"https://openalex.org/W1972324328","doi":"https://doi.org/10.1021/ci00010a015","title":"An algorithm for the multiple common subgraph problem","display_name":"An algorithm for the multiple common subgraph problem","publication_year":1992,"publication_date":"1992-11-01","ids":{"openalex":"https://openalex.org/W1972324328","doi":"https://doi.org/10.1021/ci00010a015","mag":"1972324328"},"language":"en","primary_location":{"id":"doi:10.1021/ci00010a015","is_oa":false,"landing_page_url":"https://doi.org/10.1021/ci00010a015","pdf_url":null,"source":{"id":"https://openalex.org/S171559003","display_name":"Journal of Chemical Information and Computer Sciences","issn_l":"0095-2338","issn":["0095-2338","1520-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320006","host_organization_name":"American Chemical Society","host_organization_lineage":["https://openalex.org/P4310320006"],"host_organization_lineage_names":["American Chemical Society"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Chemical Information and Computer Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045319813","display_name":"Denis M. Bayada","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Denis M. Bayada","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005096953","display_name":"Richard Simpson","orcid":"https://orcid.org/0000-0002-2416-0469"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard W. Simpson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101619465","display_name":"A. Peter Johnson","orcid":"https://orcid.org/0009-0004-6773-1817"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Peter Johnson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001903209","display_name":"Claude Lauren\u00e7o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claude Laurenco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6267,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.8353694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"32","issue":"6","first_page":"680","last_page":"685"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9319999814033508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9319999814033508,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7156062722206116},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5274779200553894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5060517191886902},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48571380972862244},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41397035121917725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3905959129333496},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17130273580551147},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.043371111154556274}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7156062722206116},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5274779200553894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5060517191886902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48571380972862244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41397035121917725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3905959129333496},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17130273580551147},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.043371111154556274},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1021/ci00010a015","is_oa":false,"landing_page_url":"https://doi.org/10.1021/ci00010a015","pdf_url":null,"source":{"id":"https://openalex.org/S171559003","display_name":"Journal of Chemical Information and Computer Sciences","issn_l":"0095-2338","issn":["0095-2338","1520-5142"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320006","host_organization_name":"American Chemical Society","host_organization_lineage":["https://openalex.org/P4310320006"],"host_organization_lineage_names":["American Chemical Society"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Chemical Information and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W1482551403","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W2604114816","https://openalex.org/W2954463587"],"abstract_inverted_index":{"ADVERTISEMENT":[0],"RETURN":[1],"TO":[2],"ISSUEPREVArticleNEXTAn":[3],"algorithm":[4],"for":[5,150],"the":[6,54,85,90,119,130,143,146,151,158,164],"multiple":[7],"common":[8],"subgraph":[9],"problemDenis":[10],"M.":[11],"Bayada,":[12],"Richard":[13],"W.":[14],"Simpson,":[15],"A.":[16],"Peter":[17],"Johnson,":[18],"and":[19,67,72,101,145,162,178,180],"Claude":[20],"LaurencoCite":[21],"this:":[22],"J.":[23],"Chem.":[24],"Inf.":[25],"Comput.":[26],"Sci.":[27],"1992,":[28],"32,":[29],"6,":[30],"680\u2013685Publication":[31],"Date":[32],"(Print):November":[33],"1,":[34],"1992Publication":[35],"History":[36],"Published":[37],"online1":[38],"May":[39],"2002Published":[40],"inissue":[41],"1":[42],"November":[43,63],"1992https://pubs.acs.org/doi/10.1021/ci00010a015https://doi.org/10.1021/ci00010a015research-articleACS":[44],"PublicationsRequest":[45],"reuse":[46],"permissionsArticle":[47],"Views287Altmetric-Citations31LEARN":[48],"ABOUT":[49],"THESE":[50],"METRICSArticle":[51],"Views":[52],"are":[53,76,89],"COUNTER-compliant":[55],"sum":[56],"of":[57,92,118],"full":[58],"text":[59],"article":[60,124],"downloads":[61],"since":[62],"2008":[64],"(both":[65],"PDF":[66],"HTML)":[68],"across":[69],"all":[70],"institutions":[71],"individuals.":[73],"These":[74],"metrics":[75],"regularly":[77],"updated":[78,102],"to":[79,84],"reflect":[80],"usage":[81],"leading":[82],"up":[83],"last":[86],"few":[87],"days.Citations":[88],"number":[91],"other":[93],"articles":[94],"citing":[95],"this":[96],"article,":[97],"calculated":[98],"by":[99],"Crossref":[100,108],"daily.":[103],"Find":[104,154],"more":[105,155],"information":[106,156],"about":[107,142],"citation":[109],"counts.The":[110],"Altmetric":[111,159],"Attention":[112,160],"Score":[113,161],"is":[114,166],"a":[115,122,135],"quantitative":[116],"measure":[117],"attention":[120],"that":[121],"research":[123],"has":[125],"received":[126],"online.":[127],"Clicking":[128],"on":[129,157],"donut":[131],"icon":[132],"will":[133],"load":[134],"page":[136],"at":[137],"altmetric.com":[138],"with":[139,174],"additional":[140],"details":[141],"score":[144,165],"social":[147],"media":[148],"presence":[149],"given":[152],"article.":[153],"how":[163],"calculated.":[167],"Share":[168,183],"Add":[169],"toView":[170],"InAdd":[171],"Full":[172],"Text":[173],"ReferenceAdd":[175],"Description":[176],"ExportRISCitationCitation":[177],"abstractCitation":[179],"referencesMore":[181],"Options":[182],"onFacebookTwitterWechatLinked":[184],"InRedditEmail":[185],"Other":[186],"access":[187],"options":[188],"Get":[189],"e-Alerts":[190]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
