{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T06:39:20Z","timestamp":1770705560809,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"S7","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>Graphs can represent biological networks at the molecular, protein, or species level. An important query is to find all matches of a pattern graph to a target graph. Accomplishing this is inherently difficult (NP-complete) and the efficiency of heuristic algorithms for the problem may depend upon the input graphs. The common aim of existing algorithms is to eliminate unsuccessful mappings as early as and as inexpensively as possible.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>We propose a new subgraph isomorphism algorithm which applies a search strategy to significantly reduce the search space without using any complex pruning rules or domain reduction procedures. We compare our method with the most recent and efficient subgraph isomorphism algorithms (VFlib, LAD, and our C++ implementation of FocusSearch which was originally distributed in Modula2) on synthetic, molecules, and interaction networks data. We show a significant reduction in the running time of our approach compared with these other excellent methods and show that our algorithm scales well as memory demands increase.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusions<\/jats:title>\n            <jats:p>Subgraph isomorphism algorithms are intensively used by biochemical tools. Our analysis gives a comprehensive comparison of different software approaches to subgraph isomorphism highlighting their weaknesses and strengths. This will help researchers make a rational choice among methods depending on their application. We also distribute an open-source package including our system and our own C++ implementation of FocusSearch together with all the used datasets (<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"http:\/\/ferrolab.dmi.unict.it\/ri.html\" ext-link-type=\"uri\">http:\/\/ferrolab.dmi.unict.it\/ri.html<\/jats:ext-link>). In future work, our findings may be extended to approximate subgraph isomorphism algorithms.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/1471-2105-14-s7-s13","type":"journal-article","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T10:15:23Z","timestamp":1366625723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":157,"title":["A subgraph isomorphism algorithm and its application to biochemical data"],"prefix":"10.1186","volume":"14","author":[{"given":"Vincenzo","family":"Bonnici","sequence":"first","affiliation":[]},{"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Ferro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,22]]},"reference":[{"key":"5823_CR1","first-page":"45","volume":"30","author":"B McKay","year":"1981","unstructured":"McKay B: Practical graph isomorphism. Congressus Numerantium . 1981, 30: 45-87.","journal-title":"Congressus Numerantium"},{"key":"5823_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J Ullmann","year":"1976","unstructured":"Ullmann J: An algorithm for Subgraph Isomorphism. Journal of the Association for Computing Machinery. 1976, 23: 31-42. 10.1145\/321921.321925.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"10","key":"5823_CR3","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella L, Foggia P, Sansone C, Vento M: A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2004, 26 (10): 1367-1372. 10.1109\/TPAMI.2004.75.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5594","key":"5823_CR4","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U: Network motifs: simple building blocks of complex networks. Science. 2002, 298 (5594): 824-827. 10.1126\/science.298.5594.824.","journal-title":"Science"},{"key":"5823_CR5","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"Z Kashani","year":"2009","unstructured":"Kashani Z, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari E, Asadi S, Mohammadi Schreiber, Masoudi-Nejad A: Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics. 2009, 10: 318-10.1186\/1471-2105-10-318.","journal-title":"BMC Bioinformatics"},{"key":"5823_CR6","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F: FANMOD: a tool for fast network motif detection. Bioinformatics. 2006, 22: 1152-1153. 10.1093\/bioinformatics\/btl038.","journal-title":"Bioinformatics"},{"issue":"7","key":"5823_CR7","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1093\/bioinformatics\/btm032","volume":"23","author":"A Ferro","year":"2007","unstructured":"Ferro A, Giugno R, Pigola G, Pulvirenti A, Skripin D, Bader GD, Shasha D: NetMatch: a Cytoscape plugin for searching biological networks. Bioinformatics. 2007, 23 (7): 910-912. 10.1093\/bioinformatics\/btm032.","journal-title":"Bioinformatics"},{"key":"5823_CR8","unstructured":"Daylight Chemical Information Systems. [http:\/\/www.daylight.com\/]"},{"key":"5823_CR9","unstructured":"Frowns. [http:\/\/frowns.sourceforge.net\/]"},{"key":"5823_CR10","first-page":"12","volume-title":"BMC Bioinformatics","author":"NW Lemons","year":"2011","unstructured":"Lemons NW, Hu B, Hlavacek W: Hierarchical graphs for rule-based modeling of biochemical system. BMC Bioinformatics. 2011, 12-45."},{"key":"5823_CR11","volume-title":"Chemoinformatics: Advances in Chemoinformatics and Computational Methods, Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism","author":"A Kucukural","year":"2009","unstructured":"Kucukural A, Szilagyi A, Sezerman U, Zhang Y: Chemoinformatics: Advances in Chemoinformatics and Computational Methods, Protein Homology Analysis for Function Prediction with Parallel Sub-Graph Isomorphism. 2009, IGI global"},{"key":"5823_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979, Freeman and Company"},{"key":"5823_CR13","first-page":"112","volume-title":"Proceeding of the International Conference in Pattern recognition (ICPR), ICPR \u201902","author":"R Giugno","year":"2002","unstructured":"Giugno R, Shasha D: GraphGrep: A Fast and Universal Method for Querying Graphs. Proceeding of the International Conference in Pattern recognition (ICPR), ICPR \u201902. 2002, 112-115."},{"key":"5823_CR14","first-page":"335","volume-title":"Proceedings of the ACM SIGMOD international conference on Management of data","author":"X Yan","year":"2004","unstructured":"Yan X, Yu P, Han J: Graph indexing: a frequent structure-based approach. Proceedings of the ACM SIGMOD international conference on Management of data. 2004, SIGMOD '04, 335-346."},{"key":"5823_CR15","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/1247480.1247574","volume-title":"Proceedings of the 2007 ACM SIGMOD international conference on Management of data","author":"J Cheng","year":"2007","unstructured":"Cheng J, Ke Y, Ng W, Lu A: Fg-index: towards verification-free query processing on graph databases. Proceedings of the 2007 ACM SIGMOD international conference on Management of data. 2007, SIGMOD '07, 857-872."},{"key":"5823_CR16","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1186\/1471-2105-11-96","volume":"11","author":"RD Di Natale","year":"2010","unstructured":"Di Natale RD, Ferro A, Giugno R, Mongiov\u00ec M, Pulvirenti A, Shasha D: SING: Subgraph search In Non-homogeneous Graphs. BMC Bioinformatics. 2010, 11: 96-10.1186\/1471-2105-11-96.","journal-title":"BMC Bioinformatics"},{"key":"5823_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-16001-1_17","volume-title":"Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics","author":"V Bonnici","year":"2010","unstructured":"Bonnici V, Ferro A, Giugno R, Pulvirenti A, D S: Enhancing Graph Database Indexing by Suffix Tree Structure. Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics. 2010, 195-203."},{"key":"5823_CR18","first-page":"181","volume-title":"Proceedings of IEEE 23rd International Conference on Data Engineering","author":"S Zhang","year":"2007","unstructured":"Zhang S, Hu M, Yang J: TreePi: A Novel Graph Indexing Method. Proceedings of IEEE 23rd International Conference on Data Engineering. 2007, 181-192."},{"key":"5823_CR19","first-page":"38","volume-title":"ICDE '06: Proceedings of the 22nd International Conference on Data Engineering","author":"H He","year":"2006","unstructured":"He H, Singh AK: Closure-Tree: An Index Structure for Graph Queries. ICDE '06: Proceedings of the 22nd International Conference on Data Engineering. 2006, 38-"},{"key":"5823_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/1353343.1353369","volume-title":"Proceedings of the 11th international conference on Extending database technology: Advances in database technology, EDBT \u201908","author":"L Zou","year":"2008","unstructured":"Zou L, Chen L, Yu JX, Lu Y: A novel spectral coding in a large graph database. Proceedings of the 11th international conference on Extending database technology: Advances in database technology, EDBT \u201908. 2008, 181-192."},{"key":"5823_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery","author":"A Inokuchi","year":"2000","unstructured":"Inokuchi A, Washio T, Motoda H: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery. 2000, PKDD '00, 13-23."},{"key":"5823_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"Proceedings of the 2001 IEEE International Conference on Data Mining","author":"M Kuramochi","year":"2001","unstructured":"Kuramochi M, Karypis G: Frequent Subgraph Discovery. Proceedings of the 2001 IEEE International Conference on Data Mining. 2001, ICDM '01, 313-320."},{"key":"5823_CR23","first-page":"721","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining","author":"X Yan","year":"2002","unstructured":"Yan X, Han J: gSpan: Graph-Based Substructure Pattern Mining. Proceedings of the 2002 IEEE International Conference on Data Mining. 2002, ICDM '02, 721-"},{"issue":"11","key":"5823_CR24","first-page":"807","volume":"4","author":"F Zhu","year":"2011","unstructured":"Zhu F, Qu Q, Lo D, Yan X, Han J, Yu PS: Mining Top-K Large Structural Patterns in a Massive Network. PVLDB. 2011, 4 (11): 807-818.","journal-title":"PVLDB"},{"issue":"1-2","key":"5823_CR25","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y, Wu Y: Graph pattern matching: from intractable to polynomial time. Proc. VLDB Endow. 2010, 3 (1-2): 264-275.","journal-title":"Proc. VLDB Endow"},{"key":"5823_CR26","first-page":"45","volume":"6","author":"B Gallagher","year":"2006","unstructured":"Gallagher B: Matching structure and semantics: A survey on graph-based pattern matching. AAAI FS. 2006, 6: 45-53.","journal-title":"AAAI FS"},{"key":"5823_CR27","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/ICDE.2008.4497500","volume-title":"Proceedings of the 2008 IEEE 24th International Conference on Data Engineering","author":"J Cheng","year":"2008","unstructured":"Cheng J, Yu JX, Ding B, Yu PS, Wang H: Fast Graph Pattern Matching. Proceedings of the 2008 IEEE 24th International Conference on Data Engineering. 2008, ICDE '08, 913-922."},{"key":"5823_CR28","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1145\/1989323.1989420","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","author":"W Fan","year":"2011","unstructured":"Fan W, Li J, Luo J, Tan Z, Wang X, Wu Y: Incremental graph pattern matching. Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. 2011, SIGMOD '11, 925-936."},{"issue":"1.6","key":"5823_CR29","first-page":"1.1","volume":"15","author":"JR Ullmann","year":"2011","unstructured":"Ullmann JR: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorithmics. 2011, 15 (1.6): 1.1-1.6. 1.64","journal-title":"J Exp Algorithmics"},{"key":"5823_CR30","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon C: AllDifferent-based filtering for subgraph isomorphism. Artificial Intelligence. 2010, 174: 850-864. 10.1016\/j.artint.2010.05.002.","journal-title":"Artificial Intelligence"},{"key":"5823_CR31","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R Tarjan","year":"1984","unstructured":"Tarjan R, Yannakakis M: Simple linear-time algorithms to test chordality of graphs,test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J Comput. 1984, 13: 566-579. 10.1137\/0213035.","journal-title":"SIAM J Comput"},{"key":"5823_CR32","first-page":"325","volume-title":"Discr Appl Math","author":"D Shier","year":"1984","unstructured":"Shier D: Some aspects of perfect elimination orderings in chordal graphs. Discr Appl Math. 1984, 325-331."},{"key":"5823_CR33","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-60299-2_16","volume-title":"CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming","author":"F Bacchus","year":"1995","unstructured":"Bacchus F, van Run P: Dynamic variable reordering in CSPs. CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming. 1995, 258-275."},{"key":"5823_CR34","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611821","volume-title":"Constraint Networks: Techniques and Algorithms","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre C: Constraint Networks: Techniques and Algorithms. 2009, ISTE\/Wiley"},{"key":"5823_CR35","first-page":"373","volume-title":"Proceedings of Asian Conference on Computer Vision","author":"BT Messmer","year":"1995","unstructured":"Messmer BT, Bunke H: Subgraph Isomorphism Detection in Polynominal Time on Preprocessed Model Graphs. Proceedings of Asian Conference on Computer Vision. 1995, 373-382."},{"key":"5823_CR36","first-page":"740","volume-title":"Trans Systems, Man and Cybernetics","author":"F Akinniyi","year":"1986","unstructured":"Akinniyi F, Wong A, Stacey D: A new algorithm for graph monomorphism based on the projections of the product graph. Trans Systems, Man and Cybernetics. 1986, 740-751."},{"key":"5823_CR37","first-page":"45","volume-title":"Proceedings of fifth international seminar on relational methods in computer science","author":"L Cortadella","year":"2000","unstructured":"Cortadella L, Valiente G: A relational view of subgraph isomorphism. Proceedings of fifth international seminar on relational methods in computer science. 2000, 45-54."},{"key":"5823_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H Barrow","year":"1976","unstructured":"Barrow H, Burstall RM: Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques. Information Processing Letters. 1976, 4: 83-84. 10.1016\/0020-0190(76)90049-1.","journal-title":"Information Processing Letters"},{"key":"5823_CR39","volume-title":"Discrete Relaxation Techniques","author":"TC Henderson","year":"1990","unstructured":"Henderson TC: Discrete Relaxation Techniques. 1990, Oxford University Press"},{"issue":"11","key":"5823_CR40","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/34.42855","volume":"11","author":"R Horaud","year":"1989","unstructured":"Horaud R, Skordas T: Stereo Correspondence Through Feature Grouping and Maximal Cliques. IEEE Transactions on Pattern Analysis and Machine Intelligence. 1989, 11 (11): 1168-1180. 10.1109\/34.42855.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5823_CR41","first-page":"341","volume-title":"Journal of Calcols 9","author":"G Levi","year":"1972","unstructured":"Levi G: A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Journal of Calcols 9. 1972, 341-354."},{"key":"5823_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/09528139208953741","volume":"4","author":"SH Myaeng","year":"1992","unstructured":"Myaeng SH, Lopez-Lopez A: Conceptual graph matching: a flexible algorithm and experiments. Journal of Experimental Theoretical Artificial Intelligence. 1992, 4: 107-126. 10.1080\/09528139208953741.","journal-title":"Journal of Experimental Theoretical Artificial Intelligence"},{"key":"5823_CR43","volume-title":"Principles of artificial intelligence","author":"N Nilsson","year":"1980","unstructured":"Nilsson N: Principles of artificial intelligence. 1980, Palo Alto CA: Tioga"},{"issue":"3","key":"5823_CR44","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu K: A Distace Measure between Attributed Relational Graphs for Pattern Recognition. IEEE Transactions on Systems Man and Cybernetics. 1983, 13 (3): 353-362.","journal-title":"IEEE Transactions on Systems Man and Cybernetics"},{"issue":"5","key":"5823_CR45","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TPAMI.1985.4767707","volume":"7","author":"A Wong","year":"1985","unstructured":"Wong A, You M: Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition. IEEE Transactions Pattern Analysis and Machine Intelligence. 1985, 7 (5): 599-609.","journal-title":"IEEE Transactions Pattern Analysis and Machine Intelligence"},{"key":"5823_CR46","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10618-009-0132-7","volume":"19","author":"V Lipets","year":"2009","unstructured":"Lipets V, Vanetik N, Gudes E: Subsea: an efficient heuristic algorithm for subgraph isomorphism. Data Min Knowl Disc. 2009, 19: 320-350. 10.1007\/s10618-009-0132-7.","journal-title":"Data Min Knowl Disc"},{"key":"5823_CR47","unstructured":"National Cancer Institute. [http:\/\/www.nci.nih.gov\/]"},{"key":"5823_CR48","volume-title":"Nature-precedings","author":"R Huehne","year":"2009","unstructured":"Huehne R, Suehnel J: The Jena Library of Biological Macromolecules. Nature-precedings. 2009"},{"key":"5823_CR49","unstructured":"Protein Data Bank. [http:\/\/www.rcsb.org\/pdb\/]"},{"issue":"11","key":"5823_CR50","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1093\/bioinformatics\/btr163","volume":"27","author":"C Vehlow","year":"2011","unstructured":"Vehlow C, Stehr H, Winkelmann M, Duarte JM, Petzold L, Dinse J, Lappe M: CMView: Interactive contact map visualization and analysis. Bioinformatics. 2011, 27 (11): 1573-1577. 10.1093\/bioinformatics\/btr163.","journal-title":"Bioinformatics"},{"issue":"9","key":"5823_CR51","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1101\/gr.5235706","volume":"16","author":"J Flannick","year":"2006","unstructured":"Flannick J, Novak A, Srinivasan B, McAdams H, Batzoglou S: Graemlin: general and robust alignment of multiple large interaction networks. Genome research. 2006, 16 (9): 1169-10.1101\/gr.5235706.","journal-title":"Genome research"},{"key":"5823_CR52","volume-title":"Lecture Notes in Computer Science","author":"P Dickinson","year":"2003","unstructured":"Dickinson P, Bunke H, Dadej A, Kraetzl M: On graphs with unique node labels. Lecture Notes in Computer Science. 2003, 2726:"},{"key":"5823_CR53","doi-asserted-by":"publisher","first-page":"D561","DOI":"10.1093\/nar\/gkq973","volume":"39","author":"D Szklarczyk","year":"2011","unstructured":"Szklarczyk D, Franceschini A, Kuhn M, Simonovic M, Roth A, Minguez P, Doerks T, Stark M, Muller J, Bork P, Jensen L, von Mering C: The STRING database in 2011: functional interaction networks of proteins, globally integrated and scored. Nucleic Acids Res. 2011, 39: D561-D568. 10.1093\/nar\/gkq973.","journal-title":"Nucleic Acids Res"},{"key":"5823_CR54","first-page":"176","volume-title":"Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition","author":"P Foggia","year":"2001","unstructured":"Foggia P, Sansone C, Vento M: A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking. Proceedings of the 3rd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition. 2001, 176-187."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S7-S13.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T23:28:07Z","timestamp":1630538887000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-14-S7-S13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":54,"journal-issue":{"issue":"S7","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["5823"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-14-s7-s13","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]},"assertion":[{"value":"22 April 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S13"}}