On entropy and information in gene interaction networks

Author:

Wallace Z S1,Rosenthal S B2,Fisch K M2ORCID,Ideker T3,Sasik R2ORCID

Affiliation:

1. Department of Mathematics, Tufts University School of Arts and Sciences, Medford, MA, USA

2. Department of Medicine, Center for Computational Biology and Bioinformatics, University of California San Diego, La Jolla, CA, USA

3. Department of Medicine, University of California San Diego, La Jolla, CA, USA

Abstract

Abstract Motivation Modern biological experiments often produce candidate lists of genes presumably related to the studied phenotype. One can ask if the gene list as a whole makes sense in the context of existing knowledge: Are the genes in the list reasonably related to each other or do they look like a random assembly? There are also situations when one wants to know if two or more gene sets are closely related. Gene enrichment tests based on counting the number of genes two sets have in common are adequate if we presume that two genes are related only when they are in fact identical. If by related we mean well connected in the interaction network space, we need a new measure of relatedness for gene sets. Results We derive entropy, interaction information and mutual information for gene sets on interaction networks, starting from a simple phenomenological model of a living cell. Formally, the model describes a set of interacting linear harmonic oscillators in thermal equilibrium. Because the energy function is a quadratic form of the degrees of freedom, entropy and all other derived information quantities can be calculated exactly. We apply these concepts to estimate the probability that genes from several independent genome-wide association studies are not mutually informative; to estimate the probability that two disjoint canonical metabolic pathways are not mutually informative; and to infer relationships among human diseases based on their gene signatures. We show that the present approach is able to predict observationally validated relationships not detectable by gene enrichment methods. The converse is also true; the two methods are therefore complementary. Availability and implementation The functions defined in this paper are available in an R package, gsia, available for download at https://github.com/ucsd-ccbb/gsia.

Funder

NIH

UC San Diego Clinical and Translational Research Institute

National Resource for Network Biology

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Reference38 articles.

1. Brain insulin resistance in type 2 diabetes and Alzheimer disease: concepts and conundrums;Arnold;Nat. Rev. Neurol,2018

2. Controlling the false discovery rate: a practical and powerful approach to multiple testing;Benjamini;J. R. Stat. Soc. Ser. B,1995

3. Network-based classification of breast cancer metastasis;Chuang;Mol. Syst. Biol,2007

4. Shotgun bisulphite sequencing of the Arabidopsis genome reveals DNA methylation patterning;Cokus;Nature,2008

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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