Article thumbnail

Aligning graphs and finding substructures by a cavity approach

By S. Bradde, A. Braunstein, H. Mahmoudi, F. Tria, M. Weigt and R. Zecchina

Abstract

We introduce a new distributed algorithm for aligning graphs or finding substructures within a given graph. It is based on the cavity method and is used to study the maximum-clique and the graph-alignment problems in random graphs. The algorithm allows to analyze large graphs and may find applications in fields such as computational biology. As a proof of concept we use our algorithm to align the similarity graphs of two interacting protein families involved in bacterial signal transduction, and to predict actually interacting protein partners between these families

Publisher: EDP Sciences
Year: 2010
DOI identifier: 10.1209/0295-5075/89/37009/pdf
OAI identifier: oai:edpsciences.org:dkey/10.1209/0295-5075/89/37009
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doi.org/10.1209/0295-5... (external link)
  • http://epljournal.edpsciences.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.