Discovering Recurrent Copy Number Aberrations in Complex Patterns via Non-Negative Sparse Singular Value Decomposition

Enhancing genomic mutation data storage optimization based on the compression of asymmetry of sparsity

Background: With the rapid development of high-throughput sequencing technology and the explosive growth of genomic data, storing, transmitting and processing massive amounts of data has become a new challenge. How to achieve fast lossless compression and decompression according to the characteristics of the data to speed up data transmission and processing requires research on relevant compression algorithms. Methods: In this paper, a compression algorithm for sparse asymmetric gene mutations (CA_SAGM) based on the characteristics of sparse genomic mutation data was proposed. The data was first sorted on a row-first basis so that neighboring non-zero elements were as close as possible to each other. The data were then renumbered using the reverse Cuthill-Mckee sorting technique. Finally the data were compressed into sparse row format (CSR) and stored. We had analyzed and compared the results of the CA_SAGM, coordinate format (COO) and compressed sparse column format (CSC) algorithms for sparse asymmetric genomic data. Nine types of single-nucleotide variation (SNV) data and six types of copy number variation (CNV) data from the TCGA database were used as the subjects of this study. Compression and decompression time, compression and decompression rate, compression memory and compression ratio were used as evaluation metrics. The correlation between each metric and the basic characteristics of the original data was further investigated. Results: The experimental results showed that the COO method had the shortest compression time, the fastest compression rate and the largest compression ratio, and had the best compression performance. CSC compression performance was the worst, and CA_SAGM compression performance was between the two. When decompressing the data, CA_SAGM performed the best, with the shortest decompression time and the fastest decompression rate. COO decompression performance was the worst. With increasing sparsity, the COO, CSC and CA_SAGM algorithms all exhibited longer compression and decompression times, lower compression and decompression rates, larger compression memory and lower compression ratios. When the sparsity was large, the compression memory and compression ratio of the three algorithms showed no difference characteristics, but the rest of the indexes were still different. Conclusion: CA_SAGM was an efficient compression algorithm that combines compression and decompression performance for sparse genomic mutation data.

Integrating multi-type aberrations from DNA and RNA through dynamic mapping gene space for subtype-specific breast cancer driver discovery

Driver event discovery is a crucial demand for breast cancer diagnosis and therapy. In particular, discovering subtype-specificity of drivers can prompt the personalized biomarker discovery and precision treatment of cancer patients. Still, most of the existing computational driver discovery studies mainly exploit the information from DNA aberrations and gene interactions. Notably, cancer driver events would occur due to not only DNA aberrations but also RNA alternations, but integrating multi-type aberrations from both DNA and RNA is still a challenging task for breast cancer drivers. On the one hand, the data formats of different aberration types also differ from each other, known as data format incompatibility. On the other hand, different types of aberrations demonstrate distinct patterns across samples, known as aberration type heterogeneity. To promote the integrated analysis of subtype-specific breast cancer drivers, we design a "splicing-and-fusing" framework to address the issues of data format incompatibility and aberration type heterogeneity simultaneously. To overcome the data format incompatibility, the "splicing-step" employs a knowledge graph structure to connect multi-type aberrations from the DNA and RNA data into a unified formation. To tackle the aberration type heterogeneity, the "fusing-step" adopts a dynamic mapping gene space integration approach to represent the multi-type information by vectorized profiles. The experiments also demonstrate the advantages of our approach in both the integration of multi-type aberrations from DNA and RNA and the discovery of subtype-specific breast cancer drivers. In summary, our "splicing-and-fusing" framework with knowledge graph connection and dynamic mapping gene space fusion of multi-type aberrations data from DNA and RNA can successfully discover potential breast cancer drivers with subtype-specificity indication.

STIC: Predicting Single Nucleotide Variants and Tumor Purity in Cancer Genome

Single nucleotide variant (SNV) plays an important role in cellular proliferation and tumorigenesis in various types of human cancer. Next-generation sequencing (NGS) has provided high-throughput data at an unprecedented resolution to predict SNVs. Currently, there exist many computational methods for either germline or somatic SNV discovery from NGS data, but very few of them are versatile enough to adapt to any situations. In the absence of matched normal samples, the prediction of somatic SNVs from single-tumor samples becomes considerably challenging, especially when the tumor purity is unknown. Here, we propose a new approach, STIC, to predict somatic SNVs and estimate tumor purity from NGS data without matched normal samples. The main features of STIC include: (1) extracting a set of SNV-relevant features on each site and training the BP neural network algorithm on the features to predict SNVs; (2) creating an iterative process to distinguish somatic SNVs from germline ones by disturbing allele frequency; and (3) establishing a reasonable relationship between tumor purity and allele frequencies of somatic SNVs to accurately estimate the purity. We quantitatively evaluate the performance of STIC on both simulation and real sequencing datasets, the results of which indicate that STIC outperforms competing methods.

A Local Outlier Factor-Based Detection of Copy Number Variations From NGS Data

Copy number variation (CNV) is a major type of genomic structural variations that play an important role in human disorders. Next generation sequencing (NGS) has fueled the advancement in algorithm design to detect CNVs at base-pair resolution. However, accurate detection of CNVs of low amplitudes remains a challenging task. This paper proposes a new computational method, CNV-LOF, to identify CNVs of full-range amplitudes from NGS data. CNV-LOF is distinctly different from traditional methods, which mainly consider aberrations from a global perspective and rely on some assumed distribution of NGS read depths. In contrast, CNV-LOF takes a local view on the read depths and assigns an outlier factor to each genome segment. With the outlier factor profile, CNV-LOF uses a boxplot procedure to declare CNVs without the reliance of any distribution assumptions. Simulation experiments indicate that CNV-LOF outperforms five existing methods with respect to F1-measure, sensitivity, and precision. CNV-LOF is further validated on real sequencing samples, yielding highly consistent results with peer methods. CNV-LOF is able to detect CNVs of low and moderate amplitudes where the other existing methods fail, and it is expected to become a routine approach for the discovery of novel CNVs on whole sequencing genome.

HetRCNA: A Novel Method to Identify Recurrent Copy Number Alternations from Heterogeneous Tumor Samples Based on Matrix Decomposition Framework

A common strategy to discovering cancer associated copy number aberrations (CNAs) from a cohort of cancer samples is to detect recurrent CNAs (RCNAs). Although the previous methods can successfully identify communal RCNAs shared by nearly all tumor samples, detecting subgroup-specific RCNAs and their related subgroup samples from cancer samples with heterogeneity is still invalid for these existing approaches. In this paper, we introduce a novel integrated method called HetRCNA, which can identify statistically significant subgroup-specific RCNAs and their related subgroup samples. Based on matrix decomposition framework with weight constraint, HetRCNA can successfully measure the subgroup samples by coefficients of left vectors with weight constraint and subgroup-specific RCNAs by coefficients of the right vectors and significance test. When we evaluate HetRCNA on simulated dataset, the results show that HetRCNA gives the best performances among the competing methods and is robust to the noise factors of the simulated data. When HetRCNA is applied on a real breast cancer dataset, our approach successfully identifies a bunch of RCNA regions and the result is highly correlated with the results of the other two investigated approaches. Notably, the genomic regions identified by HetRCNA harbor many breast cancer related genes reported by previous researches.

Prediction of lncRNA-disease associations based on inductive matrix completion

Motivation

Accumulating evidences indicate that long non-coding RNAs (lncRNAs) play pivotal roles in various biological processes. Mutations and dysregulations of lncRNAs are implicated in miscellaneous human diseases. Predicting lncRNA-disease associations is beneficial to disease diagnosis as well as treatment. Although many computational methods have been developed, precisely identifying lncRNA-disease associations, especially for novel lncRNAs, remains challenging.

Results

In this study, we propose a method (named SIMCLDA) for predicting potential lncRNA-disease associations based on inductive matrix completion. We compute Gaussian interaction profile kernel of lncRNAs from known lncRNA-disease interactions and functional similarity of diseases based on disease-gene and gene-gene onotology associations. Then, we extract primary feature vectors from Gaussian interaction profile kernel of lncRNAs and functional similarity of diseases by principal component analysis, respectively. For a new lncRNA, we calculate the interaction profile according to the interaction profiles of its neighbors. At last, we complete the association matrix based on the inductive matrix completion framework using the primary feature vectors from the constructed feature matrices. Computational results show that SIMCLDA can effectively predict lncRNA-disease associations with higher accuracy compared with previous methods. Furthermore, case studies show that SIMCLDA can effectively predict candidate lncRNAs for renal cancer, gastric cancer and prostate cancer.

Availability and implementation

https://github.com//bioinfomaticsCSU/SIMCLDA.

Supplementary information

Supplementary data are available at Bioinformatics online.

LSCDFS-MKL: A multiple kernel based method for lung squamous cell carcinomas disease-free survival prediction with pathological and genomic data

Lung squamous cell carcinoma (SCC) is a fatal disease in both male and female, for which current treatments are inadequate. Surgical resection is regarded as the cornerstone of treatment for patients with lung SCC, but even for the same stage patients, the wide spectrum of disease-free survival (DFS) times exits. Therefore, how to improve the DFS prediction performance of lung SCC becomes one major research area. In this study, we proposed a novel method called LSCDFS-MKL, which was on the basis of multiple kernel learning to predict DFS of lung SCC. In LSCDFS-MKL, we first efficiently integrated pathological images and genomic data (copy number aberration, gene expression, protein expression) from lung SCC. The results of LSCDFS-MKL between different types of data show that the features extracted from pathological images play an important role in DFS prediction of lung SCC. Then we compared our method LSCDFS-MKL with other existing methods and performance analysis indicates that LSCDFS-MKL has a significantly better performance than other prediction methods. After that, we applied the proposed method on different stage stratums and the performance demonstrates that LSCDFS-MKL remains efficient in DFS prediction of lung SCC patients. Finally, we performed LSCDFS-MKL on an independent validation dataset and the accuracy of DFS prediction achieves 100%, which is promising.

Prediction of Recurrence in Cervical Cancer Using a Nine-lncRNA Signature

Background and Objective

As a common cancer type in women, cervical cancer remains one of the leading causes of cancer-associated mortalities word wide. Recent evidence has demonstrated the regulatory role of a large number of long non-coding RNAs (lncRNAs) in cervical cancer. Here, we aimed to identify new biomarkers that related with the recurrence through comprehensive bioinformatics analysis.

Methods

Firstly, we collected online lncRNA expression data of cervical cancer patients which were divided into training, validation, and test set. Then we developed a nine-lncRNA signature from training set by conducting LASSO Cox regression model along with 10-fold cross validation. The prognostic value of this risk score was validated in all the three sets using Kaplan–Meier analysis, C-index, time-dependent ROC curves and dynamic AUC. Biological function of these lncRNAs in cervical cancer cells were evaluated by performing gene ontology biological process enrichment and Kyoto Encyclopedia of Genes and Genomes signaling pathways analysis.

Results

According to the results, a higher predict accuracy was observed in the nine-lncRNA signature than that of FIGO stage in all the three sets. Stratified analysis also demonstrated that the nine-lncRNA signature can predict the recurrence of cervical cancer within FIGO stage. The potential mechanisms underlying the nine-lncRNAs from the signature were also identified according to the gene enrichment analysis.

Conclusion

In the present article, we provided a reliable prognostic tool to facilitate the individual management of patients with cervical cancer after treatment.

SM-RCNV: a statistical method to detect recurrent copy number variations in sequenced samples

BACKGROUND

Copy number variation (CNV) is an important form of genomic structural variation and is linked to dozens of human diseases. Using next-generation sequencing (NGS) data and developing computational methods to characterize such structural variants is significant for understanding the mechanisms of diseases.

OBJECTIVE

The objective of this study is to develop a new statistical method of detection recurrent CNVs across multiple samples from genomic sequences.

METHODS

A statistical method is carried out to detect recurrent CNVs, referred to as SM-RCNV. This method uses a statistic associated with each location by combining the frequency of variation at one location across whole samples and the correlation among consecutive locations. The weights of the frequency and correlation are trained using real datasets with known CNVs. P-value is assessed for each location on the genome by permutation testing.

RESULTS

Compared with six peer methods, SM-RCNV outperforms the peer methods under receiver operating characteristic curves. SM-RCNV successfully identifies many consistent recurrent CNVs, most of which are known to be of biological significance and associated with diseased genes. The validation rate of SM-RCNV in the CEU call set and YRI call set with Database of Genomic Variants are 258/328 (79%) and (157/309) 51%, respectively.

CONCLUSION

SM-RCNV is a well-grounded statistical framework for detecting recurrent CNVs from multiple genomic sequences, providing valuable information to study genomes in human diseases. The source code is freely available at https://sourceforge.net/projects/sm-rcnv/ .

CHEMOMETRIC ANALYSIS OF DIFFUSE REFLECTANCE SPECTRAL DATA USING SINGULAR VALUE DECOMPOSITION FOR BLOOD GLUCOSE DETECTION

Diabetes mellitus is a metabolic disorder that affects the production or usage of insulin by the body. Diabetes prevails in the body as a long-term condition which causes several other disorders if left unnoticed. Proper control of Diabetes needs continuous monitoring. The current measurement technique is invasive in nature and requires the withdrawal of blood from the body. Periodic quantification of blood glucose leads to pain and discomfort for the subject. This paper presents a non-invasive glucose measuring system using near-infrared diffuse reflectance spectroscopy (DRS). This work attempts to determine the blood glucose value from the diffuse reflected spectra in the NIR region. The study is executed with the spectral signatures of 33 diabetic subjects collected non-invasively using diffuse reflectance spectrometer from a diabetic centre. Blood glucose level of the same subjects are also recorded using the clinical method. The spectral information is subjected to standard normal variate (SNV) preprocessing method to remove baseline drift and then dimension reduction using singular value decomposition (SVD) is applied to the preprocessed data. The extracted singular values when compared with the clinically measured blood glucose is found to have a proportional relationship. The proposed study using singular value decomposition paves us the way for estimating the blood glucose value non-invasively with the obtained set of clinical blood glucose and the corresponding singular value table as a standard reference set.

Two-Source Validation of Progressive FastICA Peel-Off for Automatic Surface EMG Decomposition in Human First Dorsal Interosseous Muscle

This study aims to assess the accuracy of a novel high density surface electromyogram (SEMG) decomposition method, namely automatic progressive FastICA peel-off (APFP), for automatic decomposition of experimental electrode array SEMG signals. A two-source method was performed by simultaneous concentric needle EMG and electrode array SEMG recordings from the human first dorsal interosseous (FDI) muscle, using a protocol commonly applied in clinical EMG examination. The electrode array SEMG was automatically decomposed by the APFP while the motor unit action potential (MUAP) trains were also independently identified from the concentric needle EMG. The degree of agreement of the common motor unit (MU) discharge timings decomposed from the two different categories of EMG signals was assessed. A total of 861 and 217 MUs were identified from the 114 trials of simultaneous high density SEMG and concentric needle EMG recordings, respectively. Among them 168 common (MUs) were found with a high average matching rate of [Formula: see text] for the discharge timings. The outcomes of this study show that the APFP can reliably decompose at least a subset of MUs in the high density SEMG signals recorded from the human FDI muscle during low contraction levels using a protocol analog to clinical EMG examination.

Integrating genomic data and pathological images to effectively predict breast cancer clinical outcome

BACKGROUND AND OBJECTIVE

Breast cancer is a leading cause of death from cancer for females. The high mortality rate of breast cancer is largely due to the complexity among invasive breast cancer and its significantly varied clinical outcomes. Therefore, improving the accuracy of breast cancer survival prediction has important significance and becomes one of the major research areas. Nowadays many computational models have been proposed for breast cancer survival prediction, however, most of them generate the predictive models by employing only the genomic data information and few of them consider the complementary information from pathological images.

METHODS

In our study, we introduce a novel method called GPMKL based on multiple kernel learning (MKL), which efficiently employs heterogeneous information containing genomic data (gene expression, copy number alteration, gene methylation, protein expression) and pathological images. With above heterogeneous features, GPMKL is proposed to execute feature fusion which is embedded in breast cancer classification.

RESULTS

Performance analysis of the GPMKL model indicates that the pathological image information plays a critical part in accurately predicting the survival time of breast cancer patients. Furthermore, the proposed method is compared with other existing breast cancer survival prediction methods, and the results demonstrate that the proposed framework with pathological images performs remarkably better than the existing survival prediction methods.

CONCLUSIONS

All results performed in our study suggest that the usefulness and superiority of GPMKL in predicting human breast cancer survival.

A novel network regularized matrix decomposition method to detect mutated cancer genes in tumour samples with inter-patient heterogeneity

Inter-patient heterogeneity is a major challenge for mutated cancer genes detection which is crucial to advance cancer diagnostics and therapeutics. To detect mutated cancer genes in heterogeneous tumour samples, a prominent strategy is to determine whether the genes are recurrently mutated in their interaction network context. However, recent studies show that some cancer genes in different perturbed pathways are mutated in different subsets of samples. Subsequently, these genes may not display significant mutational recurrence and thus remain undiscovered even in consideration of network information. We develop a novel method called mCGfinder to efficiently detect mutated cancer genes in tumour samples with inter-patient heterogeneity. Based on matrix decomposition framework incorporated with gene interaction network information, mCGfinder can successfully measure the significance of mutational recurrence of genes in a subset of samples. When applying mCGfinder on TCGA somatic mutation datasets of five types of cancers, we find that the genes detected by mCGfinder are significantly enriched for known cancer genes, and yield substantially smaller p-values than other existing methods. All the results demonstrate that mCGfinder is an efficient method in detecting mutated cancer genes.

Discovering potential driver genes through an integrated model of somatic mutation profiles and gene functional information

An integrated approach to identify driver genes based on information of somatic mutations, the interaction network and Gene Ontology similarity.

Penalized weighted low-rank approximation for robust recovery of recurrent copy number variations

BACKGROUND

Copy number variation (CNV) analysis has become one of the most important research areas for understanding complex disease. With increasing resolution of array-based comparative genomic hybridization (aCGH) arrays, more and more raw copy number data are collected for multiple arrays. It is natural to realize the co-existence of both recurrent and individual-specific CNVs, together with the possible data contamination during the data generation process. Therefore, there is a great need for an efficient and robust statistical model for simultaneous recovery of both recurrent and individual-specific CNVs.

RESULT

We develop a penalized weighted low-rank approximation method (WPLA) for robust recovery of recurrent CNVs. In particular, we formulate multiple aCGH arrays into a realization of a hidden low-rank matrix with some random noises and let an additional weight matrix account for those individual-specific effects. Thus, we do not restrict the random noise to be normally distributed, or even homogeneous. We show its performance through three real datasets and twelve synthetic datasets from different types of recurrent CNV regions associated with either normal random errors or heavily contaminated errors.

CONCLUSION

Our numerical experiments have demonstrated that the WPLA can successfully recover the recurrent CNV patterns from raw data under different scenarios. Compared with two other recent methods, it performs the best regarding its ability to simultaneously detect both recurrent and individual-specific CNVs under normal random errors. More importantly, the WPLA is the only method which can effectively recover the recurrent CNVs region when the data is heavily contaminated.