SVD-phy: improved prediction of protein functional associations through singular value decomposition of phylogenetic profiles.
Ontology highlight
ABSTRACT: Unlabelled
A successful approach for predicting functional associations between non-homologous genes is to compare their phylogenetic distributions. We have devised a phylogenetic profiling algorithm, SVD-Phy, which uses truncated singular value decomposition to address the problem of uninformative profiles giving rise to false positive predictions. Benchmarking the algorithm against the KEGG pathway database, we found that it has substantially improved performance over existing phylogenetic profiling methods.Availability and implementation
The software is available under the open-source BSD license at https://bitbucket.org/andrea/svd-phyContact
lars.juhl.jensen@cpr.ku.dkSupplementary information
Supplementary data are available at Bioinformatics online.
SUBMITTER: Franceschini A
PROVIDER: S-EPMC4896368 | biostudies-literature | 2016 Apr
REPOSITORIES: biostudies-literature
Publications
SVD-phy: improved prediction of protein functional associations through singular value decomposition of phylogenetic profiles.
Franceschini Andrea A Lin Jianyi J von Mering Christian C Jensen Lars Juhl LJ
Bioinformatics (Oxford, England) 20151126 7
<h4>Unlabelled</h4>A successful approach for predicting functional associations between non-homologous genes is to compare their phylogenetic distributions. We have devised a phylogenetic profiling algorithm, SVD-Phy, which uses truncated singular value decomposition to address the problem of uninformative profiles giving rise to false positive predictions. Benchmarking the algorithm against the KEGG pathway database, we found that it has substantially improved performance over existing phylogen ...[more]
Similar Datasets
Project description:BackgroundIn the field of drug repositioning, it is assumed that similar drugs may treat similar diseases, therefore many existing computational methods need to compute the similarities of drugs and diseases. However, the calculation of similarity depends on the adopted measure and the available features, which may lead that the similarity scores vary dramatically from one to another, and it will not work when facing the incomplete data. Besides, supervised learning based methods usually need both positive and negative samples to train the prediction models, whereas in drug-disease pairs data there are only some verified interactions (positive samples) and a lot of unlabeled pairs. To train the models, many methods simply treat the unlabeled samples as negative ones, which may introduce artificial noises. Herein, we propose a method to predict drug-disease associations without the need of similarity information, and select more likely negative samples.ResultsIn the proposed EMP-SVD (Ensemble Meta Paths and Singular Value Decomposition), we introduce five meta paths corresponding to different kinds of interaction data, and for each meta path we generate a commuting matrix. Every matrix is factorized into two low rank matrices by SVD which are used for the latent features of drugs and diseases respectively. The features are combined to represent drug-disease pairs. We build a base classifier via Random Forest for each meta path and five base classifiers are combined as the final ensemble classifier. In order to train out a more reliable prediction model, we select more likely negative ones from unlabeled samples under the assumption that non-associated drug and disease pair have no common interacted proteins. The experiments have shown that the proposed EMP-SVD method outperforms several state-of-the-art approaches. Case studies by literature investigation have found that the proposed EMP-SVD can mine out many drug-disease associations, which implies the practicality of EMP-SVD.ConclusionsThe proposed EMP-SVD can integrate the interaction data among drugs, proteins and diseases, and predict the drug-disease associations without the need of similarity information. At the same time, the strategy of selecting more reliable negative samples will benefit the prediction.
| S-EPMC6439991 | biostudies-literature
Project description:Serum transferrin (Tf) is the essential iron transport protein in the body. Transferrin is responsible for the sequestration of free iron in serum and the delivery of iron throughout the body and into cells, where iron is released inside a mildly acidified endosome. Altered iron distributions are associated with diseases such as iron-overload, cancer, and cardiovascular disease. The presence of free iron is linked to deleterious redox reactions, inside and outside cells and organelles. As Tf iron release is pH dependent, any changes in intraorganelle and extracellular pH, often associated with disease progression, could inhibit normal iron delivery or accelerate iron release in the wrong compartment. However, imaging approaches to monitor changes in the iron-bound state of Tf are lacking. Recently, Raman spectroscopy has been shown to measure iron-bound forms of Tf in solution, intact cells and tissue samples. Here, a biochemical Raman assay has been developed to identify iron-release from Tf following modification of chemical environment. Quantitative singular value decomposition (SVD) method has been applied to discriminate between iron-bound Tf samples during endocytic trafficking in intact cancer cells subjected to Raman hyperspectral confocal imaging. We demonstrate the strength of the SVD method to monitor pH-induced Tf iron-release using Raman hyperspectral imaging, providing the redox biology field with a novel tool that facilitates subcellular investigation of the iron-binding profile of transferrin in various disease models.
| S-EPMC8667008 | biostudies-literature
Project description:BackgroundIn order to identify rice genes involved in nutrient partitioning, microarray experiments have been done to quantify genomic scale gene expression. Genes involved in nutrient partitioning, specifically grain filling, will be used to identify other co-regulated genes, and DNA binding proteins. Proper identification of the initial set of bait genes used for further investigation is critical. Hierarchical clustering is useful for grouping genes with similar expression profiles, but decreases in utility as data complexity and systematic noise increases. Also, its rigid classification of genes is not consistent with our belief that some genes exhibit multifaceted, context dependent regulation.ResultsSingular value decomposition (SVD) of microarray data was investigated as a method to complement current techniques for gene expression pattern recognition. SVD's usefulness, in finding likely participants in grain filling, was measured by comparison with results obtained previously via clustering. 84 percent of these known grain-filling genes were re-identified after detailed SVD analysis. An additional set of 28 genes exhibited a stronger grain-filling pattern than those grain-filling genes that were unselected. They also had upstream sequence containing motifs over-represented among grain filling genes.ConclusionsThe pattern-based perspective that SVD provides complements to widely used clustering methods. The singular vectors provide information about patterns that exist in the data. Other aspects of the decomposition indicate the extent to which a gene exhibits a pattern similar to those provided by the singular vectors. Thus, once a set of interesting patterns has been identified, genes can be ranked by their relationship with said patterns.
| S-EPMC169189 | biostudies-literature
Project description:BackgroundNumerous studies on discovering the roles of long non-coding RNAs (lncRNAs) in the occurrence, development and prognosis progresses of various human diseases have drawn substantial attentions. Since only a tiny portion of lncRNA-disease associations have been properly annotated, an increasing number of computational methods have been proposed for predicting potential lncRNA-disease associations. However, traditional predicting models lack the ability to precisely extract features of biomolecules, it is urgent to find a model which can identify potential lncRNA-disease associations with both efficiency and accuracy.ResultsIn this study, we proposed a novel model, SVDNVLDA, which gained the linear and non-linear features of lncRNAs and diseases with Singular Value Decomposition (SVD) and node2vec methods respectively. The integrated features were constructed from connecting the linear and non-linear features of each entity, which could effectively enhance the semantics contained in ultimate representations. And an XGBoost classifier was employed for identifying potential lncRNA-disease associations eventually.ConclusionsWe propose a novel model to predict lncRNA-disease associations. This model is expected to identify potential relationships between lncRNAs and diseases and further explore the disease mechanisms at the lncRNA molecular level.
| S-EPMC8561941 | biostudies-literature
Project description:BackgroundAccurate classification of patients with a complex disease into subtypes has important implications for medicine and healthcare. Using more homogeneous disease subtypes in genetic association analysis will facilitate the detection of new genetic variants that are not detectible using the non-differentiated disease phenotype. Subtype differentiation can also improve diagnostic classification, which can in turn inform clinical decision making and treatment matching. Currently, the most sophisticated methods for disease subtyping perform cluster analysis using patients' clinical features. Without guidance from genetic information, the resultant subtypes are likely to be suboptimal and efforts at genetic association may fail.ResultsWe propose a multi-view matrix decomposition approach that integrates clinical features with genetic markers to detect confirmatory evidence for a disease subtype. This approach groups patients into clusters that are consistent between the clinical and genetic dimensions of data; it simultaneously identifies the clinical features that define the subtype and the genotypes associated with the subtype. A simulation study validated the proposed approach, showing that it identified hypothesized subtypes and associated features. In comparison to the latest biclustering and multi-view data analytics using real-life disease data, the proposed approach identified clinical subtypes of a disease that differed from each other more significantly in the genetic markers, thus demonstrating the superior performance of the proposed approach.ConclusionsThe proposed algorithm is an effective and superior alternative to the disease subtyping methods employed to date. Integration of phenotypic features with genetic markers in the subtyping analysis is a promising approach to identify concurrently disease subtypes and their genetic associations.
| S-EPMC4077642 | biostudies-literature
Project description:BackgroundSingular value decomposition (SVD) is a powerful technique for information retrieval; it helps uncover relationships between elements that are not prima facie related. SVD was initially developed to reduce the time needed for information retrieval and analysis of very large data sets in the complex internet environment. Since information retrieval from large-scale genome and proteome data sets has a similar level of complexity, SVD-based methods could also facilitate data analysis in this research area.ResultsWe found that SVD applied to amino acid sequences demonstrates relationships and provides a basis for producing clusters and cladograms, demonstrating evolutionary relatedness of species that correlates well with Linnaean taxonomy. The choice of a reasonable number of singular values is crucial for SVD-based studies. We found that fewer singular values are needed to produce biologically significant clusters when SVD is employed. Subsequently, we developed a method to determine the lowest number of singular values and fewest clusters needed to guarantee biological significance; this system was developed and validated by comparison with Linnaean taxonomic classification.ConclusionsBy using SVD, we can reduce uncertainty concerning the appropriate rank value necessary to perform accurate information retrieval analyses. In tests, clusters that we developed with SVD perfectly matched what was expected based on Linnaean taxonomy.
| S-EPMC3287580 | biostudies-literature
Project description:BackgroundFor marker effect models and genomic animal models, computational requirements increase with the number of loci and the number of genotyped individuals, respectively. In the latter case, the inverse genomic relationship matrix (GRM) is typically needed, which is computationally demanding to compute for large datasets. Thus, there is a great need for dimensionality-reduction methods that can analyze massive genomic data. For this purpose, we developed reduced-dimension singular value decomposition (SVD) based models for genomic prediction.MethodsFast SVD is performed by analyzing different chromosomes/genome segments in parallel and/or by restricting SVD to a limited core of genotyped individuals, producing chromosome- or segment-specific principal components (PC). Given a limited effective population size, nearly all the genetic variation can be effectively captured by a limited number of PC. Genomic prediction can then be performed either by PC ridge regression (PCRR) or by genomic animal models using an inverse GRM computed from the chosen PC (PCIG). In the latter case, computation of the inverse GRM will be feasible for any number of genotyped individuals and can be readily produced row- or element-wise.ResultsUsing simulated data, we show that PCRR and PCIG models, using chromosome-wise SVD of a core sample of individuals, are appropriate for genomic prediction in a larger population, and results in virtually identical predicted breeding values as the original full-dimension genomic model (r = 1.000). Compared with other algorithms (e.g. algorithm for proven and young animals, APY), the (chromosome-wise SVD-based) PCRR and PCIG models were more robust to size of the core sample, giving nearly identical results even down to 500 core individuals. The method was also successfully tested on a large multi-breed dataset.ConclusionsSVD can be used for dimensionality reduction of large genomic datasets. After SVD, genomic prediction using dense genomic data and many genotyped individuals can be done in a computationally efficient manner. Using this method, the resulting genomic estimated breeding values were virtually identical to those computed from a full-dimension genomic model.
| S-EPMC5831701 | biostudies-literature
Project description:MotivationHigh throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data analysis. Existing methods, aimed at signal reconstruction and deconvolution, in general, are either supervised, contain parameters that need to be estimated or present other types of ad hoc features. We here introduce SubMatrix Selection Singular Value Decomposition (SMSSVD), a parameter-free unsupervised signal decomposition and dimension reduction method, designed to reduce noise, adaptively for each low-rank-signal in a given data matrix, and represent the signals in the data in a way that enable unbiased exploratory analysis and reconstruction of multiple overlaid signals, including identifying groups of variables that drive different signals.ResultsThe SMSSVD method produces a denoised signal decomposition from a given data matrix. It also guarantees orthogonality between signal components in a straightforward manner and it is designed to make automation possible. We illustrate SMSSVD by applying it to several real and synthetic datasets and compare its performance to golden standard methods like PCA (Principal Component Analysis) and SPC (Sparse Principal Components, using Lasso constraints). The SMSSVD is computationally efficient and despite being a parameter-free method, in general, outperforms existing statistical learning methods.Availability and implementationA Julia implementation of SMSSVD is openly available on GitHub (https://github.com/rasmushenningsson/SubMatrixSelectionSVD.jl).Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6361234 | biostudies-literature
Project description:Singular value decomposition (SVD)-based clutter filters can robustly reject the tissue clutter as compared with the conventional high pass filter-based clutter filters. However, the computational burden of SVD makes real time SVD-based clutter filtering challenging (e.g. frame rate at least 10-15 Hz with region of interest of about 4 × 4 cm2). Recently, we proposed an acceleration method based on randomized SVD (rSVD) clutter filtering and randomized spatial downsampling, which can significantly reduce the computational complexity without compromising the clutter rejection capability. However, this method has not been implemented on an ultrasound scanner and tested for its performance. In this study, we implement this acceleration method on a Verasonics scanner using a multi-core CPU architecture, and evaluate the selections of the imaging and processing parameters to enable real time micro-vessel imaging. The Blood-to-Clutter Ratio (BCR) performance was evaluated on a Verasonics machine with different settings of parameters such as block size and ensemble size. The demonstration of real time process was implemented on a 12-core CPU (downsampling factor of 12, 12-threads in this study) host computer. The processing time of the rSVD-based clutter filter was less than 30 ms and BCRs were higher than 20 dB as the block size, ensemble size and the rank of tissue clutter subspace were set as 30 × 30, 45 and 26 respectively. We also demonstrate that the micro-vessel imaging frame rate of the proposed architecture can reach approximately 22 Hz when the block size, ensemble size and the rank of tissue clutter subspace were set as 20 × 20 pixels, 45 and 26 respectively (using both images and supplementary videos). The proposed method may be important for real time 2D scanning of tumor microvessels in 3D to select and store the most representative 2D view with most abnormal micro-vessels for better diagnosis.
| S-EPMC7293562 | biostudies-literature
Project description:Background/aimThe polygenic risk score (PRS) shows promise as a potentially effective approach to summarize genetic risk for complex diseases such as alcohol use disorder that is influenced by a combination of multiple variants, each of which has a very small effect. Yet, conventional PRS methods tend to over-adjust confounding factors in the discovery sample and thus have low power to predict the phenotype in the target sample. This study aims to address this important methodological issue.MethodsThis study proposed a new method to construct PRS by (1) approximating the polygenic model using a few principal components selected based on eigen-correlation in the discovery data; and (2) conducting principal component projection on the target data. Secondary data analysis was conducted on two large scale databases: the Study of Addiction: Genetics and Environment (SAGE; discovery data) and the National Longitudinal Study of Adolescent to Adult Health (Add Health; target data) to compare performance of the conventional and proposed methods.Result and conclusionThe results show that the proposed method has higher prediction power and can handle participants from different ancestry backgrounds. We also provide practical recommendations for setting the linkage disequilibrium (LD) and p value thresholds.
| S-EPMC8744290 | biostudies-literature