Local graph alignment and motif search in biological networks

Details Local graph alignment and motif search in biological networks Local graph alignment and motif search in biological networks

2003-08-13

arxiv.org/abs/cond-mat/0308251v2

PNAS,101 (41) 14689-14694 (2004)

Physics

Condensed Matter

Statistical Mechanics

published version

Scientific paper

10.1073/pnas.0305199101

Interaction networks are of central importance in post-genomic molecular biology, with increasing amounts of data becoming available by high-throughput methods. Examples are gene regulatory networks or protein interaction maps. The main challenge in the analysis of these data is to read off biological functions from the topology of the network. Topological motifs, i.e., patterns occurring repeatedly at different positions in the network have recently been identified as basic modules of molecular information processing. In this paper, we discuss motifs derived from families of mutually similar but not necessarily identical patterns. We establish a statistical model for the occurrence of such motifs, from which we derive a scoring function for their statistical significance. Based on this scoring function, we develop a search algorithm for topological motifs called graph alignment, a procedure with some analogies to sequence alignment. The algorithm is applied to the gene regulation network of E. coli.

Affiliated with

Also associated with

No associations

Rating

Local graph alignment and motif search in biological networks 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 Local graph alignment and motif search in biological networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local graph alignment and motif search in biological networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2290