Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Z. S. Wallace

dblp:236/6581 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › network bioinformatics › biological network analysis
gene interaction network
0.412019
On entropy and information in gene interaction networks · Bioinform. 2019
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
gene set enrichment analysis
0.412019
On entropy and information in gene interaction networks · Bioinform. 2019
Information theory › information measures › shannon information measures
entropy and mutual information
0.112019
On entropy and information in gene interaction networks · Bioinform. 2019

Methods — techniques the papers use, named apart from their topics

mutual information · 0.8interaction information · 0.8harmonic oscillator model · 0.8entropy · 0.8
YearPublicationVenuePosition
2019 On entropy and information in gene interaction networks
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.
Z. S. Wallace, Sara Brin Rosenthal, Kathleen M. Fisch, Trey Ideker, Roman Sásik
Bioinform.1