{"id":"https://openalex.org/W4416199137","doi":"https://doi.org/10.1145/3712285.3759782","title":"SIGMo: High-Throughput Batched Subgraph Isomorphism on GPUs for Molecular Matching","display_name":"SIGMo: High-Throughput Batched Subgraph Isomorphism on GPUs for Molecular Matching","publication_year":2025,"publication_date":"2025-11-12","ids":{"openalex":"https://openalex.org/W4416199137","doi":"https://doi.org/10.1145/3712285.3759782"},"language":null,"primary_location":{"id":"doi:10.1145/3712285.3759782","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759782","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3712285.3759782","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104361070","display_name":"Antonio De","orcid":"https://orcid.org/0009-0004-9909-6440"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Antonio De Caro","raw_affiliation_strings":["University of Salerno, Fisciano, Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084267145","display_name":"Gennaro Cordasco","orcid":"https://orcid.org/0000-0001-9148-9769"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gennaro Cordasco","raw_affiliation_strings":["University of Salerno, Fisciano, Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064922215","display_name":"Federico Ficarelli","orcid":"https://orcid.org/0000-0003-1447-8278"},"institutions":[{"id":"https://openalex.org/I4210119786","display_name":"Cineca","ror":"https://ror.org/02f013h18","country_code":"IT","type":"other","lineage":["https://openalex.org/I4210119786"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Federico Ficarelli","raw_affiliation_strings":["CINECA, Casalecchio di Reno, Italy"],"affiliations":[{"raw_affiliation_string":"CINECA, Casalecchio di Reno, Italy","institution_ids":["https://openalex.org/I4210119786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031619277","display_name":"Biagio Cosenza","orcid":"https://orcid.org/0000-0002-8869-6705"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Biagio Cosenza","raw_affiliation_strings":["University of Salerno, Fisciano, Italy"],"affiliations":[{"raw_affiliation_string":"University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5104361070"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":null,"apc_paid":null,"fwci":1.428,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87212131,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1524","last_page":"1538"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9531000256538391,"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.9531000256538391,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.020400000736117363,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10211","display_name":"Computational Drug Discovery Methods","score":0.005400000140070915,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.9606000185012817},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.8988000154495239},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6280999779701233},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5658000111579895},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5503000020980835},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4691999852657318},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43700000643730164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3887999951839447}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.9606000185012817},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.8988000154495239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6484000086784363},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6280999779701233},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5658000111579895},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5503000020980835},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43700000643730164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43299999833106995},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3887999951839447},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3695000112056732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3278000056743622},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.30059999227523804},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.2572999894618988},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.25369998812675476},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2522999942302704},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3712285.3759782","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759782","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3712285.3759782","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3712285.3759782","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W772516776","https://openalex.org/W1500036797","https://openalex.org/W1974992686","https://openalex.org/W1982870104","https://openalex.org/W1988037271","https://openalex.org/W2027423337","https://openalex.org/W2030971064","https://openalex.org/W2035173902","https://openalex.org/W2035609387","https://openalex.org/W2051381895","https://openalex.org/W2062458432","https://openalex.org/W2070753604","https://openalex.org/W2074075121","https://openalex.org/W2094561302","https://openalex.org/W2104722869","https://openalex.org/W2126359798","https://openalex.org/W2140840007","https://openalex.org/W2147405597","https://openalex.org/W2147421370","https://openalex.org/W2147993766","https://openalex.org/W2159010139","https://openalex.org/W2161239029","https://openalex.org/W2163184742","https://openalex.org/W2169678694","https://openalex.org/W2176516200","https://openalex.org/W2409645877","https://openalex.org/W2583725294","https://openalex.org/W2613146847","https://openalex.org/W2743401659","https://openalex.org/W2890747390","https://openalex.org/W2902944788","https://openalex.org/W2944975820","https://openalex.org/W2948167003","https://openalex.org/W3015498000","https://openalex.org/W3025380722","https://openalex.org/W3113976260","https://openalex.org/W3198587799","https://openalex.org/W3205833606","https://openalex.org/W3208942821","https://openalex.org/W3209182454","https://openalex.org/W4214868967","https://openalex.org/W4285609551","https://openalex.org/W4286655745","https://openalex.org/W4313142772","https://openalex.org/W4318969799","https://openalex.org/W4320857994","https://openalex.org/W4321636589","https://openalex.org/W4321636650","https://openalex.org/W4386783866","https://openalex.org/W4390659208","https://openalex.org/W4392094892","https://openalex.org/W4394659232","https://openalex.org/W4405756237"],"related_works":[],"abstract_inverted_index":{"Subgraph":[0],"isomorphism":[1,28,37,68,156],"is":[2,21,38,125],"a":[3,26,51,64,88,96,113,118,142,160,169],"fundamental":[4],"graph":[5],"problem":[6],"with":[7,171],"applications":[8],"in":[9,46,127],"diverse":[10],"domains":[11],"from":[12,145],"biology":[13],"to":[14,40,86,107,112,149],"social":[15],"network":[16],"analysis.":[17],"Of":[18],"particular":[19],"interest":[20],"molecular":[22,48,76],"matching,":[23],"which":[24],"uses":[25],"subgraph":[27,36,67,155],"formulation":[29,50,85],"for":[30,57,70,74],"the":[31,47,82,93],"drug":[32],"discovery":[33],"process.":[34],"While":[35],"known":[39],"be":[41],"NP-complete":[42],"and":[43,135,158],"computationally":[44],"expensive,":[45],"matching":[49],"number":[52],"of":[53,81,162],"domain":[54,84],"constraints":[55],"allow":[56],"efficient":[58,90],"implementations.":[59],"This":[60],"paper":[61],"presents":[62],"SIGMo,":[63],"high-throughput,":[65],"portable":[66,130],"framework":[69,94],"GPUs,":[71],"specifically":[72],"designed":[73],"batch":[75],"matching.":[77],"SIGMo":[78],"takes":[79],"advantage":[80],"specific":[83],"provide":[87],"more":[89],"filter-and-join":[91],"strategy:":[92],"introduces":[95],"novel":[97],"multi-level":[98],"iterative":[99],"filtering":[100],"technique":[101],"based":[102],"on":[103,132,141,168],"neighborhood":[104],"signature":[105],"encoding":[106],"efficiently":[108],"prune":[109],"candidates":[110],"prior":[111],"GPU-optimized":[114],"join":[115],"phase":[116],"using":[117],"stack-based":[119],"DFS":[120],"traversal.":[121],"The":[122],"GPU":[123],"implementation":[124],"written":[126],"SYCL,":[128],"allowing":[129],"execution":[131],"AMD,":[133],"Intel,":[134],"NVIDIA":[136],"GPUs.":[137,173],"Our":[138],"experimental":[139],"evaluation":[140],"large":[143],"dataset":[144],"ZINC":[146],"demonstrates":[147],"up":[148],"1470":[150],"\u00d7":[151],"speedup":[152],"over":[153],"state-of-the-art":[154],"frameworks,":[157],"achieves":[159],"throughput":[161],"7.7":[163],"billion":[164],"matches":[165],"per":[166],"second":[167],"cluster":[170],"256":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-12T00:00:00"}