{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:42:57Z","timestamp":1783701777047,"version":"3.55.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2017,1,1]]},"DOI":"10.1109\/tcbb.2016.2515595","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T14:07:54Z","timestamp":1452175674000},"page":"193-203","source":"Crossref","is-referenced-by-count":42,"title":["On the Variable Ordering in Subgraph Isomorphism Algorithms"],"prefix":"10.1109","volume":"14","author":[{"given":"Vincenzo","family":"Bonnici","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-9843-7638","authenticated-orcid":false,"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18224-7_18"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41190-8_44"},{"key":"ref70","first-page":"d447-d452","article-title":"String v10: Protein–protein interaction networks, integrated over the tree of life","volume":"43","author":"szklarczyk","year":"2014","journal-title":"Nucleic Acids Res"},{"key":"ref74","article-title":"Distinguishing vertices of inhomogeneous random graphs","author":"codenotti","year":"2013"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"ref33","author":"michael","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001412500139"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4789-6_12"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmb.2007.03.013"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09438-9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1101\/gr.1239303"},{"key":"ref61","volume":"38","author":"ore","year":"1965","journal-title":"Theory of Graphs"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp517"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.4137\/CIN.S680"},{"key":"ref64","author":"biggs","year":"1993","journal-title":"Algebraic Graph Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"ref65","volume":"2","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref66","first-page":"21","article-title":"Enforcing arc consistency using bitwise operations","volume":"2","author":"lecoutre","year":"2008","journal-title":"Constraint Programming Letters"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2133841100"},{"key":"ref67","first-page":"176","article-title":"A database of graphs for isomorphism and sub-graph isomorphism benchmarking","author":"foggia","year":"0","journal-title":"Proc 3rd IAPR-TC-15 Int Workshop Graph-Based Representations"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00253-2"},{"key":"ref69","first-page":"109","article-title":"Benchmarking of graph matching algorithms","author":"bunke","year":"0","journal-title":"Proc 2nd IAPR workshop on Graph Based representations"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1126\/science.1091403","article-title":"A map of the interactome network of the metazoan c. elegans","volume":"303","author":"li","year":"2004","journal-title":"Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2004-00301-0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt1190"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5808\/GI.2013.11.4.200"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1272"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2918"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.pharmthera.2013.01.016"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network motifs: Simple building blocks of complex networks","volume":"298","author":"milo","year":"2002","journal-title":"Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2014.00083"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.05.018"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"ref59","first-page":"77","article-title":"Search strategies for subgraph isomorphism algorithms","author":"?ibej","year":"0","journal-title":"Applied Algorithms"},{"key":"ref58","first-page":"146","article-title":"Boosting systematic search by weighting constraints","volume":"16","author":"boussemart","year":"0","journal-title":"Proc 16th Eur Conf Artif Intell"},{"key":"ref57","first-page":"405","article-title":"The brélaz heuristic and optimal static orderings","author":"smith","year":"1999","journal-title":"Principles and Practice of Constraint Programming Workshop"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61551-2_66"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017438"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_52"},{"key":"ref53","first-page":"29","article-title":"Revision ordering heuristics for the constraint satisfaction problem","author":"boussemart","year":"0","journal-title":"Proc Constraint Propag Implementation"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1338"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bfgp\/els037"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777638_0014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bfgp\/els032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1891\/0739-6686.29.55"},{"key":"ref14","year":"0"},{"key":"ref15","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkj126"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkq1039"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gks1158"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2014.00069"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nature11245"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11103-005-8159-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1049\/iet-syb:20060071"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14304\/SURYA.JPR.V1N1.7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nrc2044"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1000138107"},{"key":"ref49","author":"mckay","year":"1981","journal-title":"Practical Graph Isomorphism"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1005-1243"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1921702"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-009-9074-3"},{"key":"ref48","first-page":"268","article-title":"Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems","author":"gaschnig","year":"0","journal-title":"Proc 2nd Biennial Conf Canadian Soc Comput Studies Intell"},{"key":"ref47","first-page":"457","article-title":"A general backtrack algorithm that eliminates most redundant tests","author":"gaschnig","year":"0","journal-title":"Proc 5th Int Joint Conf Artif Intell"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/321296.321300"},{"key":"ref41","article-title":"Constraint satisfation","author":"mackworth","year":"1987","journal-title":"Encyclopedia of Artificial Intelligence"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(79)90023-9"},{"key":"ref43","first-page":"149","article-title":"An improved algorithm for matching large graphs","author":"cordella","year":"0","journal-title":"Proc 3rd IAPR-TC15 Workshop Graph-Based Representations Pattern Recog"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8857\/7842713\/07374671.pdf?arnumber=7374671","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:15Z","timestamp":1641987495000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/7374671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":74,"journal-issue":{"issue":"1"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tcbb.2016.2515595","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"value":"1545-5963","type":"print"},{"value":"1557-9964","type":"electronic"},{"value":"2374-0043","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}