{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:58:44Z","timestamp":1773482324621,"version":"3.50.1"},"reference-count":32,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7,21]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Comparative analysis of biological networks is a major problem in computational integrative systems biology. By computing the maximum common edge subgraph between a set of networks, one is able to detect conserved substructures between them and quantify their topological similarity. To aid such analyses we have developed CytoMCS, a Cytoscape app for computing inexact solutions to the maximum common edge subgraph problem for two or more graphs. Our algorithm uses an iterative local search heuristic for computing conserved subgraphs, optimizing a squared edge conservation score that is able to detect not only fully conserved edges but also partially conserved edges. It can be applied to any set of directed or undirected, simple graphs loaded as networks into Cytoscape, e.g. protein-protein interaction networks or gene regulatory networks. CytoMCS is available as a Cytoscape app at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/apps.cytoscape.org\/apps\/cytomcs\">http:\/\/apps.cytoscape.org\/apps\/cytomcs<\/jats:ext-link>.<\/jats:p>","DOI":"10.1515\/jib-2017-0014","type":"journal-article","created":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T10:01:09Z","timestamp":1500631269000},"source":"Crossref","is-referenced-by-count":5,"title":["CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape"],"prefix":"10.1515","volume":"14","author":[{"given":"Simon J.","family":"Larsen","sequence":"first","affiliation":[{"name":"Computational Biology group, Department of Mathematics and Computer Science, University of Southern Denmark, DK-5230 Odense M, Denmark"}]},{"given":"Jan","family":"Baumbach","sequence":"additional","affiliation":[{"name":"Computational Biology group, Department of Mathematics and Computer Science, University of Southern Denmark, DK-5230 Odense M, Denmark"}]}],"member":"374","reference":[{"key":"ref201","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/s13637-015-0022-9","article-title":"The post-genomic era of biological network alignment","volume":"2015","year":"2015","journal-title":"EURASIP J Bioinform Syst Biol"},{"key":"ref01","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","article-title":"RASCAL: calculation of graph similarity using maximum common edge subgraphs","volume":"45","year":"2002","journal-title":"Comput J"},{"key":"ref301","volume-title":"Computers and intractability","volume":"29","year":"2002"},{"key":"ref261","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1093\/bioinformatics\/btq675","article-title":"Cytoscape 2.8: new features for data integration and network visualization","volume":"27","year":"2011","journal-title":"Bioinformatics"},{"key":"ref151","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1186\/1471-2164-13-405","article-title":"HTRIdb: an open-access database for experimentally verified human transcriptional regulation interactions","volume":"13","year":"2012","journal-title":"BMC Genomics"},{"key":"ref251","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/TCBB.2015.2474391","article-title":"Global alignment of protein-protein interaction networks: a survey","volume":"13","year":"2016","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"ref311","first-page":"D369","article-title":"The BioGRID interaction database: 2017 update","volume":"45","year":"2016","journal-title":"Nucleic Acids Res"},{"key":"ref121","first-page":"1259","article-title":"CytoGEDEVO\u2014global alignment of biological networks with Cytoscape","volume":"32","year":"2015","journal-title":"Bioinformatics"},{"key":"ref321","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1186\/1471-2164-13-405","article-title":"HTRIdb: an open-access database for experimentally verified human transcriptional regulation interactions","volume":"13","year":"2012","journal-title":"BMC Genomics"},{"key":"ref171","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","article-title":"RASCAL: calculation of graph similarity using maximum common edge subgraphs","volume":"45","year":"2002","journal-title":"Comput J"},{"key":"ref331","first-page":"D133","article-title":"RegulonDB version 9.0: high-level integration of gene regulation, coexpression, motif clustering and beyond","volume":"44","year":"2015","journal-title":"Nucleic Acids Res"},{"key":"ref61","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1089\/cmb.2009.0196","article-title":"Maximum contact map overlap revisited","volume":"18","year":"2011","journal-title":"J Comput Biol"},{"key":"ref191","first-page":"341","year":"2016","journal-title":"A simulated annealing algorithm for maximum common edge subgraph detection in biological networks"},{"key":"ref91","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1093\/bioinformatics\/btq675","article-title":"Cytoscape 2.8: new features for data integration and network visualization","volume":"27","year":"2011","journal-title":"Bioinformatics"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/s13637-015-0022-9","article-title":"The post-genomic era of biological network alignment","volume":"2015","year":"2015","journal-title":"EURASIP J Bioinform Syst Biol"},{"key":"ref141","first-page":"D369","article-title":"The BioGRID interaction database: 2017 update","volume":"45","year":"2016","journal-title":"Nucleic Acids Res"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1093\/bioinformatics\/btv130","article-title":"L-GRAAL: Lagrangian graphlet-based network aligner","volume":"31","year":"2015","journal-title":"Bioinformatics"},{"key":"ref131","volume-title":"Computers and intractability","volume":"29","year":"2002"},{"key":"ref291","first-page":"1259","article-title":"CytoGEDEVO\u2014global alignment of biological networks with Cytoscape","volume":"32","year":"2015","journal-title":"Bioinformatics"},{"key":"ref81","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1109\/TCBB.2015.2474391","article-title":"Global alignment of protein-protein interaction networks: a survey","volume":"13","year":"2016","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"ref71","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1093\/bioinformatics\/btu020","article-title":"GR-Align: fast and flexible alignment of protein 3D structures using graphlet degree similarity","volume":"30","year":"2014","journal-title":"Bioinformatics"},{"key":"ref211","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1093\/bioinformatics\/btv130","article-title":"L-GRAAL: Lagrangian graphlet-based network aligner","volume":"31","year":"2015","journal-title":"Bioinformatics"},{"key":"ref231","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1089\/cmb.2009.0196","article-title":"Maximum contact map overlap revisited","volume":"18","year":"2011","journal-title":"J Comput Biol"},{"key":"ref281","first-page":"68","year":"2013","journal-title":"GEDEVO: an evolutionary graph edit distance algorithm for biological network alignment"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1186\/1471-2105-12-24","article-title":"GraphCrunch 2: software tool for network modeling, alignment and clustering","volume":"12","year":"2011","journal-title":"BMC Bioinformatics"},{"key":"ref181","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1186\/1471-2105-12-24","article-title":"GraphCrunch 2: software tool for network modeling, alignment and clustering","volume":"12","year":"2011","journal-title":"BMC Bioinformatics"},{"key":"ref221","first-page":"587","article-title":"Flexible algorithm for direct multiple alignment of protein structures and sequences","volume":"10","year":"1994","journal-title":"Comput Appl Biosci CABIOS"},{"key":"ref161","first-page":"D133","article-title":"RegulonDB version 9.0: high-level integration of gene regulation, coexpression, motif clustering and beyond","volume":"44","year":"2015","journal-title":"Nucleic Acids Res"},{"key":"ref21","first-page":"341","year":"2016","journal-title":"A simulated annealing algorithm for maximum common edge subgraph detection in biological networks"},{"key":"ref51","first-page":"587","article-title":"Flexible algorithm for direct multiple alignment of protein structures and sequences","volume":"10","year":"1994","journal-title":"Comput Appl Biosci CABIOS"},{"key":"ref241","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1093\/bioinformatics\/btu020","article-title":"GR-Align: fast and flexible alignment of protein 3D structures using graphlet degree similarity","volume":"30","year":"2014","journal-title":"Bioinformatics"},{"key":"ref111","first-page":"68","year":"2013","journal-title":"GEDEVO: an evolutionary graph edit distance algorithm for biological network alignment"}],"container-title":["Journal of Integrative Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jib\/14\/2\/article-20170014.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2017-0014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T01:57:31Z","timestamp":1619056651000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jib-2017-0014\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"references-count":32,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1515\/jib-2017-0014","relation":{},"ISSN":["1613-4516"],"issn-type":[{"value":"1613-4516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}