Predicting trait phenotypes from knowledge of the topology of gene networks

Author:

Beatty Andy,Winkler Christopher R.,Hagen Thomas,Cooper MarkORCID

Abstract

ABSTRACTIn many fields there is interest in manipulating genes and gene networks to realize improved trait phenotypes. The practicality of doing so, however, requires accepted theory on the properties of gene networks that is well-tested by empirical results. The extension of quantitative genetics to include models that incorporate properties of gene networks expands the long tradition of studying epistasis resulting from gene-gene interactions. Here we consider NK models of gene networks by applying concepts from graph theory and Boolean logic theory, motivated by a desire to model the parameters that influence predictive skill for trait phenotypes under the control of gene networks; N defines the number of graph nodes, the number of genes in the network, and K defines the number of edges per node in the graph, representing the gene-gene interactions. We define and consider the attractor period of an NK network as an emergent trait phenotype for our purposes. A long-standing theoretical treatment of the dynamical properties of random Boolean networks suggests a transition from long to short attractor periods as a function of the average node degree K and the bias probability P in the applied Boolean rules. In this paper we investigate the appropriateness of this theory for predicting trait phenotypes on random and real microorganism networks through numerical simulation. We show that: (i) the transition zone between long and short attractor periods depends on the number of network nodes for random networks; (ii) networks derived from metabolic reaction data on microorganisms also show a transition from long to short attractor periods, but at higher values of the bias probability than in random networks with similar numbers of network nodes and average node degree; (iii) the distribution of phenotypes measured on microorganism networks shows more variation than random networks when the bias probability in the Boolean rules is above 0.75; and (iv) the topological structure of networks built from metabolic reaction data is not random, being best approximated, in a statistical sense, by a lognormal distribution. The implications of these results for predicting trait phenotypes where the genetic architecture of a trait is a gene network are discussed.

Publisher

Cold Spring Harbor Laboratory

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3