Deep learning enables the discovery of a novel cuproptosis-inducing molecule for the inhibition of hepatocellular carcinoma.

Hepatocellular carcinoma (HCC) is one of the most common and deadly cancers in the world. The therapeutic outlook for HCC patients has significantly improved with the advent and development of systematic and targeted therapies such as sorafenib and lenvatinib; however, the rise of drug resistance and the high mortality rate necessitate the continuous discovery of effective targeting agents. To discover novel anti-HCC compounds, we first constructed a deep learning-based chemical representation model to screen more than 6 million compounds in the ZINC15 drug-like library. We successfully identified LGOd1 as a novel anticancer agent with a characteristic levoglucosenone (LGO) scaffold. The mechanistic studies revealed that LGOd1 treatment leads to HCC cell death by interfering with cellular copper homeostasis, which is similar to a recently reported copper-dependent cell death named cuproptosis. While the prototypical cuproptosis is brought on by copper ionophore-induced copper overload, mechanistic studies indicated that LGOd1 does not act as a copper ionophore, but most likely by interacting with the copper chaperone protein CCS, thus LGOd1 represents a potentially new class of compounds with unique cuproptosis-inducing property. In summary, our findings highlight the critical role of bioavailable copper in the regulation of cell death and represent a novel route of cuproptosis induction.

Single-cell transcriptomic dissection of the cellular and molecular events underlying the triclosan-induced liver fibrosis in mice.

BACKGROUND: Triclosan [5-chloro-2-(2,4-dichlorophenoxy) phenol, TCS], a common antimicrobial additive in many personal care and health care products, is frequently detected in human blood and urine. Therefore, it has been considered an emerging and potentially toxic pollutant in recent years. Long-term exposure to TCS has been suggested to exert endocrine disruption effects, and promote liver fibrogenesis and tumorigenesis. This study was aimed at clarifying the underlying cellular and molecular mechanisms of hepatotoxicity effect of TCS at the initiation stage. METHODS: C57BL/6 mice were exposed to different dosages of TCS for 2 weeks and the organ toxicity was evaluated by various measurements including complete blood count, histological analysis and TCS quantification. Single cell RNA sequencing (scRNA-seq) was then carried out on TCS- or mock-treated mouse livers to delineate the TCS-induced hepatotoxicity. The acquired single-cell transcriptomic data were analyzed from different aspects including differential gene expression, transcription factor (TF) regulatory network, pseudotime trajectory, and cellular communication, to systematically dissect the molecular and cellular events after TCS exposure. To verify the TCS-induced liver fibrosis, the expression levels of key fibrogenic proteins were examined by Western blotting, immunofluorescence, Masson's trichrome and Sirius red staining. In addition, normal hepatocyte cell MIHA and hepatic stellate cell LX-2 were used as in vitro cell models to experimentally validate the effects of TCS by immunological, proteomic and metabolomic technologies. RESULTS: We established a relatively short term TCS exposure murine model and found the TCS mainly accumulated in the liver. The scRNA-seq performed on the livers of the TCS-treated and control group profiled the gene expressions of > 76,000 cells belonging to 13 major cell types. Among these types, hepatocytes and hepatic stellate cells (HSCs) were significantly increased in TCS-treated group. We found that TCS promoted fibrosis-associated proliferation of hepatocytes, in which Gata2 and Mef2c are the key driving TFs. Our data also suggested that TCS induced the proliferation and activation of HSCs, which was experimentally verified in both liver tissue and cell model. In addition, other changes including the dysfunction and capillarization of endothelial cells, an increase of fibrotic characteristics in B plasma cells, and M2 phenotype-skewing of macrophage cells, were also deduced from the scRNA-seq analysis, and these changes are likely to contribute to the progression of liver fibrosis. Lastly, the key differential ligand-receptor pairs involved in cellular communications were identified and we confirmed the role of GAS6_AXL interaction-mediated cellular communication in promoting liver fibrosis. CONCLUSIONS: TCS modulates the cellular activities and fates of several specific cell types (including hepatocytes, HSCs, endothelial cells, B cells, Kupffer cells and liver capsular macrophages) in the liver, and regulates the ligand-receptor interactions between these cells, thereby promoting the proliferation and activation of HSCs, leading to liver fibrosis. Overall, we provide the first comprehensive single-cell atlas of mouse livers in response to TCS and delineate the key cellular and molecular processes involved in TCS-induced hepatotoxicity and fibrosis.

Multi-view manifold regularized compact low-rank representation for cancer samples clustering on multi-omics data.

BACKGROUND: The identification of cancer types is of great significance for early diagnosis and clinical treatment of cancer. Clustering cancer samples is an important means to identify cancer types, which has been paid much attention in the field of bioinformatics. The purpose of cancer clustering is to find expression patterns of different cancer types, so that the samples with similar expression patterns can be gathered into the same type. In order to improve the accuracy and reliability of cancer clustering, many clustering methods begin to focus on the integration analysis of cancer multi-omics data. Obviously, the methods based on multi-omics data have more advantages than those using single omics data. However, the high heterogeneity and noise of cancer multi-omics data pose a great challenge to the multi-omics analysis method. RESULTS: In this study, in order to extract more complementary information from cancer multi-omics data for cancer clustering, we propose a low-rank subspace clustering method called multi-view manifold regularized compact low-rank representation (MmCLRR). In MmCLRR, each omics data are regarded as a view, and it learns a consistent subspace representation by imposing a consistence constraint on the low-rank affinity matrix of each view to balance the agreement between different views. Moreover, the manifold regularization and concept factorization are introduced into our method. Relying on the concept factorization, the dictionary can be updated in the learning, which greatly improves the subspace learning ability of low-rank representation. We adopt linearized alternating direction method with adaptive penalty to solve the optimization problem of MmCLRR method. CONCLUSIONS: Finally, we apply MmCLRR into the clustering of cancer samples based on multi-omics data, and the clustering results show that our method outperforms the existing multi-view methods.

Joint Lp-Norm and L2,1-Norm Constrained Graph Laplacian PCA for Robust Tumor Sample Clustering and Gene Network Module Discovery.

The dimensionality reduction method accompanied by different norm constraints plays an important role in mining useful information from large-scale gene expression data. In this article, a novel method named Lp-norm and L2,1-norm constrained graph Laplacian principal component analysis (PL21GPCA) based on traditional principal component analysis (PCA) is proposed for robust tumor sample clustering and gene network module discovery. Three aspects are highlighted in the PL21GPCA method. First, to degrade the high sensitivity to outliers and noise, the non-convex proximal Lp-norm (0 < p < 1)constraint is applied on the loss function. Second, to enhance the sparsity of gene expression in cancer samples, the L2,1-norm constraint is used on one of the regularization terms. Third, to retain the geometric structure of the data, we introduce the graph Laplacian regularization item to the PL21GPCA optimization model. Extensive experiments on five gene expression datasets, including one benchmark dataset, two single-cancer datasets from The Cancer Genome Atlas (TCGA), and two integrated datasets of multiple cancers from TCGA, are performed to validate the effectiveness of our method. The experimental results demonstrate that the PL21GPCA method performs better than many other methods in terms of tumor sample clustering. Additionally, this method is used to discover the gene network modules for the purpose of finding key genes that may be associated with some cancers.

Sparse robust graph-regularized non-negative matrix factorization based on correntropy.

Non-negative Matrix Factorization (NMF) is a popular data dimension reduction method in recent years. The traditional NMF method has high sensitivity to data noise. In the paper, we propose a model called Sparse Robust Graph-regularized Non-negative Matrix Factorization based on Correntropy (SGNMFC). The maximized correntropy replaces the traditional minimized Euclidean distance to improve the robustness of the algorithm. Through the kernel function, correntropy can give less weight to outliers and noise in data but give greater weight to meaningful data. Meanwhile, the geometry structure of the high-dimensional data is completely preserved in the low-dimensional manifold through the graph regularization. Feature selection and sample clustering are commonly used methods for analyzing genes. Sparse constraints are applied to the loss function to reduce matrix complexity and analysis difficulty. Comparing the other five similar methods, the effectiveness of the SGNMFC model is proved by selection of differentially expressed genes and sample clustering experiments in three The Cancer Genome Atlas (TCGA) datasets.

A Low-Rank Representation Method Regularized by Dual-Hypergraph Laplacian for Selecting Differentially Expressed Genes.

Differentially expressed genes selection becomes a hotspot and difficulty in recent molecular biology. Low-rank representation (LRR) uniting graph Laplacian regularization has gained good achievement in the above field. However, the co-expression information of data cannot be captured well by graph regularization. Therefore, a novel low-rank representation method regularized by dual-hypergraph Laplacian is proposed to reveal the intrinsic geometrical structures hidden in the samples and genes direction simultaneously, which is called dual-hypergraph Laplacian regularized LRR (DHLRR). Finally, a low-rank matrix and a sparse perturbation matrix can be recovered from genomic data by DHLRR. Based on the sparsity of differentially expressed genes, the sparse disturbance matrix can be applied to extracting differentially expressed genes. In our experiments, two gene analysis tools are used to discuss the experimental results. The results on two real genomic data and an integrated dataset prove that DHLRR is efficient and effective in finding differentially expressed genes.

ACCBN: ant-Colony-clustering-based bipartite network method for predicting long non-coding RNA-protein interactions.

BACKGROUND: Long non-coding RNA (lncRNA) studies play an important role in the development, invasion, and metastasis of the tumor. The analysis and screening of the differential expression of lncRNAs in cancer and corresponding paracancerous tissues provides new clues for finding new cancer diagnostic indicators and improving the treatment. Predicting lncRNA-protein interactions is very important in the analysis of lncRNAs. This article proposes an Ant-Colony-Clustering-Based Bipartite Network (ACCBN) method and predicts lncRNA-protein interactions. The ACCBN method combines ant colony clustering and bipartite network inference to predict lncRNA-protein interactions. RESULTS: A five-fold cross-validation method was used in the experimental test. The results show that the values of the evaluation indicators of ACCBN on the test set are significantly better after comparing the predictive ability of ACCBN with RWR, ProCF, LPIHN, and LPBNI method. CONCLUSIONS: With the continuous development of biology, besides the research on the cellular process, the research on the interaction function between proteins becomes a new key topic of biology. The studies on protein-protein interactions had important implications for bioinformatics, clinical medicine, and pharmacology. However, there are many kinds of proteins, and their functions of interactions are complicated. Moreover, the experimental methods require time to be confirmed because it is difficult to estimate. Therefore, a viable solution is to predict protein-protein interactions efficiently with computers. The ACCBN method has a good effect on the prediction of protein-protein interactions in terms of sensitivity, precision, accuracy, and F1-score.

Laplacian regularized low-rank representation for cancer samples clustering.

Cancer samples clustering based on biomolecular data has been becoming an important tool for cancer classification. The recognition of cancer types is of great importance for cancer treatment. In this paper, in order to improve the accuracy of cancer recognition, we propose to use Laplacian regularized Low-Rank Representation (LLRR) to cluster the cancer samples based on genomic data. In LLRR method, the high-dimensional genomic data are approximately treated as samples extracted from a combination of several low-rank subspaces. The purpose of LLRR method is to seek the lowest-rank representation matrix based on a dictionary. Because a Laplacian regularization based on manifold is introduced into LLRR, compared to the Low-Rank Representation (LRR) method, besides capturing the global geometric structure, LLRR can capture the intrinsic local structure of high-dimensional observation data well. And what is more, in LLRR, the original data themselves are selected as a dictionary, so the lowest-rank representation is actually a similar expression between the samples. Therefore, corresponding to the low-rank representation matrix, the samples with high similarity are considered to come from the same subspace and are grouped into a class. The experiment results on real genomic data illustrate that LLRR method, compared with LRR and MLLRR, is more robust to noise and has a better ability to learn the inherent subspace structure of data, and achieves remarkable performance in the clustering of cancer samples.

Network analysis based on low-rank method for mining information on integrated data of multi-cancers.

The noise problem of cancer sequencing data has been a problem that can't be ignored. Utilizing considerable way to reduce noise of these cancer data is an important issue in the analysis of gene co-expression network. In this paper, we apply a sparse and low-rank method which is Robust Principal Component Analysis (RPCA) to solve the noise problem for integrated data of multi-cancers from The Cancer Genome Atlas (TCGA). And then we build the gene co-expression network based on the integrated data after noise reduction. Finally, we perform nodes and pathways mining on the denoising networks. Experiments in this paper show that after denoising by RPCA, the gene expression data tend to be orderly and neat than before, and the constructed networks contain more pathway enrichment information than unprocessed data. Moreover, learning from the betweenness centrality of the nodes in the network, we find some abnormally expressed genes and pathways proven that are associated with many cancers from the denoised network. The experimental results indicate that our method is reasonable and effective, and we also find some candidate suspicious genes that may be linked to multi-cancers.

PCA via joint graph Laplacian and sparse constraint: Identification of differentially expressed genes and sample clustering on gene expression data.

BACKGROUND: In recent years, identification of differentially expressed genes and sample clustering have become hot topics in bioinformatics. Principal Component Analysis (PCA) is a widely used method in gene expression data. However, it has two limitations: first, the geometric structure hidden in data, e.g., pair-wise distance between data points, have not been explored. This information can facilitate sample clustering; second, the Principal Components (PCs) determined by PCA are dense, leading to hard interpretation. However, only a few of genes are related to the cancer. It is of great significance for the early diagnosis and treatment of cancer to identify a handful of the differentially expressed genes and find new cancer biomarkers. RESULTS: In this study, a new method gLSPCA is proposed to integrate both graph Laplacian and sparse constraint into PCA. gLSPCA on the one hand improves the clustering accuracy by exploring the internal geometric structure of the data, on the other hand identifies differentially expressed genes by imposing a sparsity constraint on the PCs. CONCLUSIONS: Experiments of gLSPCA and its comparison with existing methods, including Z-SPCA, GPower, PathSPCA, SPCArt, gLPCA, are performed on real datasets of both pancreatic cancer (PAAD) and head & neck squamous carcinoma (HNSC). The results demonstrate that gLSPCA is effective in identifying differentially expressed genes and sample clustering. In addition, the applications of gLSPCA on these datasets provide several new clues for the exploration of causative factors of PAAD and HNSC.

Multi-cancer samples clustering via graph regularized low-rank representation method under sparse and symmetric constraints.

BACKGROUND: Identifying different types of cancer based on gene expression data has become hotspot in bioinformatics research. Clustering cancer gene expression data from multiple cancers to their own class is a significance solution. However, the characteristics of high-dimensional and small samples of gene expression data and the noise of the data make data mining and research difficult. Although there are many effective and feasible methods to deal with this problem, the possibility remains that these methods are flawed. RESULTS: In this paper, we propose the graph regularized low-rank representation under symmetric and sparse constraints (sgLRR) method in which we introduce graph regularization based on manifold learning and symmetric sparse constraints into the traditional low-rank representation (LRR). For the sgLRR method, by means of symmetric constraint and sparse constraint, the effect of raw data noise on low-rank representation is alleviated. Further, sgLRR method preserves the important intrinsic local geometrical structures of the raw data by introducing graph regularization. We apply this method to cluster multi-cancer samples based on gene expression data, which improves the clustering quality. First, the gene expression data are decomposed by sgLRR method. And, a lowest rank representation matrix is obtained, which is symmetric and sparse. Then, an affinity matrix is constructed to perform the multi-cancer sample clustering by using a spectral clustering algorithm, i.e., normalized cuts (Ncuts). Finally, the multi-cancer samples clustering is completed. CONCLUSIONS: A series of comparative experiments demonstrate that the sgLRR method based on low rank representation has a great advantage and remarkable performance in the clustering of multi-cancer samples.

Co-differential Gene Selection and Clustering Based on Graph Regularized Multi-View NMF in Cancer Genomic Data.

Cancer genomic data contain views from different sources that provide complementary information about genetic activity. This provides a new way for cancer research. Feature selection and multi-view clustering are hot topics in bioinformatics, and they can make full use of complementary information to improve the effect. In this paper, a novel integrated model called Multi-view Non-negative Matrix Factorization (MvNMF) is proposed for the selection of common differential genes (co-differential genes) and multi-view clustering. In order to encode the geometric information in the multi-view genomic data, graph regularized MvNMF (GMvNMF) is further proposed by applying the graph regularization constraint in the objective function. GMvNMF can not only obtain the potential shared feature structure and shared cluster group structure, but also capture the manifold structure of multi-view data. The validity of the proposed GMvNMF method was tested in four multi-view genomic data. Experimental results showed that the GMvNMF method has better performance than other representative methods.