PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
November 10, 2011Journal of Proteome Research954 citationsOpen Access

Universal and Confident Phosphorylation Site Localization Using phosphoRS

View Full Paper
TTThomas TausTKThomas KöcherPPPeter Pichler

Key Points

Key points are not available for this paper at this time.

Abstract

An algorithm for the assignment of phosphorylation sites in peptides is described. The program uses tandem mass spectrometry data in conjunction with the respective peptide sequences to calculate site probabilities for all potential phosphorylation sites. Tandem mass spectra from synthetic phosphopeptides were used for optimization of the scoring parameters employing all commonly used fragmentation techniques. Calculation of probabilities was adapted to the different fragmentation methods and to the maximum mass deviation of the analysis. The software includes a novel approach to peak extraction, required for matching experimental data to the theoretical values of all isoforms, by defining individual peak depths for the different regions of the tandem mass spectrum. Mixtures of synthetic phosphopeptides were used to validate the program by calculation of its false localization rate versus site probability cutoff characteristic. Notably, the empirical obtained precision was higher than indicated by the applied probability cutoff. In addition, the performance of the algorithm was compared to existing approaches to site localization such as Ascore. In order to assess the practical applicability of the algorithm to large data sets, phosphopeptides from a biological sample were analyzed, localizing more than 3000 nonredundant phosphorylation sites. Finally, the results obtained for the different fragmentation methods and localization tools were compared and discussed.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Taus et al. (2011) studied this question.

synapsesocial.com/papers/6a61dd80f5a6cede3a89af26https://doi.org/10.1021/pr200611n
Ask AI
Helpful
Bookmark
Share
View Full Paper