Prediction of potential drivers connecting different dysfunctional levels in lung adenocarcinoma via a protein-protein interaction network

Identification of Novel Lung Cancer Driver Genes Connecting Different Omics Levels With a Heat Diffusion Algorithm

Cancer driver gene is a type of gene with abnormal alterations that initiate or promote tumorigenesis. Driver genes can be used to reveal the fundamental pathological mechanisms of tumorigenesis. These genes may have pathological changes at different omics levels. Thus, identifying cancer driver genes involving two or more omics levels is essential. In this study, a computational investigation was conducted on lung cancer driver genes. Four omics levels, namely, epigenomics, genomics, transcriptomics, and post-transcriptomics, were involved. From the driver genes at each level, the Laplacian heat diffusion algorithm was executed on a protein–protein interaction network for discovering latent driver genes at this level. A following screen procedure was performed to extract essential driver genes, which contained three tests: permutation, association, and function tests, which can exclude false-positive genes and screen essential ones. Finally, the intersection operation was performed to obtain novel driver genes involving two omic levels. The analyses on obtained genes indicated that they were associated with fundamental pathological mechanisms of lung cancer at two corresponding omics levels.

A Random Walk-Based Method to Identify Candidate Genes Associated With Lymphoma

Lymphoma is a serious type of cancer, especially for adolescents and elder adults, although this malignancy is quite rare compared with other types of cancer. The cause of this malignancy remains ambiguous. Genetic factor is deemed to be highly associated with the initiation and progression of lymphoma, and several genes have been related to this disease. Determining the pathogeny of lymphoma by identifying the related genes is important. In this study, we presented a random walk-based method to infer the novel lymphoma-associated genes. From the reported 1,458 lymphoma-associated genes and protein–protein interaction network, raw candidate genes were mined by using the random walk with restart algorithm. The determined raw genes were further filtered by using three screening tests (i.e., permutation, linkage, and enrichment tests). These tests could control false-positive genes and screen out essential candidate genes with strong linkages to validate the lymphoma-associated genes. A total of 108 inferred genes were obtained. Analytical results indicated that some inferred genes, such as RAC3, TEC, IRAK2/3/4, PRKCE, SMAD3, BLK, TXK, PRKCQ, were associated with the initiation and progression of lymphoma.

Identification of Latent Oncogenes with a Network Embedding Method and Random Forest

Oncogene is a special type of genes, which can promote the tumor initiation. Good study on oncogenes is helpful for understanding the cause of cancers. Experimental techniques in early time are quite popular in detecting oncogenes. However, their defects become more and more evident in recent years, such as high cost and long time. The newly proposed computational methods provide an alternative way to study oncogenes, which can provide useful clues for further investigations on candidate genes. Considering the limitations of some previous computational methods, such as lack of learning procedures and terming genes as individual subjects, a novel computational method was proposed in this study. The method adopted the features derived from multiple protein networks, viewing proteins in a system level. A classic machine learning algorithm, random forest, was applied on these features to capture the essential characteristic of oncogenes, thereby building the prediction model. All genes except validated oncogenes were ranked with a measurement yielded by the prediction model. Top genes were quite different from potential oncogenes discovered by previous methods, and they can be confirmed to become novel oncogenes. It was indicated that the newly identified genes can be essential supplements for previous results.

Identification of COVID-19 Infection-Related Human Genes Based on a Random Walk Model in a Virus-Human Protein Interaction Network

Coronaviruses are specific crown-shaped viruses that were first identified in the 1960s, and three typical examples of the most recent coronavirus disease outbreaks include severe acute respiratory syndrome (SARS), Middle East respiratory syndrome (MERS), and COVID-19. Particularly, COVID-19 is currently causing a worldwide pandemic, threatening the health of human beings globally. The identification of viral pathogenic mechanisms is important for further developing effective drugs and targeted clinical treatment methods. The delayed revelation of viral infectious mechanisms is currently one of the technical obstacles in the prevention and treatment of infectious diseases. In this study, we proposed a random walk model to identify the potential pathological mechanisms of COVID-19 on a virus–human protein interaction network, and we effectively identified a group of proteins that have already been determined to be potentially important for COVID-19 infection and for similar SARS infections, which help further developing drugs and targeted therapeutic methods against COVID-19. Moreover, we constructed a standard computational workflow for predicting the pathological biomarkers and related pharmacological targets of infectious diseases.

Prediction of Drug Side Effects with a Refined Negative Sample Selection Strategy

Drugs are an important way to treat various diseases. However, they inevitably produce side effects, bringing great risks to human bodies and pharmaceutical companies. How to predict the side effects of drugs has become one of the essential problems in drug research. Designing efficient computational methods is an alternative way. Some studies paired the drug and side effect as a sample, thereby modeling the problem as a binary classification problem. However, the selection of negative samples is a key problem in this case. In this study, a novel negative sample selection strategy was designed for accessing high-quality negative samples. Such strategy applied the random walk with restart (RWR) algorithm on a chemical-chemical interaction network to select pairs of drugs and side effects, such that drugs were less likely to have corresponding side effects, as negative samples. Through several tests with a fixed feature extraction scheme and different machine-learning algorithms, models with selected negative samples produced high performance. The best model even yielded nearly perfect performance. These models had much higher performance than those without such strategy or with another selection strategy. Furthermore, it is not necessary to consider the balance of positive and negative samples under such a strategy.

Inferring novel genes related to oral cancer with a network embedding method and one-class learning algorithms

Oral cancer (OC) is one of the most common cancers threatening human lives. However, OC pathogenesis has yet to be fully uncovered, and thus designing effective treatments remains difficult. Identifying genes related to OC is an important way for achieving this purpose. In this study, we proposed three computational models for inferring novel OC-related genes. In contrast to previously proposed computational methods, which lacked the learning procedures, each proposed model adopted a one-class learning algorithm, which can provide a deep insight into features of validated OC-related genes. A network embedding algorithm (i.e., node2vec) was applied to the protein-protein interaction network to produce the representation of genes. The features of the OC-related genes were used in the training of the one-class algorithm, and the performance of the final inferring model was improved through a feature selection procedure. Then, candidate genes were produced by applying the trained inferring model to other genes. Three tests were performed to screen out the important candidate genes. Accordingly, we obtained three inferred gene sets, any two of which were different. The inferred genes were also different from previous reported genes and some of them have been included in the public Oral Cancer Gene Database. Finally, we analyzed several inferred genes to confirm whether they are novel OC-related genes.

Inferring novel genes related to colorectal cancer via random walk with restart algorithm

Colorectal cancer (CRC) is the third most common type of cancer. In recent decades, genomic analysis has played an increasingly important role in understanding the molecular mechanisms of CRC. However, its pathogenesis has not been fully uncovered. Identification of genes related to CRC as complete as possible is an important way to investigate its pathogenesis. Therefore, we proposed a new computational method for the identification of novel CRC-associated genes. The proposed method is based on existing proven CRC-associated genes, human protein-protein interaction networks, and random walk with restart algorithm. The utility of the method is indicated by comparing it to the methods based on Guilt-by-association or shortest path algorithm. Using the proposed method, we successfully identified 298 novel CRC-associated genes. Previous studies have validated the involvement of the majority of these 298 novel genes in CRC-associated biological processes, thus suggesting the efficacy and accuracy of our method.

Prediction of Drug Combinations with a Network Embedding Method

Aim and Objective:

There are several diseases having a complicated mechanism. For such complicated diseases, a single drug cannot treat them very well because these diseases always involve several targets and single targeted drugs cannot modulate these targets simultaneously. Drug combination is an effective way to treat such diseases. However, determination of effective drug combinations is time- and cost-consuming via traditional methods. It is urgent to build quick and cheap methods in this regard. Designing effective computational methods incorporating advanced computational techniques to predict drug combinations is an alternative and feasible way.

Method:

In this study, we proposed a novel network embedding method, which can extract topological features of each drug combination from a drug network that was constructed using chemical-chemical interaction information retrieved from STITCH. These topological features were combined with individual features of drug combination reported in one previous study. Several advanced computational methods were employed to construct an effective prediction model, such as synthetic minority oversampling technique (SMOTE) that was used to tackle imbalanced dataset, minimum redundancy maximum relevance (mRMR) and incremental feature selection (IFS) methods that were adopted to analyze features and extract optimal features for building an optimal support machine vector (SVM) classifier.

Results and Conclusion:

The constructed optimal SVM classifier yielded an MCC of 0.806, which is superior to the classifier only using individual features with or without SMOTE. The performance of the classifier can be improved by combining the topological features and essential features of a drug combination.

Use of Laplacian Heat Diffusion Algorithm to Infer Novel Genes With Functions Related to Uveitis

Uveitis is the inflammation of the uvea and is a serious eye disease that can cause blindness for middle-aged and young people. However, the pathogenesis of this disease has not been fully uncovered and thus renders difficulties in designing effective treatments. Completely identifying the genes related to this disease can help improve and accelerate the comprehension of uveitis. In this study, a new computational method was developed to infer potential related genes based on validated ones. We employed a large protein–protein interaction network reported in STRING, in which Laplacian heat diffusion algorithm was applied using validated genes as seed nodes. Except for the validated ones, all genes in the network were filtered by three tests, namely, permutation, association, and function tests, which evaluated the genes based on their specialties and associations to uveitis. Results indicated that 59 inferred genes were accessed, several of which were confirmed to be highly related to uveitis by literature review. In addition, the inferred genes were compared with those reported in a previous study, indicating that our reported genes are necessary supplements.

The Emerging Potential for Network Analysis to Inform Precision Cancer Medicine

Precision cancer medicine promises to tailor clinical decisions to patients using genomic information. Indeed, successes of drugs targeting genetic alterations in tumors, such as imatinib that targets BCR-ABL in chronic myelogenous leukemia, have demonstrated the power of this approach. However, biological systems are complex, and patients may differ not only by the specific genetic alterations in their tumor, but also by more subtle interactions among such alterations. Systems biology and more specifically, network analysis, provides a framework for advancing precision medicine beyond clinical actionability of individual mutations. Here we discuss applications of network analysis to study tumor biology, early methods for N-of-1 tumor genome analysis, and the path for such tools to the clinic.