Extracting Gradual Rules to reveal regulation between genes

2020 ◽  
Vol 15 ◽  
Author(s):  
Manel Gouider ◽  
Ines Hamdi ◽  
Henda Ben Ghezala
Keyword(s):  
Gene Expression ◽  
Gene Expression Data ◽  
High Throughput ◽  
Explicit Knowledge ◽  
Biological Data ◽  
Genetic Interactions ◽  
Human Lung Cancer ◽  
Biological Knowledge ◽  
Good Representation ◽  
Expression Data

Background: The gene regulation represents a very complex mechanism produced in the cell in order to increase or decrease the gene expression. This regulation of genes forms a Gene regulatory Network GRN composed of a collection of genes and products of genes in interaction. The high throughput technologies that generate a huge volume of gene expression data are useful for analyzing the GRN. The biologists are interested in the relevant genetic knowledge hidden in these data sources. Although, the knowledge extracted by the different data mining approaches of the literature are insufficient for inferring the GRN topology or do not give a good representation of the real genetic regulation in the cell. Objective: In this work, we are interested in the extraction of genetic interactions from the high throughput technologies, such as the microarrays or DNA chips. Methods: In this paper, in order to extract expressive and explicit knowledge about the interactions between genes, we use the method of gradual patterns and rules extraction applied on numerical data that extracts the frequent co-variations between gene expression values. Furthermore, we choose to integrate experimental biological data and biological knowledge in the process of knowledge extraction of genetic interactions. Results: The validation results on real gene expression data of the model plant Arabidopsis and human lung cancer shows the performance of this approach. Conclusion: The extracted gradual rules express the genetic interactions composed a GRN, these rules help to understand complex systems and cellular functions.

scholarly journals A dynamic programing approach to integrate gene expression data and network information for pathway model generation

2019 ◽  
Vol 36 (1) ◽  
pp. 169-176 ◽  
Author(s):  
Yuexu Jiang ◽  
Yanchun Liang ◽  
Duolin Wang ◽  
Dong Xu ◽  
Trupti Joshi
Keyword(s):  
Gene Expression ◽  
Lung Cancer ◽  
Gene Expression Data ◽  
Biological Data ◽  
Human Lung Cancer ◽  
Supplementary Information ◽  
Model Generation ◽  
Expression Data ◽  
Pathway Model ◽  
Dynamic Programing

Abstract Motivation As large amounts of biological data continue to be rapidly generated, a major focus of bioinformatics research has been aimed toward integrating these data to identify active pathways or modules under certain experimental conditions or phenotypes. Although biologically significant modules can often be detected globally by many existing methods, it is often hard to interpret or make use of the results toward pathway model generation and testing. Results To address this gap, we have developed the IMPRes algorithm, a new step-wise active pathway detection method using a dynamic programing approach. IMPRes takes advantage of the existing pathway interaction knowledge in Kyoto Encyclopedia of Genes and Genomes. Omics data are then used to assign penalties to genes, interactions and pathways. Finally, starting from one or multiple seed genes, a shortest path algorithm is applied to detect downstream pathways that best explain the gene expression data. Since dynamic programing enables the detection one step at a time, it is easy for researchers to trace the pathways, which may lead to more accurate drug design and more effective treatment strategies. The evaluation experiments conducted on three yeast datasets have shown that IMPRes can achieve competitive or better performance than other state-of-the-art methods. Furthermore, a case study on human lung cancer dataset was performed and we provided several insights on genes and mechanisms involved in lung cancer, which had not been discovered before. Availability and implementation IMPRes visualization tool is available via web server at http://digbio.missouri.edu/impres. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Application of Biological Domain Knowledge Based Feature Selection on Gene Expression Data

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 2
Author(s):  
Malik Yousef ◽  
Abhishek Kumar ◽  
Burcu Bakir-Gungor
Keyword(s):  
Gene Expression ◽  
Feature Selection ◽  
Data Analysis ◽  
Gene Expression Data ◽  
Gene Selection ◽  
Biological Data ◽  
Biological Information ◽  
Background Information ◽  
Biological Knowledge ◽  
Expression Data

In the last two decades, there have been massive advancements in high throughput technologies, which resulted in the exponential growth of public repositories of gene expression datasets for various phenotypes. It is possible to unravel biomarkers by comparing the gene expression levels under different conditions, such as disease vs. control, treated vs. not treated, drug A vs. drug B, etc. This problem refers to a well-studied problem in the machine learning domain, i.e., the feature selection problem. In biological data analysis, most of the computational feature selection methodologies were taken from other fields, without considering the nature of the biological data. Thus, integrative approaches that utilize the biological knowledge while performing feature selection are necessary for this kind of data. The main idea behind the integrative gene selection process is to generate a ranked list of genes considering both the statistical metrics that are applied to the gene expression data, and the biological background information which is provided as external datasets. One of the main goals of this review is to explore the existing methods that integrate different types of information in order to improve the identification of the biomolecular signatures of diseases and the discovery of new potential targets for treatment. These integrative approaches are expected to aid the prediction, diagnosis, and treatment of diseases, as well as to enlighten us on disease state dynamics, mechanisms of their onset and progression. The integration of various types of biological information will necessitate the development of novel techniques for integration and data analysis. Another aim of this review is to boost the bioinformatics community to develop new approaches for searching and determining significant groups/clusters of features based on one or more biological grouping functions.

scholarly journals Application of Biological Domain Knowledge Based Feature Selection on Gene Expression Data

2020 ◽  
Author(s):  
Malik Yousef ◽  
Abhishek Kumar ◽  
Burcu Bakir-Gungor
Keyword(s):  
Gene Expression ◽  
Feature Selection ◽  
Data Analysis ◽  
Gene Expression Data ◽  
Gene Selection ◽  
Selection Process ◽  
Biological Data ◽  
Integrative Approach ◽  
Biological Knowledge ◽  
Expression Data

In the last two decades, there have been massive advancements in high throughput technologies, which resulted in the exponential growth of public repositories of gene expression datasets for various phenotypes. It is possible to unravel biomarkers by comparing the gene expression levels under different conditions, such as disease vs. control, treated vs. not treated, drug A vs. drug B, etc. This problem refers to a well-studied problem in the machine learning domain, i.e., the feature selection problem. In biological data analysis, most of the computational feature selection methodologies were taken from other fields, without considering the nature of the biological data. For gene expression data analysis, most of the existing feature selection methods rely on expression values alone to select the genes; and biological knowledge is integrated at the end of the analysis in order to gain biological insights or to support the initial findings. Thus, integrative approaches that utilize the biological knowledge while performing feature selection are necessary for this kind of data. The main idea behind the integrative gene selection process is to generate a ranked list of genes considering both the statistical metrics that are applied to the gene expression data, and the biological background information which is provided as external datasets. Since the integrative approach attracted attention in the gene expression domain, lately the gene selection process shifted from being purely data-centric to more incorporative analysis with additional biological knowledge.

scholarly journals Clustering of gene expression profiles: creating initialization-independent clusterings by eliminating unstable genes

2010 ◽  
Vol 7 (3) ◽  
Author(s):  
Wim De Mulder ◽  
Martin Kuiper ◽  
René Boel
Keyword(s):  
Gene Expression ◽  
Gene Expression Data ◽  
Expression Profiles ◽  
Clustering Algorithms ◽  
Gene Expression Profiles ◽  
Biological Data ◽  
Biological Knowledge ◽  
Expression Data ◽  
Data Set ◽  
Cluster Membership

SummaryClustering is an important approach in the analysis of biological data, and often a first step to identify interesting patterns of coexpression in gene expression data. Because of the high complexity and diversity of gene expression data, many genes cannot be easily assigned to a cluster, but even if the dissimilarity of these genes with all other gene groups is large, they will finally be forced to become member of a cluster. In this paper we show how to detect such elements, called unstable elements. We have developed an approach for iterative clustering algorithms in which unstable elements are deleted, making the iterative algorithm less dependent on initial centers. Although the approach is unsupervised, it is less likely that the clusters into which the reduced data set is subdivided contain false positives. This clustering yields a more differentiated approach for biological data, since the cluster analysis is divided into two parts: the pruned data set is divided into highly consistent clusters in an unsupervised way and the removed, unstable elements for which no meaningful cluster exists in unsupervised terms can be given a cluster with the use of biological knowledge and information about the likelihood of cluster membership. We illustrate our framework on both an artificial and real biological data set.

On the limits of active module identification

2021 ◽  
Author(s):  
Olga Lazareva ◽  
Jan Baumbach ◽  
Markus List ◽  
David B Blumenthal
Keyword(s):  
Gene Expression ◽  
Gene Expression Data ◽  
Small Diameter ◽  
Extensive Study ◽  
Biological Knowledge ◽  
Expression Data ◽  
Module Identification ◽  
Ppi Networks ◽  
Novel Algorithms ◽  
Context Specific

Abstract In network and systems medicine, active module identification methods (AMIMs) are widely used for discovering candidate molecular disease mechanisms. To this end, AMIMs combine network analysis algorithms with molecular profiling data, most commonly, by projecting gene expression data onto generic protein–protein interaction (PPI) networks. Although active module identification has led to various novel insights into complex diseases, there is increasing awareness in the field that the combination of gene expression data and PPI network is problematic because up-to-date PPI networks have a very small diameter and are subject to both technical and literature bias. In this paper, we report the results of an extensive study where we analyzed for the first time whether widely used AMIMs really benefit from using PPI networks. Our results clearly show that, except for the recently proposed AMIM DOMINO, the tested AMIMs do not produce biologically more meaningful candidate disease modules on widely used PPI networks than on random networks with the same node degrees. AMIMs hence mainly learn from the node degrees and mostly fail to exploit the biological knowledge encoded in the edges of the PPI networks. This has far-reaching consequences for the field of active module identification. In particular, we suggest that novel algorithms are needed which overcome the degree bias of most existing AMIMs and/or work with customized, context-specific networks instead of generic PPI networks.

scholarly journals Graph Convolutional Network for Drug Response Prediction Using Gene Expression Data

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 772
Author(s):  
Seonghun Kim ◽  
Seockhun Bae ◽  
Yinhua Piao ◽  
Kyuri Jo
Keyword(s):  
Gene Expression ◽  
Gene Expression Data ◽  
Large Scale ◽  
Drug Response ◽  
Response Prediction ◽  
Biological Data ◽  
Expression Data ◽  
Convolutional Network ◽  
Essential Information ◽  
Protein Protein Interaction

Genomic profiles of cancer patients such as gene expression have become a major source to predict responses to drugs in the era of personalized medicine. As large-scale drug screening data with cancer cell lines are available, a number of computational methods have been developed for drug response prediction. However, few methods incorporate both gene expression data and the biological network, which can harbor essential information about the underlying process of the drug response. We proposed an analysis framework called DrugGCN for prediction of Drug response using a Graph Convolutional Network (GCN). DrugGCN first generates a gene graph by combining a Protein-Protein Interaction (PPI) network and gene expression data with feature selection of drug-related genes, and the GCN model detects the local features such as subnetworks of genes that contribute to the drug response by localized filtering. We demonstrated the effectiveness of DrugGCN using biological data showing its high prediction accuracy among the competing methods.

Co-expressional conservation in virulence and stress related genes of three Gammaproteobacterial species: Escherichia coli, Salmonella enterica and Pseudomonas aeruginosa

2015 ◽  
Vol 11 (11) ◽  
pp. 3137-3148
Author(s):  
Nazanin Hosseinkhan ◽  
Peyman Zarrineh ◽  
Hassan Rokni-Zadeh ◽  
Mohammad Reza Ashouri ◽  
Ali Masoudi-Nejad
Keyword(s):  
Gene Expression ◽  
Escherichia Coli ◽  
Pseudomonas Aeruginosa ◽  
Systems Biology ◽  
Gene Expression Data ◽  
High Throughput ◽  
Expression Data ◽  
P Gene ◽  
Stress Related Genes ◽  
High Throughput Gene Expression

Gene co-expression analysis is one of the main aspects of systems biology that uses high-throughput gene expression data.

ENTROPY-BASED CLUSTER VALIDATION AND ESTIMATION OF THE NUMBER OF CLUSTERS IN GENE EXPRESSION DATA

2012 ◽  
Vol 10 (05) ◽  
pp. 1250011
Author(s):  
NATALIA NOVOSELOVA ◽  
IGOR TOM
Keyword(s):  
Gene Expression ◽  
Gene Expression Data ◽  
Clustering Algorithm ◽  
Selection Procedure ◽  
Biological Knowledge ◽  
Consensus Clustering ◽  
Expression Data ◽  
Cluster Validation ◽  
Number Of Clusters ◽  
Validity Measure

Many external and internal validity measures have been proposed in order to estimate the number of clusters in gene expression data but as a rule they do not consider the analysis of the stability of the groupings produced by a clustering algorithm. Based on the approach assessing the predictive power or stability of a partitioning, we propose the new measure of cluster validation and the selection procedure to determine the suitable number of clusters. The validity measure is based on the estimation of the "clearness" of the consensus matrix, which is the result of a resampling clustering scheme or consensus clustering. According to the proposed selection procedure the stable clustering result is determined with the reference to the validity measure for the null hypothesis encoding for the absence of clusters. The final number of clusters is selected by analyzing the distance between the validity plots for initial and permutated data sets. We applied the selection procedure to estimate the clustering results on several datasets. As a result the proposed procedure produced an accurate and robust estimate of the number of clusters, which are in agreement with the biological knowledge and gold standards of cluster quality.

Sign in / Sign up

Export Citation Format

Share Document