CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape

J Integr Bioinform. 2017 Jul 21;14(2):20170014. doi: 10.1515/jib-2017-0014.


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

Keywords: global network alignment; local search; network alignment; networks.

MeSH terms

  • Algorithms*
  • Animals
  • Arabidopsis / genetics
  • Arabidopsis / metabolism
  • Gene Regulatory Networks*
  • Heuristics
  • Humans
  • Mice
  • Protein Interaction Maps*
  • Saccharomyces cerevisiae / genetics
  • Saccharomyces cerevisiae / metabolism
  • Software*
  • Systems Biology / methods*