Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

In Silico Pleiotropy Analysis in KEGG Signaling Networks Using a Boolean Network Model

View through CrossRef
Pleiotropy, which refers to the ability of different mutations on the same gene to cause different pathological effects in human genetic diseases, is important in understanding system-level biological diseases. Although some biological experiments have been proposed, still little is known about pleiotropy on gene–gene dynamics, since most previous studies have been based on correlation analysis. Therefore, a new perspective is needed to investigate pleiotropy in terms of gene–gene dynamical characteristics. To quantify pleiotropy in terms of network dynamics, we propose a measure called in silico Pleiotropic Scores (sPS), which represents how much a gene is affected against a pair of different types of mutations on a Boolean network model. We found that our model can identify more candidate pleiotropic genes that are not known to be pleiotropic than the experimental database. In addition, we found that many types of functionally important genes tend to have higher sPS values than other genes; in other words, they are more pleiotropic. We investigated the relations of sPS with the structural properties in the signaling network and found that there are highly positive relations to degree, feedback loops, and centrality measures. This implies that the structural characteristics are principles to identify new pleiotropic genes. Finally, we found some biological evidence showing that sPS analysis is relevant to the real pleiotropic data and can be considered a novel candidate for pleiotropic gene research. Taken together, our results can be used to understand the dynamics pleiotropic characteristics in complex biological systems in terms of gene–phenotype relations.
Title: In Silico Pleiotropy Analysis in KEGG Signaling Networks Using a Boolean Network Model
Description:
Pleiotropy, which refers to the ability of different mutations on the same gene to cause different pathological effects in human genetic diseases, is important in understanding system-level biological diseases.
Although some biological experiments have been proposed, still little is known about pleiotropy on gene–gene dynamics, since most previous studies have been based on correlation analysis.
Therefore, a new perspective is needed to investigate pleiotropy in terms of gene–gene dynamical characteristics.
To quantify pleiotropy in terms of network dynamics, we propose a measure called in silico Pleiotropic Scores (sPS), which represents how much a gene is affected against a pair of different types of mutations on a Boolean network model.
We found that our model can identify more candidate pleiotropic genes that are not known to be pleiotropic than the experimental database.
In addition, we found that many types of functionally important genes tend to have higher sPS values than other genes; in other words, they are more pleiotropic.
We investigated the relations of sPS with the structural properties in the signaling network and found that there are highly positive relations to degree, feedback loops, and centrality measures.
This implies that the structural characteristics are principles to identify new pleiotropic genes.
Finally, we found some biological evidence showing that sPS analysis is relevant to the real pleiotropic data and can be considered a novel candidate for pleiotropic gene research.
Taken together, our results can be used to understand the dynamics pleiotropic characteristics in complex biological systems in terms of gene–phenotype relations.

Related Results

Some Contributions to Boolean like near Rings
Some Contributions to Boolean like near Rings
In this paper we extend Foster’s Boolean-like ring to Near-rings. We introduce the concept of a Boolean like near-ring.  A near-ring N is said to be a Boolean-like near-ring if ...
The Geography of Cyberspace
The Geography of Cyberspace
The Virtual and the Physical The structure of virtual space is a product of the Internet’s geography and technology. Debates around the nature of the virtual — culture, s...
A Note on Boolean Like Algebras
A Note on Boolean Like Algebras
In this paper we develop on abstract system: viz Boolean-like algebra and prove that every Boolean  algebra is a Boolean-like algebra.  A necessary and sufficient condition for a B...
Optimizing IETF multimedia signaling protocols and architectures in 3GPP networks : an evolutionary approach
Optimizing IETF multimedia signaling protocols and architectures in 3GPP networks : an evolutionary approach
Signaling in Next Generation IP-based networks heavily relies in the family of multimedia signaling protocols defined by IETF. Two of these signaling protocols are RTSP and SIP, wh...
Antagonistic, synergistic, and social pleiotropy in microbial cheaters
Antagonistic, synergistic, and social pleiotropy in microbial cheaters
AbstractCooperation is widespread among microbes. One mechanism proposed to constrain cheating is antagonistic pleiotropy, wherein mutations that cause defection from cooperation, ...
Ingres : from single-cell RNA-seq data to single-cell probabilistic Boolean networks
Ingres : from single-cell RNA-seq data to single-cell probabilistic Boolean networks
Abstract Motivation The current explosion of ’omics data has provided scientists with an unique opportunity to elucidate the in...
Abstract B2-29: The reverse control of colorectal tumorigenesis based on Boolean network modeling of human signaling network
Abstract B2-29: The reverse control of colorectal tumorigenesis based on Boolean network modeling of human signaling network
Abstract The intracellular processes are governed by a signal transduction network composed of complex interactions of a number of signaling proteins and various hum...
On the sensitivity to noise of a Boolean function
On the sensitivity to noise of a Boolean function
In this paper we generate upper and lower bounds for the sensitivity to noise of a Boolean function using relaxed assumptions on input choices and noise. The robustness of a Boolea...

Back to Top