Search bioRxiv⌕ Search

Biology subjects

Subbaroyan, A.

Publications and source records attributed to Subbaroyan, A..

2 recordsLinked to original sources

Composition structures and biologically meaningful logics: plausibility and relevance in bipartite models of gene regulation

Boolean network models have widely been used to study the dynamics of gene regulatory networks. However, such models are coarse-grained to an extent that they abstract away molecular specificities of gene regulation. In contrast, bipartite Boolean network models of gene regulation explicitly distinguish genes from transcription factors (TFs). In such models, multiple TFs may simultaneously contribute to the regulation of a gene by forming heteromeric complexes. The formation of heteromeric complexes gives rise to composition structures in the corresponding bipartite network. Remarkably, composition structures can severely restrict the number of Boolean functions (BFs) that can be assigned to a gene. The introduction of bipartite Boolean network models is relatively recent, and so far an empirical investigation of their biological plausibility is lacking. Here, we estimate the prevalence of composition structures arising through heteromeric complexes in Homo sapiens. Moreover, we present an additional mechanism by which composition structures arise as a result of multiple TFs binding to the cis-regulatory regions of a gene and we provide empirical support for this mechanism. Next, we compare the restriction in BFs imposed by composition structures and by biologically meaningful properties. We find that two types of minimally complex BFs, namely nested canalyzing functions (NCFs) and read-once functions (RoFs), are more restrictive than composition structures. Finally, using a compiled dataset of 2687 BFs from published models, we find that composition structures are highly enriched in real biological networks, but that this enrichment is most likely driven by NCFs and RoFs.

systems biology↗

Minimum complexity drives regulatory logic in Boolean models of living systems

The properties of random Boolean networks as models of gene regulation have been investigated extensively by the statistical physics community. In the past two decades, there has been a dramatic increase in the reconstruction and analysis of Boolean models of biological networks. In such models, neither network topology nor Boolean functions (or logical update rules) should be expected to be random. In this contribution, we focus on biologically meaningful types of Boolean functions, and perform a systematic study of their preponderance in gene regulatory networks. By applying the k[P] classification based on number of inputs k and bias P of functions, we find that most Boolean functions astonishingly have odd bias in a reference biological dataset of 2687 functions compiled from published models. Subsequently, we are able to explain this observation along with the enrichment of read-once functions (RoFs) and its subset, nested canalyzing functions (NCFs), in the reference dataset in terms of two complexity measures: Boolean complexity based on string lengths in formal logic which is yet unexplored in the biological context, and the average sensitivity. Minimizing the Boolean complexity naturally sifts out a subset of odd-biased Boolean functions which happen to be the RoFs. Finally, we provide an analytical proof that NCFs minimize not only the Boolean complexity, but also the average sensitivity in their k[P] set.

systems biology↗