CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape

5Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

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 http://apps.cytoscape.org/apps/cytomcs.

Cite

CITATION STYLE

APA

Larsen, S. J., & Baumbach, J. (2017). CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape. Journal of Integrative Bioinformatics, 14(2). https://doi.org/10.1515/jib-2017-0014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free