Heterogeneous Multi-omics Data Research Articles

SperMD: the expression atlas of sperm maturation

The impairment of sperm maturation is one of the major pathogenic factors in male subfertility, a serious medical and social problem affecting millions of global couples. Regrettably, the existing research on sperm maturation is slow, limited, and fragmented, largely attributable to the lack of a global molecular view. To fill the data gap, we newly established a database, namely the Sperm Maturation Database (SperMD, http://bio-add.org/SperMD). SperMD integrates heterogeneous multi-omics data (170 transcriptomes, 91 proteomes, and five human metabolomes) to illustrate the transcriptional, translational, and metabolic manifestations during the entire lifespan of sperm maturation. These data involve almost all crucial scenarios related to sperm maturation, including the tissue components of the epididymal microenvironment, cell constituents of tissues, different pathological states, and so on. To the best of our knowledge, SperMD could be one of the limited repositories that provide focused and comprehensive information on sperm maturation. Easy-to-use web services are also implemented to enhance the experience of data retrieval and molecular comparison between humans and mice. Furthermore, the manuscript illustrates an example application demonstrated to systematically characterize novel gene functions in sperm maturation. Nevertheless, SperMD undertakes the endeavor to integrate the islanding omics data, offering a panoramic molecular view of how the spermatozoa gain full reproductive abilities. It will serve as a valuable resource for the systematic exploration of sperm maturation and for prioritizing the biomarkers and targets for precise diagnosis and therapy of male subfertility.

AFEI: adaptive optimized vertical federated learning for heterogeneous multi-omics data integration.

Vertical federated learning has gained popularity as a means of enabling collaboration and information sharing between different entities while maintaining data privacy and security. This approach has potential applications in disease healthcare, cancer prognosis prediction, and other industries where data privacy is a major concern. Although using multi-omics data for cancer prognosis prediction provides more information for treatment selection, collecting different types of omics data can be challenging due to their production in various medical institutions. Data owners must comply with strict data protection regulations such as European Union (EU) General Data Protection Regulation. To share patient data across multiple institutions, privacy and security issues must be addressed. Therefore, we propose an adaptive optimized vertical federated-learning-based framework adaptive optimized vertical federated learning for heterogeneous multi-omics data integration (AFEI) to integrate multi-omics data collected from multiple institutions for cancer prognosis prediction. AFEI enables participating parties to build an accurate joint evaluation model for learning more information related to cancer patients from different perspectives, based on the distributed and encrypted multi-omics features shared by multiple institutions. The experimental results demonstrate that AFEI achieves higher prediction accuracy (6.5% on average) than using single omics data by utilizing the encrypted multi-omics data from different institutions, and it performs almost as well as prognosis prediction by directly integrating multi-omics data. Overall, AFEI can be seen as an efficient solution for breaking down barriers to multi-institutional collaboration and promoting the development of cancer prognosis prediction.

Cancer subtyping with heterogeneous multi-omics data via hierarchical multi-kernel learning.

Differentiating cancer subtypes is crucial to guide personalized treatment and improve the prognosis for patients. Integrating multi-omics data can offer a comprehensive landscape of cancer biological process and provide promising ways for cancer diagnosis and treatment. Taking the heterogeneity of different omics data types into account, we propose a hierarchical multi-kernel learning (hMKL) approach, a novel cancer molecular subtyping method to identify cancer subtypes by adopting a two-stage kernel learning strategy. In stage 1, we obtain a composite kernel borrowing the cancer integration via multi-kernel learning (CIMLR) idea by optimizing the kernel parameters for individual omics data type. In stage 2, we obtain a final fused kernel through a weighted linear combination of individual kernels learned from stage 1 using an unsupervised multiple kernel learning method. Based on the final fusion kernel, k-means clustering is applied to identify cancer subtypes. Simulation studies show that hMKL outperforms the one-stage CIMLR method when there is data heterogeneity. hMKL can estimate the number of clusters correctly, which is the key challenge in subtyping. Application to two real data sets shows that hMKL identified meaningful subtypes and key cancer-associated biomarkers. The proposed method provides a novel toolkit for heterogeneous multi-omics data integration and cancer subtypes identification.

Deep latent space fusion for adaptive representation of heterogeneous multi-omics data.

The integration of multi-omics data makes it possible to understand complex biological organisms at the system level. Numerous integration approaches have been developed by assuming a common underlying data space. Due to the noise and heterogeneity of biological data, the performance of these approaches is greatly affected. In this work, we propose a novel deep neural network architecture, named Deep Latent Space Fusion (DLSF), which integrates the multi-omics data by learning consistent manifold in the sample latent space for disease subtypes identification. DLSF is built upon a cycle autoencoder with a shared self-expressive layer, which can naturally and adaptively merge nonlinear features at each omics level into one unified sample manifold and produce adaptive representation of heterogeneous samples at the multi-omics level. We have assessed DLSF on various biological and biomedical datasets to validate its effectiveness. DLSF can efficiently and accurately capture the intrinsic manifold of the sample structures or sample clusters compared with other state-of-the-art methods, and DLSF yielded more significant outcomes for biological significance, survival prognosis and clinical relevance in application of cancer study in The Cancer Genome Atlas. Notably, as a deep case study, we determined a new molecular subtype of kidney renal clear cell carcinoma that may benefit immunotherapy in the viewpoint of multi-omics, and we further found potential subtype-specific biomarkers from multiple omics data, which were validated by independent datasets. In addition, we applied DLSF to identify potential therapeutic agents of different molecular subtypes of chronic lymphocytic leukemia, demonstrating the scalability of DLSF in diverse omics data types and application scenarios.

Joint Nonnegative Matrix Factorization Based on Sparse and Graph Laplacian Regularization for Clustering and Co-Differential Expression Genes Analysis

The explosion of multiomics data poses new challenges to existing data mining methods. Joint analysis of multiomics data can make the best of the complementary information that is provided by different types of data. Therefore, they can more accurately explore the biological mechanism of diseases. In this article, two forms of joint nonnegative matrix factorization based on the sparse and graph Laplacian regularization (SG-jNMF) method are proposed. In the method, the graph regularization constraint can preserve the local geometric structure of data.L2,1-norm regularization can enhance the sparsity among the rows and remove redundant features in the data. First, SG-jNMF1 projects multiomics data into a common subspace and applies the multiomics fusion characteristic matrix to mine the important information closely related to diseases. Second, multiomics data of the same disease are mapped into the common sample space by SG-jNMF2, and the cluster structures are detected clearly. Experimental results show that SG-jNMF can achieve significant improvement in sample clustering compared with existing joint analysis frameworks. SG-jNMF also effectively integrates multiomics data to identify co-differentially expressed genes (Co-DEGs). SG-jNMF provides an efficient integrative analysis method for mining the biological information hidden in heterogeneous multiomics data.

IODA: An integrated tool for analysis of cancer pathway consistency from heterogeneous multi-omics data

The latest advances in the next generation sequencing technology have greatly facilitated the extensive research of genomics and transcriptomics, thereby promoting the decoding of carcinogenesis with unprecedented resolution. Considering the contribution of analyzing high-throughput multi-omics data to the exploration of cancer molecular mechanisms, an integrated tool for heterogeneous multi-omics data analysis (iODA) is proposed for the systems-level interpretation of multi-omics data, i.e., transcriptomic profiles (mRNA or miRNA expression data) and protein-DNA interactions (ChIP-Seq data). Considering the data heterogeneity, iODA can compare six statistical algorithms in differential analysis for the selected sample data and assist users in choosing the globally optimal one for dysfunctional mRNA or miRNA identification. Since molecular signatures are more consistent at the pathway level than at the gene level, the tool is able to enrich the identified dysfunctional molecules onto the KEGG pathways and extracted the consistent items as key components for further pathogenesis investigation. Compared with other tools, iODA is multi-functional for the systematic analysis of different level of omics data, and its analytical power was demonstrated through case studies of single and cross-level prostate cancer omics data. iODA is open source under GNU GPL and can be downloaded from http://www.sysbio.org.cn/iODA.

Structured Penalized Regression for Drug Sensitivity Prediction

SummaryLarge-scale in vitro drug sensitivity screens are an important tool in personalized oncology to predict the effectiveness of potential cancer drugs. The prediction of the sensitivity of cancer cell lines to a panel of drugs is a multivariate regression problem with high dimensional heterogeneous multiomics data as input data and with potentially strong correlations between the outcome variables which represent the sensitivity to the different drugs. We propose a joint penalized regression approach with structured penalty terms which enable us to utilize the correlation structure between drugs with group-lasso-type penalties and at the same time address the heterogeneity between ‘omics’ data sources by introducing data-source-specific penalty factors to penalize different data sources differently. By combining integrative penalty factors (IPFs) with the tree-guided group lasso, we create a method called ‘IPF-tree-lasso’. We present a unified framework to transform more general IPF-type methods to the original penalized method. Because the structured penalty terms have multiple parameters, we demonstrate how the interval search ‘Efficient parameter selection via global optimization’ algorithm can be used to optimize multiple penalty parameters efficiently. Simulation studies show that IPF-tree-lasso can improve the prediction performance compared with other lasso-type methods, in particular for heterogeneous sources of data. Finally, we employ the new methods to analyse data from the ‘Genomics of drug sensitivity in cancer’ project.

Cancer Progression Prediction Using Gene Interaction Regularized Elastic Net.

Different types of genomic aberration may simultaneously contribute to tumorigenesis. To obtain a more accurate prognostic assessment to guide therapeutic regimen choice for cancer patients, the heterogeneous multi-omics data should be integrated harmoniously, which can often be difficult. For this purpose, we propose a Gene Interaction Regularized Elastic Net (GIREN) model that predicts clinical outcome by integrating multiple data types. GIREN conveniently embraces both gene measurements and gene-gene interaction information under an elastic net formulation, enforcing structure sparsity, and the "grouping effect" in solution to select the discriminate features with prognostic value. An iterative gradient descent algorithm is also developed to solve the model with regularized optimization. GIREN was applied to human ovarian cancer and breast cancer datasets obtained from The Cancer Genome Atlas, respectively. Result shows that, the proposed GIREN algorithm obtained more accurate and robust performance over competing algorithms (LASSO, Elastic Net, and Semi-supervised PCA, with or without average pathway expression features) in predicting cancer progression on both two datasets in terms of median area under curve (AUC) and interquartile range (IQR), suggesting a promising direction for more effective integration of gene measurement and gene interaction information.