Dataset Information

PGCA: An algorithm to link protein groups created from MS/MS data.

ABSTRACT: The quantitation of proteins using shotgun proteomics has gained popularity in the last decades, simplifying sample handling procedures, removing extensive protein separation steps and achieving a relatively high throughput readout. The process starts with the digestion of the protein mixture into peptides, which are then separated by liquid chromatography and sequenced by tandem mass spectrometry (MS/MS). At the end of the workflow, recovering the identity of the proteins originally present in the sample is often a difficult and ambiguous process, because more than one protein identifier may match a set of peptides identified from the MS/MS spectra. To address this identification problem, many MS/MS data processing software tools combine all plausible protein identifiers matching a common set of peptides into a protein group. However, this solution introduces new challenges in studies with multiple experimental runs, which can be characterized by three main factors: i) protein groups' identifiers are local, i.e., they vary run to run, ii) the composition of each group may change across runs, and iii) the supporting evidence of proteins within each group may also change across runs. Since in general there is no conclusive evidence about the absence of proteins in the groups, protein groups need to be linked across different runs in subsequent statistical analyses. We propose an algorithm, called Protein Group Code Algorithm (PGCA), to link groups from multiple experimental runs by forming global protein groups from connected local groups. The algorithm is computationally inexpensive and enables the connection and analysis of lists of protein groups across runs needed in biomarkers studies. We illustrate the identification problem and the stability of the PGCA mapping using 65 iTRAQ experimental runs. Further, we use two biomarker studies to show how PGCA enables the discovery of relevant candidate protein group markers with similar but non-identical compositions in different runs.

SUBMITTER: Kepplinger D

PROVIDER: S-EPMC5451011 | biostudies-literature | 2017

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

PGCA: An algorithm to link protein groups created from MS/MS data.

Kepplinger David D Takhar Mandeep M Sasaki Mayu M Hollander Zsuzsanna Z Smith Derek D McManus Bruce B McMaster W Robert WR Ng Raymond T RT Cohen Freue Gabriela V GV

PloS one 20170531 5

The quantitation of proteins using shotgun proteomics has gained popularity in the last decades, simplifying sample handling procedures, removing extensive protein separation steps and achieving a relatively high throughput readout. The process starts with the digestion of the protein mixture into peptides, which are then separated by liquid chromatography and sequenced by tandem mass spectrometry (MS/MS). At the end of the workflow, recovering the identity of the proteins originally present in ...[more]

PMID: 28562641

Similar Datasets

Project description:BackgroundThe previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a number of different ways to identify cell cycle dependent genes. In this study, we pose the hypothesis that cell cycle dependent genes are considered as oscillating systems with a rhythm, i.e. systems producing response signals with period and frequency. Therefore, we are motivated to apply the theory of multivariate phase synchronization for clustering cell cycle specific genome-wide expression data.ResultsWe propose the strategy to find groups of genes according to the specific biological process by analyzing cell cycle specific gene expression data. To evaluate the propose method, we use the modified Kuramoto model, which is a phase governing equation that provides the long-term dynamics of globally coupled oscillators. With this equation, we simulate two groups of expression signals, and the simulated signals from each group shares their own common rhythm. Then, the simulated expression data are mixed with randomly generated expression data to be used as input data set to the algorithm. Using these simulated expression data, it is shown that the algorithm is able to identify expression signals that are involved in the same oscillating process. We also evaluate the method with yeast cell cycle expression data. It is shown that the output clusters by the proposed algorithm include genes, which are closely associated with each other by sharing significant Gene Ontology terms of biological process and/or having relatively many known biological interactions. Therefore, the evaluation analysis indicates that the method is able to identify expression signals according to the specific biological process. Our evaluation analysis also indicates that some portion of output by the proposed algorithm is not obtainable by the traditional clustering algorithm with Euclidean distance or linear correlation.ConclusionBased on the evaluation experiments, we draw the conclusion as follows: 1) Based on the theory of multivariate phase synchronization, it is feasible to find groups of genes, which have relevant biological interactions and/or significantly shared GO slim terms of biological process, using cell cycle specific gene expression signals. 2) Among all the output clusters by the proposed algorithm, the cluster with relatively large size has a tendency to include more known interactions than the one with relatively small size. 3) It is feasible to understand the cell cycle specific gene expression patterns as the phenomenon of collective synchronization. 4) The proposed algorithm is able to find prominent groups of genes, which are not obtainable by traditional clustering algorithm.

Project description:BackgroundEx vivo androgen prodrug conversion by blood esterases after oral androgen ester administration may result in an overestimation of the measured blood androgens.ObjectiveWe investigated whether blood collection tubes with esterase inhibitors decreased the conversion of testosterone undecanoate (TU) and dimethandrolone undecanoate (DMAU) to their active metabolites, testosterone (T), and dimethandrolone (DMA), providing a more accurate assessment of circulating T/DMA levels.MethodsBlood was collected in tubes with/without esterase inhibitors from: (i) four healthy and four hypogonadal men receiving no androgens and spiked ex vivo with TU/DMAU; (ii) four men taking oral TU (Andriol® ); and (iii) eight hypogonadal men dosed with oral 316 mg TU and 15 healthy men with 200 mg DMAU. T/DMA levels were measured by LC-MS/MS.ResultsSodium fluoride (NaF, an esterase inhibitor) decreased measured T levels by 14.2% in men not receiving TU. Increasing amounts of TU/DMAU added to blood collected into plain tubes resulted in a concentration-dependent overestimation of T/DMA that was reduced by collecting blood into NaF tubes (by 30-85%), and keeping samples at 4 °C and minimizing time prior to centrifugation. After oral TU/DMAU administration to men, when TU/DMAU levels were >15/10 ng/mL, respectively, blood collected in NaF tubes yielded lower measured T concentrations by 15-30% and DMA by 22% due to an additional inhibitory effect of NaF on blood esterases.ConclusionNaF directly lowers plasma T/DMA levels measured by LC-MS/MS and also inhibits blood esterase activity. Overestimation of T/DMA in blood collected in tubes without NaF after oral TU/DMAU administration is important for pharmacokinetics studies in drug development clinical trials but may have limited impact in clinical practice/utilization because the differences between measured and true androgen values are modest and the wide therapeutic androgen efficacy ranges obviate the need for highly accurate androgen measurements during therapy.

Project description:BACKGROUND: Protein function determination is a key challenge in the post-genomic era. Experimental determination of protein functions is accurate, but time-consuming and resource-intensive. A cost-effective alternative is to use the known information about sequence, structure, and functional properties of genes and proteins to predict functions using statistical methods. In this paper, we describe the Multi-Source k-Nearest Neighbor (MS-kNN) algorithm for function prediction, which finds k-nearest neighbors of a query protein based on different types of similarity measures and predicts its function by weighted averaging of its neighbors' functions. Specifically, we used 3 data sources to calculate the similarity scores: sequence similarity, protein-protein interactions, and gene expressions. RESULTS: We report the results in the context of 2011 Critical Assessment of Function Annotation (CAFA). Prior to CAFA submission deadline, we evaluated our algorithm on 1,302 human test proteins that were represented in all 3 data sources. Using only the sequence similarity information, MS-kNN had term-based Area Under the Curve (AUC) accuracy of Gene Ontology (GO) molecular function predictions of 0.728 when 7,412 human training proteins were used, and 0.819 when 35,622 training proteins from multiple eukaryotic and prokaryotic organisms were used. By aggregating predictions from all three sources, the AUC was further improved to 0.848. Similar result was observed on prediction of GO biological processes. Testing on 595 proteins that were annotated after the CAFA submission deadline showed that overall MS-kNN accuracy was higher than that of baseline algorithms Gotcha and BLAST, which were based solely on sequence similarity information. Since only 10 of the 595 proteins were represented by all 3 data sources, and 66 by two data sources, the difference between 3-source and one-source MS-kNN was rather small. CONCLUSIONS: Based on our results, we have several useful insights: (1) the k-nearest neighbor algorithm is an efficient and effective model for protein function prediction; (2) it is beneficial to transfer functions across a wide range of organisms; (3) it is helpful to integrate multiple sources of protein information.

Dataset Information

PGCA: An algorithm to link protein groups created from MS/MS data.

Publications

PGCA: An algorithm to link protein groups created from MS/MS data.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets