CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape

Simon Larsen, Jan Baumbach

Research output: Contribution to journalConference articleResearchpeer-review

162 Downloads (Pure)


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
Original languageEnglish
Article number20170014
JournalJournal of Integrative Bioinformatics
Issue number2
Number of pages8
Publication statusPublished - 21. Jul 2017
Event13th Annual Meeting of the International Symposium on Integrative Bioinformatics - University of Southern Denmark, Campusvej 55 5230 Odense, Odense, Denmark
Duration: 22. Jun 201724. Jun 2017
Conference number: 13


Conference13th Annual Meeting of the International Symposium on Integrative Bioinformatics
LocationUniversity of Southern Denmark, Campusvej 55 5230 Odense
Internet address


  • global network alignment
  • local search
  • network alignment
  • networks
  • Heuristics
  • Humans
  • Arabidopsis/genetics
  • Gene Regulatory Networks
  • Saccharomyces cerevisiae/genetics
  • Protein Interaction Maps
  • Algorithms
  • Animals
  • Mice
  • Software
  • Systems Biology/methods

Cite this