Local graph alignment and motif search in biological networks

AUTOR(ES)

Berg, Johannes

FONTE

National Academy of Sciences

RESUMO

Interaction networks are of central importance in postgenomic 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 article, 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 Escherichia coli.

Documentos Relacionados

• Random graph models of social networks
• Optimization in timetabling in schools using a mathematical model, local search and Iterated Local Search procedures
• Community structure in social and biological networks
• Measures of degeneracy and redundancy in biological networks
• Local DNA sequence alignment in a cluster of workstations: algorithms and tools