Aligning graphs and finding substructures by a cavity approach

Details Aligning graphs and finding substructures by a cavity approach Aligning graphs and finding substructures by a cavity approach

2009-05-12

arxiv.org/abs/0905.1893v2

2010 Europhys. Lett. 89 37009

Biology

Quantitative Biology

Quantitative Methods

5 pages, 4 figures

Scientific paper

10.1209/0295-5075/89/37009

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.

Affiliated with

Also associated with

No associations

Rating

Aligning graphs and finding substructures by a cavity approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Aligning graphs and finding substructures by a cavity approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aligning graphs and finding substructures by a cavity approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337561