Formal Analysis of Network Motifs

5Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A recurring set of small sub-networks have been identified as the building blocks of biological networks across diverse organisms. These network motifs have been associated with certain dynamical behaviors and define key modules that are important for understanding complex biological programs. Besides studying the properties of motifs in isolation, existing algorithms often evaluate the occurrence frequency of a specific motif in a given biological network compared to that in random networks of similar structure. However, it remains challenging to relate the structure of motifs to the observed and expected behavior of the larger network. Indeed, even the precise structure of these biological networks remains largely unknown. Previously, we developed a formal reasoning approach enabling the synthesis of biological networks capable of reproducing some experimentally observed behavior. Here, we extend this approach to allow reasoning about the requirement for specific network motifs as a way of explaining how these behaviors arise. We illustrate the approach by analyzing the motifs involved in sign-sensitive delay and pulse generation. We demonstrate the scalability and biological relevance of the approach by revealing the requirement for certain motifs in the network governing stem cell pluripotency.

Cite

CITATION STYLE

APA

Kugler, H., Dunn, S. J., & Yordanov, B. (2018). Formal Analysis of Network Motifs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11095 LNBI, pp. 111–128). Springer Verlag. https://doi.org/10.1007/978-3-319-99429-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free