Cart (Loading....) | Create Account
Close category search window
 

A Multi-stage Spectral Alignment Strategy for Unrestrictive PTM Peptide Identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Changyong Yu ; Northeastern Univ. at Qinhuangdao, Qinhuangdao, China ; Guoren Wang ; Yuhai Zhao ; Keming Mao

Spectral alignment, which studies the matching of ion peaks between the investigated spectrum and theoretical spectrum of peptide in the peptide database, is a very useful topic in computational proteomics. So far, the efficient, accurate and practical spectral alignment algorithm is still urgently needed due to its important application in the PTM unrestrictive peptide identification. In this paper, a multi-stage spectral alignment algorithm called MS-SA is proposed with the following two features: (a) it provided four different levels of alignment aims according to the alignment quality which can be specified by users, (b) it provided the capability of analyzing the detail modification types and locations for spectrum with multiple PTM sites. Therefore, MS-SA is of high practicality and can be applied to different specific applications such as being a filter in the large-scale database searching, a tool for detail modification types and locations analysis in small-scale spectral alignment and so on. A large number of experiments on real MS/MS data have been done for testing the performance of MS-SA. Also, the results of MS-SA are compared with those of same type of algorithms such as SA and SPC. The results show that MS-SA possesses strong practicality and outperforms the SA and SPC algorithms on several aspects.

Published in:

BioInformatics and BioEngineering (BIBE), 2010 IEEE International Conference on

Date of Conference:

May 31 2010-June 3 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.