Prognostic alternative splicing signature in cervical squamous cell carcinoma

Basing on alternative splicing events (ASEs) databases, the authors herein aim to explore potential prognostic biomarkers for cervical squamous cell carcinoma (CESC). mRNA expression profiles and relevant clinical data of 223 patients with CESC were obtained from The Cancer Genome Atlas (TCGA). Correlated genes, ASEs and percent‐splice‐in (PSI) were downloaded from SpliceSeq, respectively. The PSI values of survival‐associated alternative splicing events (SASEs) were used to construct the basis of a prognostic index (PI). A protein–protein interaction (PPI) network of genes related to SASEs was generated by STRING and analysed with Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG). Consequently, 41,776 ASEs were discovered in 19,724 genes, 2596 of which linked with 3669 SASEs. The PPI network of SASEs related genes revealed that TP53 and UBA52 were core genes. The low‐risk group had a longer survival period than high‐risk counterparts, both groups being defined according to PI constructed upon the top 20 splicing events or PI on the overall splicing events. The AUC value of ROC reached up to 0.88, demonstrating the prognostic potential of PI in CESC. These findings suggested that ASEs involve in the pathogenesis of CESC and may serve as promising prognostic biomarkers for this female malignancy.Inspec keywords: gynaecology, molecular biophysics, genomics, proteins, cellular biophysics, genetics, medical computing, cancer, ontologies (artificial intelligence), RNAOther keywords: protein‐protein interaction network, CESC pathogenesis, gene ontology, Kyoto‐encyclopedia‐of‐genes‐and‐genomes, SASEs related genes, PPI network, survival‐associated alternative splicing events, PSI values, percent‐splice‐in, Cancer Genome Atlas, mRNA expression profiles, prognostic biomarkers, alternative splicing events databases, cervical squamous cell carcinoma, prognostic alternative splicing signature     

Mining conditions specific hub genes from RNA‐Seq gene‐expression data via biclustering and their application to drug discovery

Gene‐expression data is being widely used for various clinical research. It represents expression levels of thousands of genes across the various experimental conditions simultaneously. Mining conditions specific hub genes from gene‐expression data is a challenging task. Conditions specific hub genes signify the functional behaviour of bicluster across the subset of conditions and can act as prognostic or diagnostic markers of the diseases. In this study, the authors have introduced a new approach for identifying conditions specific hub genes from the RNA‐Seq data using a biclustering algorithm. In the proposed approach, efficient ‘runibic’ biclustering algorithm, the concept of gene co‐expression network and concept of protein–protein interaction network have been used for getting better performance. The result shows that the proposed approach extracts biologically significant conditions specific hub genes which play an important role in various biological processes and pathways. These conditions specific hub genes can be used as prognostic or diagnostic biomarkers. Conditions specific hub genes will be helpful to reduce the analysis time and increase the accuracy of further research. Also, they summarised application of the proposed approach to the drug discovery process.Inspec keywords: proteins, data mining, cellular biophysics, drugs, genetics, diseases, RNA, medical computing, biology computing, molecular biophysicsOther keywords: experimental conditions, mining conditions specific hub genes, identifying conditions specific hub genes, RNA‐Seq data, gene co‐expression network, significant conditions specific hub genes, RNA‐Seq gene‐expression data     

Network‐based method for detecting dysregulated pathways in glioblastoma cancer

The knowledge on the biological molecular mechanisms underlying cancer is important for the precise diagnosis and treatment of cancer patients. Detecting dysregulated pathways in cancer can provide insights into the mechanism of cancer and help to detect novel drug targets. Based on the wide existing mutual exclusivity among mutated genes and the interrelationship between gene mutations and expression changes, this study presents a network‐based method to detect the dysregulated pathways from gene mutations and expression data of the glioblastoma cancer. First, the authors construct a gene network based on mutual exclusivity between each pair of genes and the interaction between gene mutations and expression changes. Then they detect all complete subgraphs using CFinder clustering algorithm in the constructed gene network. Next, the two gene sets whose overlapping scores are above a specific threshold are merged. Finally, they obtain two dysregulated pathways in which there are glioblastoma‐related multiple genes which are closely related to the two subtypes of glioblastoma. The results show that one dysregulated pathway revolving around epidermal growth factor receptor is likely to be associated with the primary subtype of glioblastoma, and the other dysregulated pathway revolving around TP53 is likely to be associated with the secondary subtype of glioblastoma.Inspec keywords: cancer, tumours, drugs, brain, neurophysiology, genetic algorithms, genetics, skin, proteins, molecular biophysics, genomics, patient diagnosis, molecular configurationsOther keywords: network‐based method, dysregulated pathways detection, glioblastoma cancer, biological molecular mechanisms, precise diagnosis, cancer patient treatment, drug targets, mutual exclusivity, mutated genes, gene mutations, expression changes, expression data, CFinder clustering algorithm, constructed gene network, gene sets, overlapping scores, glioblastoma‐related multiple genes, epidermal growth factor receptor, TP53, secondary subtype     

In silico identification of potential targets and drugs for non‐small cell lung cancer

Lung cancer is one of the leading causes of death in both the USA and Taiwan, and it is thought that the cause of cancer could be because of the gain of function of an oncoprotein or the loss of function of a tumour suppressor protein. Consequently, these proteins are potential targets for drugs. In this study, differentially expressed genes are identified, via an expression dataset generated from lung adenocarcinoma tumour and adjacent non‐tumour tissues. This study has integrated many complementary resources, that is, microarray, protein‐protein interaction and protein complex. After constructing the lung cancer protein‐protein interaction network (PPIN), the authors performed graph theory analysis of PPIN. Highly dense modules are identified, which are potential cancer‐associated protein complexes. Up‐ and down‐regulated communities were used as queries to perform functional enrichment analysis. Enriched biological processes and pathways are determined. These sets of up‐ and down‐regulated genes were submitted to the Connectivity Map web resource to identify potential drugs. The authors'' findings suggested that eight drugs from DrugBank and three drugs from NCBI can potentially reverse certain up‐ and down‐regulated genes'' expression. In conclusion, this study provides a systematic strategy to discover potential drugs and target genes for lung cancer.Inspec keywords: cellular biophysics, lung, cancer, drugs, genetics, tumours, lab‐on‐a‐chip, proteins, molecular biophysics, graph theory, query processing, medical computingOther keywords: down‐regulated gene expression, up‐regulated gene expression, potential target genes, DrugBank, potential drugs, connectivity map Web resource, biological processes, functional enrichment analysis, up‐regulated communities, down‐regulated communities, cancer‐associated protein complexes, k‐communities, highly‐dense modules, PPIN, graph theory analysis, lung cancer protein‐protein interaction network, MIPS, BioGrid, ArrayExpress, microarray, nontumour tissues, human lung adenocarcinoma tumour, bioconductor package, tumour suppressor protein, oncoprotein, nonsmall cell lung cancer, in silico identification     

Weighted gene co expression network analysis (WGCNA) with key pathways and hub‐genes related to micro RNAs in ischemic stroke

Ischemic stroke (IS) is one of the major causes of death and disability worldwide. However, the specific mechanism of gene interplay and the biological function in IS are not clear. Therefore, more research into IS is necessary. Dataset {"type":"entrez-geo","attrs":{"text":"GSE110993","term_id":"110993"}}GSE110993 including 20 ischemic stroke (IS) and 20 control specimens are used to establish both groups and the raw RNA‐seq data were analysed. Weighted gene co‐expression network analysis (WGCNA) was used to screen the key micro‐RNA modules. The centrality of key genes were determined by module membership (mm) and gene significance (GS). The key pathways were identified by enrichment analysis with Kyoto Protocol Gene and Genome Encyclopedia (KEGG), and the key genes were validated by protein‐protein interactions network. Result: Upon investigation, 1185 up‐ and down‐regulated genes were gathered and distributed into three modules in response to their degree of correlation to clinical traits of IS, among which the turquoise module show a trait‐correlation of 0.77. The top 140 genes were further identified by GS and MM. KEGG analysis showed two pathways may evolve in the progress of IS. Discussion: CXCL12 and EIF2a may be important biomarkers for the accurate diagnosis and treatment in IS.     

Lung cancer prediction from microarray data by gene expression programming

Lung cancer is a leading cause of cancer‐related death worldwide. The early diagnosis of cancer has demonstrated to be greatly helpful for curing the disease effectively. Microarray technology provides a promising approach of exploiting gene profiles for cancer diagnosis. In this study, the authors propose a gene expression programming (GEP)‐based model to predict lung cancer from microarray data. The authors use two gene selection methods to extract the significant lung cancer related genes, and accordingly propose different GEP‐based prediction models. Prediction performance evaluations and comparisons between the authors’ GEP models and three representative machine learning methods, support vector machine, multi‐layer perceptron and radial basis function neural network, were conducted thoroughly on real microarray lung cancer datasets. Reliability was assessed by the cross‐data set validation. The experimental results show that the GEP model using fewer feature genes outperformed other models in terms of accuracy, sensitivity, specificity and area under the receiver operating characteristic curve. It is concluded that GEP model is a better solution to lung cancer prediction problems.Inspec keywords: lung, cancer, medical diagnostic computing, patient diagnosis, genetic algorithms, feature selection, learning (artificial intelligence), support vector machines, multilayer perceptrons, radial basis function networks, reliability, sensitivity analysisOther keywords: lung cancer prediction, cancer‐related death, cancer diagnosis, gene profiles, gene expression programming‐based model, gene selection, GEP‐based prediction models, prediction performance evaluations, representative machine learning methods, support vector machine, multilayer perceptron, radial basis function neural network, real microarray lung cancer datasets, cross‐data set validation, reliability, receiver operating characteristic curve     

Overlapping functional modules detection in PPI network with pair‐wise constrained non‐negative matrix tri‐factorisation

A large amount of available protein–protein interaction (PPI) data has been generated by high‐throughput experimental techniques. Uncovering functional modules from PPI networks will help us better understand the underlying mechanisms of cellular functions. Numerous computational algorithms have been designed to identify functional modules automatically in the past decades. However, most community detection methods (non‐overlapping or overlapping types) are unsupervised models, which cannot incorporate the well‐known protein complexes as a priori. The authors propose a novel semi‐supervised model named pairwise constrains nonnegative matrix tri‐factorisation (PCNMTF), which takes full advantage of the well‐known protein complexes to find overlapping functional modules based on protein module indicator matrix and module correlation matrix simultaneously from PPI networks. PCNMTF determinately models and learns the mixed module memberships of each protein by considering the correlation among modules simultaneously based on the non‐negative matrix tri‐factorisation. The experiment results on both synthetic and real‐world biological networks demonstrate that PCNMTF gains more precise functional modules than that of state‐of‐the‐art methods.Inspec keywords: proteins, molecular biophysics, cellular biophysics, matrix algebraOther keywords: overlapping functional module detection, PPI network, pair‐wise constrained nonnegative matrix trifactorisation, protein–protein interaction data, cellular functions, protein complexes, real‐world biological networks, synthetic biological networks     

Identification of essential proteins based on a new combination of topological and biological features in weighted protein–protein interaction networks

The identification of essential proteins in protein–protein interaction (PPI) networks is not only important in understanding the process of cellular life but also useful in diagnosis and drug design. The network topology‐based centrality measures are sensitive to noise of network. Moreover, these measures cannot detect low‐connectivity essential proteins. The authors have proposed a new method using a combination of topological centrality measures and biological features based on statistical analyses of essential proteins and protein complexes. With incomplete PPI networks, they face the challenge of false‐positive interactions. To remove these interactions, the PPI networks are weighted by gene ontology. Furthermore, they use a combination of classifiers, including the newly proposed measures and traditional weighted centrality measures, to improve the precision of identification. This combination is evaluated using the logistic regression model in terms of significance levels. The proposed method has been implemented and compared to both previous and more recent efficient computational methods using six statistical standards. The results show that the proposed method is more precise in identifying essential proteins than the previous methods. This level of precision was obtained through the use of four different data sets: YHQ‐W, YMBD‐W, YDIP‐W and YMIPS‐W.Inspec keywords: proteins, drugs, biology computing, ontologies (artificial intelligence), topologyOther keywords: biological features, weighted protein–protein interaction networks, network topology‐based centrality measures, low‐connectivity essential proteins, topological centrality measures, protein complexes, incomplete PPI networks, weighted centrality measures, YHQ‐W dataset, YMBD‐W dataset, YDIP‐W dataset, YMIPS‐W dataset     

Biclustering‐based association rule mining approach for predicting cancer‐associated protein interactions

Protein–protein interactions (PPIs) have been widely used to understand different biological processes and cellular functions associated with several diseases like cancer. Although some cancer‐related protein interaction databases are available, lack of experimental data and conflicting PPI data among different available databases have slowed down the cancer research. Therefore, in this study, the authors have focused on various proteins that are directly related to different types of cancer disease. They have prepared a PPI database between cancer‐associated proteins with the rest of the human proteins. They have also incorporated the annotation type and direction of each interaction. Subsequently, a biclustering‐based association rule mining algorithm is applied to predict new interactions with type and direction. This study shows the prediction power of association rule mining algorithm over the traditional classifier model without choosing a negative data set. The time complexity of the biclustering‐based association rule mining is also analysed and compared to traditional association rule mining. The authors are able to discover 38 new PPIs which are not present in the cancer database. The biological relevance of these newly predicted interactions is analysed by published literature. Recognition of such interactions may accelerate a way of developing new drugs to prevent different cancer‐related diseases.Inspec keywords: cancer, medical computing, data mining, proteins, genetics, pattern clusteringOther keywords: biological processes, cancer‐related diseases, cancer research, cancer‐related protein interaction databases, protein–protein interactions, cancer‐associated protein interactions, biclustering‐based association rule mining approach, negative data set, annotation type, human proteins, cancer‐associated proteins, PPI database, cancer disease     

Nano–bio surface interactions,cellular internalisation in cancer cells and e‐data portals of nanomaterials: A review

Nanomaterials (NMs) have abundant applications in areas such as electronics, energy, environment industries, biosensors, nano devices, theranostic platforms, etc. Nanoparticles can increase the solubility and stability of drug‐loaded materials, enhance their internalisation, protect them from initial destruction in the biological system, and lengthen their circulation time. The biological interaction of proteins present in the body fluid with NMs can change the activity and natural surface properties of NMs. The size and charge of NMs, properties of the coated and uncoated NMs, nature of proteins, cellular interactions direct their internalisation pathway in the cellular system. Thus, the present review emphasises the impact of coated, uncoated NMs, size and charge, nature of proteins on nano–bio surface interactions and on internalisation with specific focus on cancer cells. The increased activity of NPs may also result in toxicity on health and environment, thus emphasis should be given to assess the toxicity of NMs in the medical field. The e‐data sharing portals of NMs have also been discussed in this review that will be helpful in providing the information about the chemical, physical, biological properties and toxicity of NMs.     

Identification of self‐regulatory network motifs in reverse engineering gene regulatory networks using microarray gene expression data

Gene Regulatory Networks (GRNs) are reconstructed from the microarray gene expression data through diversified computational approaches. This process ensues in symmetric and diagonal interaction of gene pairs that cannot be modelled as direct activation, inhibition, and self‐regulatory interactions. The values of gene co‐expressions could help in identifying co‐regulations among them. The proposed approach aims at computing the differences in variances of co‐expressed genes rather than computing differences in values of mean expressions across experimental conditions. It adopts multivariate co‐variances using principal component analysis (PCA) to predict an asymmetric and non‐diagonal gene interaction matrix, to select only those gene pair interactions that exhibit the maximum variances in gene regulatory expressions. The asymmetric gene regulatory interactions help in identifying the controlling regulatory agents, thus lowering the false positive rate by minimizing the connections between previously unlinked network components. The experimental results on real as well as in silico datasets including time‐series RTX therapy, Arabidopsis thaliana, DREAM‐3, and DREAM‐8 datasets, in comparison with existing state‐of‐the‐art approaches demonstrated the enhanced performance of the proposed approach for predicting positive and negative feedback loops and self‐regulatory interactions. The generated GRNs hold the potential in determining the real nature of gene pair regulatory interactions.Inspec keywords: molecular biophysics, principal component analysis, genetics, biology computing, reverse engineeringOther keywords: controlling regulatory agents, interacting genes, unlinked network components, self‐regulatory interactions, gene pair regulatory interactions, self‐regulatory network motifs, reverse engineering gene regulatory networks, microarray gene expression data, diversified computational approaches, symmetric interaction, diagonal interaction, gene pairs, gene co‐expressions, co‐expressed genes, mean expressions, gene regulatory expressions, asymmetric gene regulatory interactions     

Identify asthma genes across three phases based on protein–protein interaction network

Asthma is a common inflammatory disease that is generally caused by genetic mutations or environmental factors. Recently, the emerging of omics data provides an alternative way to understand asthma. In this study, the authors present a new framework to detect asthma disease genes based on protein–protein interaction network (PPIN) and gene expression. Specifically, they construct PPINs for different stages of asthma, and detect those interactions occurred in the specific stages. By investigating the proteins in these stage‐specific interactions, they find they are more likely related to asthma, and the functional enrichment analysis indicate that the pathways enriched in the differential interactions are related to the progress of asthma. Moreover, some proteins in the differential interactions have been previously reported to be related to asthma in the literature, implying the usefulness of the proposed approach.Inspec keywords: genomics, proteins, molecular biophysics, lung, pneumodynamics, diseases, genetics, molecule‐molecule reactions, molecule‐molecule collisionsOther keywords: asthma gene identification, three‐phase gene identification, protein–protein interaction network, common inflammatory disease, genetic mutation‐caused disease, environmental factors, asthma‐associated omics data, asthma disease gene detection, PPIN construction, asthma gene expression, asthma stages, stage‐specific interaction proteins, asthma stage‐specific interactions, asthma‐related interactions, functional enrichment analysis, asthma progress‐related differential interactions, differential interaction proteins     

Gaussian graphical model for identifying significantly responsive regulatory networks from time course high‐throughput data

With rapid accumulation of functional relationships between biological molecules, knowledge‐based networks have been constructed and stocked in many databases. These networks provide curated and comprehensive information for functional linkages among genes and proteins, whereas their activities are highly related with specific phenotypes and conditions. To evaluate a knowledge‐based network in a specific condition, the consistency between its structure and conditionally specific gene expression profiling data are an important criterion. In this study, the authors propose a Gaussian graphical model to evaluate the documented regulatory networks by the consistency between network architectures and time course gene expression profiles. They derive a dynamic Bayesian network model to evaluate gene regulatory networks in both simulated and true time course microarray data. The regulatory networks are evaluated by matching network structure with gene expression to achieve consistency measurement. To demonstrate the effectiveness of the authors method, they identify significant regulatory networks in response to the time course of circadian rhythm. The knowledge‐based networks are screened and ranked by their structural consistencies with dynamic gene expression profiling.Inspec keywords: Bayes methods, biology computing, circadian rhythms, Gaussian processes, genetics, genomics, graphs, molecular biophysics, proteinsOther keywords: Gaussian graphical model, responsive regulatory networks, time course high‐throughput data, biological molecules, dynamic gene expression proflling, circadian rhythm, consistency measurement, matching network structure, simulated time course microarray data, true time course microarray data, dynamic Bayesian network model, time course gene expression proflles, network architectures, documented regulatory networks, speciflc gene expression proflling data, phenotypes, proteins, functional linkages, databases, knowledge‐based networks