Cargando…

CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape

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 anal...

Descripción completa

Detalles Bibliográficos
Autores principales: Larsen, Simon J., Baumbach, Jan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: De Gruyter 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6042825/
https://www.ncbi.nlm.nih.gov/pubmed/28731857
http://dx.doi.org/10.1515/jib-2017-0014
Descripción
Sumario: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.