arXiv · 0905.1893
Aligning graphs and finding substructures by a cavity approach
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.
Explore related subjects
Keep this discovery
S. Bradde, A. Braunstein, H. Mahmoudi, F. Tria, M. Weigt, R. Zecchina. 2010-04-01. Aligning graphs and finding substructures by a cavity approach. https://doi.org/10.1209/0295-5075%2F89%2F37009
Cite the original work for its findings. Save a collection to share your selection of sources.