Skip to main content

A novel approach to denoising ion trap tandem mass spectra

Abstract

Background

Mass spectrometers can produce a large number of tandem mass spectra. They are unfortunately noise-contaminated. Noises can affect the quality of tandem mass spectra and thus increase the false positives and false negatives in the peptide identification. Therefore, it is appealing to develop an approach to denoising tandem mass spectra.

Results

We propose a novel approach to denoising tandem mass spectra. The proposed approach consists of two modules: spectral peak intensity adjustment and intensity local maximum extraction. In the spectral peak intensity adjustment module, we introduce five features to describe the quality of each peak. Based on these features, a score is calculated for each peak and is used to adjust its intensity. As a result, the intensity will be adjusted to a local maximum if a peak is a signal peak, and it will be decreased if the peak is a noisy one. The second module uses a morphological reconstruction filter to remove the peaks whose intensities are not the local maxima of the spectrum. Experiments have been conducted on two ion trap tandem mass spectral datasets: ISB and TOV. Experimental results show that our algorithm can remove about 69% of the peaks of a spectrum. At the same time, the number of spectra that can be identified by Mascot algorithm increases by 31.23% and 14.12% for the two tandem mass spectra datasets, respectively.

Conclusion

The proposed denoising algorithm can be integrated into current popular peptide identification algorithms such as Mascot to improve the reliability of assigning peptides to spectra.

Availability of the software

The software created from this work is available upon request.

Background

Nowadays, two approaches are widely used for peptide identification from tandem mass (MS/MS) spectra: database searching and de-novo sequencing [1, 2]. De-novo sequencing algorithms assign peptides to MS/MS spectra based on the spectra alone. Therefore, these algorithms are invaluable for the identification of both known and unknown peptides. However, de-novo algorithms are most useful when spectra have complete or nearly complete fragment peaks and less noisy peaks, because these algorithms rely on the presence of successive b- or y- ions to find a whole peptide sequence or a sequence tag. De-novo algorithms may find ambiguous sequence for real-world spectra because many spectra are far from complete. On the other hand, if a database of all proteins from a genome is accessible, spectra can be assigned to peptides by searching the peptides in the database [1]. Database search based algorithms are currently the leading peptide identification methods. Most database search approaches employ a score function. Different search engines such as Sequest [3] and Mascot [4] adopt different scoring systems. Experiments show that only one search engine may not be reliable for the identification of peptides. To increase the reliability of peptide identifications, some researchers have combined the results of different search engines to assign peptides to spectra. For example, the program Scaffold [5] assigns probabilities to the search results from different peptide identification algorithms such as Mascot [4], Sequest [3], X!Tandem [6], Phenyx [7], Spectrum Mill (Agilent Technologies), and OMSSA [8]. By using the above strategy, it is expected to improve the accuracy of peptide identification from MS/MS spectra. However, with the steady increase of the database size, more and more peptides similar to the one investigated can be present in the searched database. On the other hand, the spectrum may contain very few signal peaks or weak signal peaks whose intensities are indistinguishable from those of noisy peaks [9].

Spectral pre-processing, which can improve the reliability of assigning peptides to spectra, becomes very important in current proteomics research. Tandem mass spectrum pre-processing aims at processing spectra produced by tandem mass spectrometers to increase the efficiency of subsequent peptide identification from spectra. Five types of pre-processing methods are widely used: spectrum normalization, spectrum clustering, precursor charge determination, spectrum denoising, and spectrum quality assessment [10–23]. It is believed that these pre-processing algorithms increase the number of identified peptides, and improve the reliability of peptide identification from tandem mass spectra. Now, spectral pre-processing has become a critical module in many high throughput data processing pipelines. Both database search and de-novo peptide identification algorithms can benefit from these pre-processing methods.

Spectrum denoising methods intend to keep signal peaks (reflecting peptide fragment ions) while removing noisy peaks (not reflecting peptide fragment ions). In a typical tandem mass spectrum, up to 80% peaks are noises [24]. Therefore, it is necessary to apply a spectrum denoising method before assigning peptides to spectra. In fact, most peptide identification algorithms adopt denoising methods as a pre-processing step. For example, PEAKS [25], PepNovo [26] and AUDENS [27] all have their own denoising models. However, there are many ad hoc problems for spectrum denoising issues. Firstly, the property of un-equally spaced m/z values of spectra makes it improper to directly use any standard denoising algorithms for traditional signal processing [16]. Secondly, the noises in a spectrum are hardly modeled by a single statistical model. For example, most noisy peaks are in the middle of m/z range of a spectrum, and accordingly, far fewer noisy peaks are in the two ends of a spectrum [24]. Besides, the peaks in the middle of m/z range tend to have higher intensities than those at the two ends.

Generally, there exist three types of spectrum denoising algorithms: threshold, digital signal processing, and machine learning or heuristic search algorithms. Threshold methods simply discard peaks with intensities below a threshold. However, the thresholds are hardly determined because a global optimal threshold may not exist for an algorithm to work well. Besides, these methods only use the intensity information of each peak to determine whether a peak is a fragment ion or a noisy peak. These methods implicitly assume the independence of peaks without considering the interrelationship. In fact, a fragment ion may be related to other fragment ions in a true tandem mass spectrum. For example, the mass difference of two signal ions may be equal to the mass of one of the 20 amino acids, e.g., b i , b i+1ions. The second type of methods uses digital signal processing methods such as Fourier analysis and wavelet analysis for denoising spectra [28]. Digital signal processing methods are successfully used in other fields such as speech recognition, image processing, and computer vision. However, these methods assume that the m/z difference between peaks is a constant (interpolation is used to produce equally spaced m/z values at the expense of introducing extra peaks). Besides, as the noises are m/z dependent, short time Fourier transform or wavelet transform are better choices than Fourier transform. These methods reduce the intensities of the "noisy" peaks without removing them. Just as threshold methods, digital signal processing methods also use the intensity information only. The third type of methods is based on machine learning or some heuristic search using not only intensity information of peaks but also some additional information contained in a spectrum such as isotopic ions or complementary ions [29, 30]. However, noises are neither equally distributed in the whole m/z range of a spectrum, nor equally distributed among features extracted from a spectrum used for machine learning. As a result, the noises may degenerate the performance of classifiers, and this type of methods may not perform as well as expected. Therefore, we need novel denoising algorithms which are more robust than threshold methods, do not need to introduce extra pseudo peaks, and are "adaptive" to the m/z dependence properties of noises in a spectrum.

In this paper, we present a spectral denoising algorithm which partially solves the above mentioned shortcomings of previous denoising algorithms. The proposed algorithm first adjusts the intensities of the peaks of a spectrum using several features extracted from the spectrum. Then the algorithm removes the fragment ions whose intensities are not the local maxima of the intensity-adjusted spectrum using a morphological reconstruction filter [31]. Experiments are conducted on two ion trap mass spectral datasets, and the results show that our algorithm can remove about 69% of the peaks which are likely noisy peaks among a spectrum. At the same time, the number of spectra that can be identified by Mascot increases by 31.23% and 14.12% for the spectra from two datasets.

Results and Discussion

Similar to [9, 16, 30], the Mascot search engine is used to evaluate our denoising algorithm. The raw spectra (un-denoised spectra) and the denoised spectra are searched using the Mascot search engine with the same parameters. The parameters used are given in Table 1. A spectrum is identified if its Mascot ion score is larger than a certain threshold. Mascot can provide two thresholds for each peptide: the homology threshold and the identity threshold [32–34] (Note: one can find both the identity threshold and homology threshold for a spectrum by putting the cursor above the query number of the Mascot search report). Each of these two thresholds is different for different peptides. Most proteomics laboratories [32] use the identity threshold as the cut-off value to expect that the false discover rate of the peptide identification is less than (typically) 5%. In this study, we also adopt the identity threshold as the cut-off value, i.e., a spectrum is identified if its Mascot ion score is larger than its identity threshold. By doing so, the false discovery rate is expected to be less than 5% for peptide identification from both the raw and denoised spectra.

Table 1 The parameters of Mascot search engine

Overall spectrum denoising results

Experiments are conducted on two ion trap tandem mass spectral datasets (ISB and TOV) to illustrate the performance of the proposed spectral denoising method by comparing the Mascot search results from the raw datasets to those from the same datasets denoised by the proposed method. The detail description of these two datasets can be found in Section "Material and Methods". The results of comparisons follow as:

Table 2 lists the overall results of experiments. From Table 2, the proposed denoising algorithm can remove about 68.59% (= (156 - 49)/156) of peaks among a spectrum from ISB dataset, and about 68.64% (= (118 - 37)/118) of peaks among a spectrum from TOV dataset. These removed peaks are likely noisy peaks because Mascot performs better after these peaks are removed as discussed below. This study also records the rough Mascot search time (in minutes). From Table 2, by using the proposed denoising algorithm about 13.04% (= (23 - 20)/23) of search time is saved for the spectra of ISB dataset, while about 7.14% (= (14 - 13)/14) of search time is saved for the spectra of TOV dataset. The results illustrate that the proposed method can reduce the time for the process of assigning peptides to spectra because most noisy peaks of a spectrum are removed, especially when the number of spectra in a dataset is large. The number of identified peptides is increased by applying the proposed denoisng method. In Table 2, the number of identified spectra increases by 31.23% (= (1458 - 1111)/1111) for the spectra of the ISB dataset, and 14.12% (= (2214 - 1940)/1940) for the spectra of the TOV dataset. The increasing rate of the newly identified spectra after applying the proposed denoising method is greater for the spectra in ISB dataset than for the spectra in TOV dataset. The first reason may be that the spectra in ISB dataset have more noisy peaks than those in TOV dataset. For example, the mean of the number of peaks for the spectra in ISB dataset is 156 while that is only 118 for the spectra in TOV dataset. The second reason may be that the "quality" of the spectra in ISB dataset is inferior to the quality of the spectra in TOV dataset. There are 37,044 spectra in ISB dataset, but only 1111 spectra (i.e. ~3%) can be identified before applying the proposed denoising method. On the other hand, there are 22,576 spectra in TOV dataset, while 1940 (~9%) spectra can be identified before applying the denoising method by Mascot search engine. In addition, from Figure 1(a), up to 93.61% (= 1040/(1040 + 71)) of spectra identified in the raw spectra are also identified after applying the denoising algorithm for ISB dataset. Figure 1(b) shows up to 91.96% (= 1784/(1784 + 156)) of spectra identified in the raw spectra are also identified after applying the denoising algorithm for TOV dataset.

Table 2 The overall results of the denoising algorithm.
Figure 1
figure 1

Venn diagram showing the overlap between the identified spectra from the raw spectra and denoised spectra of ISB dataset (a), and TOV dataset (b).

We compute the false negative rate of peptide identifications from the ISB dataset because these spectra are "standard" spectra, and were intensively studied by other groups [35, 36]. Note that the spectra in ISB dataset are from 18 known proteins. Thus a spectrum is a false negative if its Mascot ion score is less than its identity threshold while the spectrum is identified from the 18 known proteins by other methods. A spectrum is a false positive if its Mascot ion score is greater than its identity threshold while the spectrum is not identified from the 18 known proteins. Combined the results from [35, 36] and our manual verification, we create Table 3 to show distribution of the false positives, and true positives for the denoised spectra and raw spectra. From Table 3, 406 spectra not identified from the raw spectra are false negative for peptide identification, which results in a false negative rate of 26.96% (= 406/1506) for the raw spectral identification. Similarly, 65 spectra not identified from the denoised spectra are false negative for peptide identification, which results in a false negative rate of 4.32% (= 65/1506). In other words, the false negative rate is dramatically reduced from 26.96% to 4.32% after the proposed algorithm is applied. This indicates that Mascot can perform much better by combining with the proposed method, given the same false discovery rate of 5% controlled by the Mascot identity threshold.

Table 3 The distributions of the false positives and true positives in ISB spectra identified by the Mascot search engine.

The functions of each module

The proposed algorithm has two modules: intensity adjustment and peak extraction. The functions of each module in the proposed algorithm are investigated in terms of peptide ion scores. As shown in Figure 2, both intensity adjustment and peak extraction can increase the number of identified spectra, but peak extraction combined with intensity adjustment can help to identify more spectra than using either an individual module.

Figure 2
figure 2

The number of spectra whose Mascot ion scores are greater than a given value for the raw and the processed spectra in ISB dataset (a) and TOV dataset (b). Here the "Raw" spectra are the unprocessed spectra; "Adjusted" spectra are the peak intensity-adjusted spectra; "Peak" spectra are the spectra processed by the morphological filter; and "Denoised" spectra are the spectra processed by peak extraction after intensity adjustment.

Discussion and further improvement

Our proposed algorithm does not need to resample each spectrum to have the same m/z distance between two adjacent peaks. Therefore, the algorithm neither introduces additional "noisy" peaks nor changes the m/z of each peak. This property is one of the advantages of our algorithm over other denoising algorithms based on Fourier analysis and wavelet analysis, e.g., MS-cleaner [16].

Unlike threshold based methods, our algorithm does not need to provide a global threshold. In fact, the morphological reconstruction filter can be considered as an adaptive signal processing method, as it "adaptively" extracts the local maxima of a spectrum. This property of morphological reconstruction filter indicates that our algorithm could be more robust than threshold based denoising algorithms [25].

In the proposed algorithm, for the intensity adjustment module, the values of the parameters are chosen according to Sequest, and these values are proved to be effective in identifying peptides from spectra. For the morphological reconstruction filter, there is only one parameter to choose. This parameter can be set as a very small value, e.g., the smallest intensity difference between two peaks. While for the methods based on wavelet analysis, one needs to choose several parameters such as the wavelet basis functions and the thresholds of the wavelet coefficients. These parameters can significantly influence the final denoising results.

The proposed algorithm uses more information about a theoretical peptide fragment ion in denoising spectra. We construct several features to adjust the intensities of a peak. Although the intensities of peaks at the two ends of each spectrum are less enhanced than those in the middle of m/z range, the intensities of signal peaks are still enhanced more than those of the noisy peaks. Thus the signal peaks are still local maxima of a spectrum, and the morphological reconstruction filter can correctly discriminate the signal peaks from noisy ones. From this point of view, our method is more robust than machine learning based denoising algorithms [30] because our algorithm decreases the influence of the unequally distributed noises in tandem mass spectra.

The influence of the denoising method is different to the spectra with different charge states. As shown in Table 4, Mascot can identify another 177 triply charged spectra in ISB dataset after applying the proposed denoising algorithm, i.e., about 42.34% (= 177/418) of newly identified spectra are triply charged. The number of triply charged spectra accounts for about 33.80% (= 24/71) of the lost spectra. Therefore the denoising algorithm can help to find more triply charged spectra. This phenomenon is more obvious for the spectra in TOV dataset. For example, about 24.88% (= 107/430) of newly identified spectra are triply charged, while only 12.82% (= 20/156) of spectra are triply charged of all the lost spectra after applying the denoising algorithm. While for singly charged spectra, although the denoising method can increase the number of identified spectra, the singly charged spectra account for about 15.49% (= 11/71) of the lost spectra. This number is relatively large taking into consideration the small number of originally identified singly charged spectra. Therefore, one can expect that a denoising algorithm which employs several properties of a tandem mass spectrum (such as its charge state and the number of peaks [30]) performs better than the one which employs a single property of the tandem mass spectrum. The proposed denoising algorithm can be tuned to preprocess tandem mass spectra for other peptide identification algorithms such as Sequest or de-novo algorithms. Note that Sequest algorithm is based on convolution technique. The convolution results are determined by the peaks which have extra-large intensities even if experimental spectra are normalized first in Sequest algorithm. For this reason, we may need to design other spectral normalization algorithms [18, 37] or change the intensities of peaks which are not removed after applying the denoising algorithm back to their original intensities. Anyway, because noisy peaks are removed, peptide identification algorithms can benefit from the proposed denoising algorithm. But for specific peptide identification algorithms, because their different use of intensity information of spectra, specific normalization algorithms are needed for these algorithms to work optimally. A further improvement of the proposed denoising algorithm is to combine denoising algorithms with quality assessment algorithms for pre-processing tandem mass spectra. By this way, we can improve the reliability of assigning peptides to spectra, and increase the information that can be extracted from tandem mass spectra. For example, if the features used for enhancing intensities of peaks of a spectrum are very small, this spectrum may be a poor quality spectrum, and this spectrum can be excluded from further processing.

Table 4 The influence of charge states to the filtering results.

Conclusion

This paper has presented a spectral denoising algorithm. The proposed algorithm first adjusts the intensities of spectra. After peak intensity adjustment, the intensities of signal peaks in a spectrum become local maxima of the spectrum. Second, the peak intensity-adjusted spectra are filtered using a morphological reconstruction filter. The signal peaks are kept while the noisy peaks are removed after applying the morphological reconstruction filter. By applying the denoising method, about 69% of peaks among a spectrum can be removed. At the same time, the number of spectra that can be identified by Mascot algorithm increases by 31.23% and 14.12% for the spectra in ISB dataset and TOV dataset, respectively. In summary, the proposed algorithm can remove most of noisy peaks, and increase the reliability of assigning peptides to spectra. As a result, more peptides can be identified from denoised spectra than from raw spectra.

Materials and methods

The proposed spectral denoising method consists of two unique modules: peak intensity adjustment and intensity local maximum extraction. The first one is used to adjust the intensities of signal peaks in a spectrum. After adjustment, intensities of signal peaks are expected to be the local maxima of the spectrum. The second one is used to select these local maxima of the signal peak intensity-adjusted spectra, and thus peaks whose intensities are not the local maxima are removed.

Datasets

This study employs two ion trap tandem mass spectral datasets: ISB dataset and TOV dataset to investigate the performance of the introduced denoising algorithm. The following is a brief description of these datasets.

(1) ISB dataset

The spectra in ISB dataset are acquired from a low resolution ESI ion trap mass spectrometer as described in [35]. These spectra consisting of 22 LC/MS/MS runs are produced by Institute of System Biology (ISB) from 18 control mixture proteins. There are a total of 37, 044 spectra in ISB dataset. These spectra are searched using Mascot against the ipi.HUMAN.v3.48.fasta (taken from EMBL-EBI, http://www.ebi.ac.uk/IPI/IPIhuman.html) containing 71, 399 sequences and 5 contaminant sequences (P00760, P00761, P02769, Q29443 and Q29463 from http://www.uniprot.org) appended with the sequences of the mixture proteins (from http://www.uniprot.org).

(2) TOV dataset

The MS/MS spectra are acquired from a LCQ DECA XP ion trap spectrometer (ThermoElectron Corp.) as described in [38]. The number of spectra in this dataset is 22, 576, and these spectra are searched using Mascot against the ipi.HUMAN.v3.42.fasta (taken from EMBL-EBI, http://www.ebi.ac.uk/IPI/IPIhuman.html) containing 72, 340 protein sequences and 5 contaminant sequences (P00760, P00761, P02769, Q29443 and Q29463 from http://www.uniprot.org).

Peak intensity adjustment

The intensity is an important attribute of a peak in a spectrum. The empirical approaches usually assume that peaks with high intensities are more likely to be signal peaks than those with low intensities.

However, there are many exceptions to these approaches. Thus to distinguish signal peaks from noisy peaks, more attributes of peaks should be taken into consideration. For example, signal peaks may have complementary peaks whose masses are added to the signal peaks to give the mass of a precursor ion. In this study, five features are constructed for each peak on basis of the properties of theoretical peptide mass spectra [22]. A score for each peak is calculated by a linear combination of these features. To define these features, as in [22], four variables are firstly introduced

d i f 1 ( x , y ) = x − y d i f 2 ( x , y ) = x − ( y + 1 ) / 2 s u m 1 ( x , y ) = x + y s u m 2 ( x , y ) = x + ( y + 1 ) / 2 MathType@MTEF@1@1@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeqabqqaaaaabaGaemizaqMaemyAaKMaemOzayMaeGymaeJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyypa0JaemiEaGNaeyOeI0IaemyEaKhabaGaemizaqMaemyAaKMaemOzayMaeGOmaiJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyypa0JaemiEaGNaeyOeI0IaeiikaGIaemyEaKNaey4kaSIaeGymaeJaeiykaKIaei4la8IaeGOmaidabaGaem4CamNaemyDauNaemyBa0MaeGymaeJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyypa0JaemiEaGNaey4kaSIaemyEaKhabaGaem4CamNaemyDauNaemyBa0MaeGOmaiJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyypa0JaemiEaGNaey4kaSIaeiikaGIaemyEaKNaey4kaSIaeGymaeJaeiykaKIaei4la8IaeGOmaidaaaaa@74DA@

For a peak with the m/z value of x (for simplicity, this peak is called peak x) of a spectrum S, the first feature F 1 collects the number of peaks whose mass differences with x approximately equal the mass of one of the twenty amino acids.

F 1 = | { y | a b s ( d i f 1 ( x , y ) ) ≈ M i  or a b s ( d i f 1 ( x , y ) ) ≈ M i / 2  or a b s ( d i f 2 ( x , y ) ) ≈ M i / 2  or a b s ( d i f 2 ( y , x ) ) ≈ M i / 2 } | MathType@MTEF@1@1@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabqqaaaaabaGaemOray0aaSbaaSqaaiabigdaXaqabaGccqGH9aqpcqGG8baFcqGG7bWEcqWG5bqEcqGG8baFcqWGHbqycqWGIbGycqWGZbWCcqGGOaakcqWGKbazcqWGPbqAcqWGMbGzcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemyAaKgabeaakiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGHbqycqWGIbGycqWGZbWCcqGGOaakcqWGKbazcqWGPbqAcqWGMbGzcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemyAaKgabeaakiabc+caViabikdaYiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGHbqycqWGIbGycqWGZbWCcqGGOaakcqWGKbazcqWGPbqAcqWGMbGzcqaIYaGmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemyAaKgabeaakiabc+caViabikdaYiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGHbqycqWGIbGycqWGZbWCcqGGOaakcqWGKbazcqWGPbqAcqWGMbGzcqaIYaGmcqGGOaakcqWG5bqEcqGGSaalcqWG4baEcqGGPaqkcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemyAaKgabeaakiabc+caViabikdaYiabc2ha9jabcYha8baaaaa@9CFA@

where |•| is the cardinality of a set; y is the m/z value of a peak in S; abs is the absolute value function; and M i (i = 1, 2,..., 20) is the mass of one of the twenty amino acids. In this study we consider all Methionine amino acids to be sulfoxidized and do not distinguish three pairs of amino acids in their masses: Isoleucine vs. Leucine, Glutamine vs. Lysine, and sulfoxidized Methionine vs. Phenylalanine as the masses of each pair are very close. If both peaks x and y are singly charged, their difference equals the mass of one of the 20 amino acids, and abs(dif 1(x, y)) ≈ M i ; if both x and y are doubly charged, their difference equals half of the mass of one of the 20 amino acid, and abs(dif 1(x, y)) ≈ M i /2; if x is singly charged while y is doubly charged, abs(dif 2(x, y)) equals half of one of the mass of the 20 amino acids; and if x is doubly charged while y is singly charged, abs(dif 2(y, x)) equals half of the mass of one of the 20 amino acids. The comparison implied by ≈ uses a tolerance. Bern et al used ± 0.37 [18] for constructing features for the quality assessment of ion trap tandem mass spectra. Wong et al used ± 0.3 for fragment ion mass tolerance, and ± 1 for precursor ion mass tolerance for ion trap tandem mass spectra [39]. In this study, we use ± 0.8 for fragment ion mass tolerance, and ± 2 for precursor ion mass tolerance because these parameters are reasonable for ion trap spectra for the Mascot search engine to give good peptide identification results.

The second feature F 2 collects the number of peaks whose masses added to x approximately equal the mass of the precursor ion.

F 2 = | { y | s u m 1 ( x , y ) ≈ M p a r e n t + 2 ∗ m ( H )  or s u m 1 ( x , y ) ≈ M p a r e n t / 2 + 2 ∗ m ( H )  or s u m 2 ( x , y ) ≈ M p a r n e t / 2 + 2 ∗ m ( H )  or s u m 2 ( y , x ) ≈ M p a r n e t / 2 + 2 ∗ m ( H ) } | MathType@MTEF@1@1@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabqqaaaaabaGaemOray0aaSbaaSqaaiabikdaYaqabaGccqGH9aqpcqGG8baFcqGG7bWEcqWG5bqEcqGG8baFcqWGZbWCcqWG1bqDcqWGTbqBcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemiCaaNaemyyaeMaemOCaiNaemyzauMaemOBa4MaemiDaqhabeaakiabgUcaRiabikdaYiabgEHiQiabd2gaTjabcIcaOiabdIeaijabcMcaPiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGZbWCcqWG1bqDcqWGTbqBcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemiCaaNaemyyaeMaemOCaiNaemyzauMaemOBa4MaemiDaqhabeaakiabc+caViabikdaYiabgUcaRiabikdaYiabgEHiQiabd2gaTjabcIcaOiabdIeaijabcMcaPiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGZbWCcqWG1bqDcqWGTbqBcqaIYaGmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemiCaaNaemyyaeMaemOCaiNaemOBa4MaemyzauMaemiDaqhabeaakiabc+caViabikdaYiabgUcaRiabikdaYiabgEHiQiabd2gaTjabcIcaOiabdIeaijabcMcaPiabbccaGiabb+gaVjabbkhaYbqaaiaaxMaacqWGZbWCcqWG1bqDcqWGTbqBcqaIYaGmcqGGOaakcqWG5bqEcqGGSaalcqWG4baEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaemiCaaNaemyyaeMaemOCaiNaemOBa4MaemyzauMaemiDaqhabeaakiabc+caViabikdaYiabgUcaRiabikdaYiabgEHiQiabd2gaTjabcIcaOiabdIeaijabcMcaPiabc2ha9jabcYha8baaaaa@BEA8@

where M parent is the mass of the precursor ion (parent). As for F 1, if both peaks x and y are singly charged, sum 1(x, y) ≈ M parent + 2 * m(H) ; if both x and y are doubly charged, sum 1(x, y) ≈ M parent /2 + 2 * m(H); if x is singly charged while y is doubly charged, sum 2(x, y) ≈ M parnet /2 + 2 * m(H); and if x is doubly charged while y is singly charged, sum 2(y, x) ≈ M parnet /2 + 2 * m(H).

The third feature F 3 collects the number of peaks which are produced by losing a water or an ammonia molecule from x.

F 3 = | { y | d i f 1 ( x , y ) ≈ M w a t e r  or  M a m m o n i a  or d i f 1 ( x , y ) ≈ M w a t e r /2 or  M a m m o n i a /2 or d i f 2 ( x , y ) ≈ M w a t e r /2 or  M a m m o n i a /2 or − d i f 2 ( y , x ) ≈ M w a t e r /2 or  M a m m o n i a /2}| MathType@MTEF@1@1@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabqqaaaaabaGaemOray0aaSbaaSqaaiabiodaZaqabaGccqGH9aqpcqGG8baFcqGG7bWEcqWG5bqEcqGG8baFcqWGKbazcqWGPbqAcqWGMbGzcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaem4DaCNaemyyaeMaemiDaqNaemyzauMaemOCaihabeaakiabbccaGiabb+gaVjabbkhaYjabbccaGiabd2eannaaBaaaleaacqWGHbqycqWGTbqBcqWGTbqBcqWGVbWBcqWGUbGBcqWGPbqAcqWGHbqyaeqaaOGaeeiiaaIaee4Ba8MaeeOCaihabaGaaCzcaiabdsgaKjabdMgaPjabdAgaMjabigdaXiabcIcaOiabdIha4jabcYcaSiabdMha5jabcMcaPiabgIKi7kabd2eannaaBaaaleaacqWG3bWDcqWGHbqycqWG0baDcqWGLbqzcqWGYbGCaeqaaOGaee4la8IaeeOmaiJaeeiiaaIaee4Ba8MaeeOCaiNaeeiiaaIaemyta00aaSbaaSqaaiabdggaHjabd2gaTjabd2gaTjabd+gaVjabd6gaUjabdMgaPjabdggaHbqabaGccqqGVaWlcqqGYaGmcqqGGaaicqqGVbWBcqqGYbGCaeaacaWLjaGaemizaqMaemyAaKMaemOzayMaeGOmaiJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyisISRaemyta00aaSbaaSqaaiabdEha3jabdggaHjabdsha0jabdwgaLjabdkhaYbqabaGccqqGVaWlcqqGYaGmcqqGGaaicqqGVbWBcqqGYbGCcqqGGaaicqWGnbqtdaWgaaWcbaGaemyyaeMaemyBa0MaemyBa0Maem4Ba8MaemOBa4MaemyAaKMaemyyaegabeaakiabb+caViabbkdaYiabbccaGiabb+gaVjabbkhaYbqaceaaKpGaaCzcaiabgkHiTiabdsgaKjabdMgaPjabdAgaMjabikdaYiabcIcaOiabdMha5jabcYcaSiabdIha4jabcMcaPiabgIKi7kabd2eannaaBaaaleaacqWG3bWDcqWGHbqycqWG0baDcqWGLbqzcqWGYbGCaeqaaOGaee4la8IaeeOmaiJaeeiiaaIaee4Ba8MaeeOCaiNaeeiiaaIaemyta00aaSbaaSqaaiabdggaHjabd2gaTjabd2gaTjabd+gaVjabd6gaUjabdMgaPjabdggaHbqabaGccqqGVaWlcqqGYaGmcqqG9bqFcqqG8baFaaaaaa@E08F@

where M water is the mass of a water molecule and M ammonia is the mass of an ammonia molecule. Because x loses a molecule to form y, x should be larger than y if they have the same charge state. Therefore, different from F 1, the abs function should not be used here. If both peaks x and y are singly charged, dif 1(x, y) ≈ M water or M ammonia ; if both x and y are doubly charged, dif 1(x, y) ≈ M water /2 or M ammonia /2; if x is singly charged while y is doubly charged, dif 2(x, y) ≈ M water /2 or M ammonia /2; and if x is doubly charged while y is singly charged, a minus sign should be added to dif 2(y, x) and -dif 2(y, x) ≈ M water /2 or M ammonia /2.

The fourth feature collects the number of peaks which are produced by losing a CO group or an NH group from x.

F 4 = | { y | d i f 1 ( x , y ) ≈ M C O  or  M N H  or d i f 1 ( x , y ) ≈ M C O /2 or  M N H /2 or d i f 2 ( x , y ) ≈ M C O /2 or  M N H /2 or − d i f 2 ( y , x ) ≈ M C O /2 or  M N H /2}| MathType@MTEF@1@1@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeaabqqaaaaabaGaemOray0aaSbaaSqaaiabisda0aqabaGccqGH9aqpcqGG8baFcqGG7bWEcqWG5bqEcqGG8baFcqWGKbazcqWGPbqAcqWGMbGzcqaIXaqmcqGGOaakcqWG4baEcqGGSaalcqWG5bqEcqGGPaqkcqGHijYUcqWGnbqtdaWgaaWcbaGaem4qamKaem4ta8eabeaakiabbccaGiabb+gaVjabbkhaYjabbccaGiabd2eannaaBaaaleaacqWGobGtcqWGibasaeqaaOGaeeiiaaIaee4Ba8MaeeOCaihabaGaaCzcaiabdsgaKjabdMgaPjabdAgaMjabigdaXiabcIcaOiabdIha4jabcYcaSiabdMha5jabcMcaPiabgIKi7kabd2eannaaBaaaleaacqWGdbWqcqWGpbWtaeqaaOGaee4la8IaeeOmaiJaeeiiaaIaee4Ba8MaeeOCaiNaeeiiaaIaemyta00aaSbaaSqaaiabd6eaojabdIeaibqabaGccqqGVaWlcqqGYaGmcqqGGaaicqqGVbWBcqqGYbGCaeaacaWLjaGaemizaqMaemyAaKMaemOzayMaeGOmaiJaeiikaGIaemiEaGNaeiilaWIaemyEaKNaeiykaKIaeyisISRaemyta00aaSbaaSqaaiabdoeadjabd+eapbqabaGccqqGVaWlcqqGYaGmcqqGGaaicqqGVbWBcqqGYbGCcqqGGaaicqWGnbqtdaWgaaWcbaGaemOta4KaemisaGeabeaakiabb+caViabbkdaYiabbccaGiabb+gaVjabbkhaYbqaceaaKpGaaCzcaiabgkHiTiabdsgaKjabdMgaPjabdAgaMjabikdaYiabcIcaOiabdMha5jabcYcaSiabdIha4jabcMcaPiabgIKi7kabd2eannaaBaaaleaacqWGdbWqcqWGpbWtaeqaaOGaee4la8IaeeOmaiJaeeiiaaIaee4Ba8MaeeOCaiNaeeiiaaIaemyta00aaSbaaSqaaiabd6eaojabdIeaibqabaGccqqGVaWlcqqGYaGmcqqG9bqFcqqG8baFaaaaaa@B089@

where M CO and M NH are the mass of a CO group and an NH group, respectively. For the same reason as for F 3, x should be larger than y if they have the same charge state. Therefore, if both peaks x and y are singly charged, dif 1(x, y) ≈ M CO or M NH ; if both x and y are doubly charged, dif 1(x, y) ≈ M CO /2 or M NH /2; if x is singly charged while y is doubly charged, dif 2(x, y) ≈ M CO /2 or M NH /2; and if x is doubly charged while y is singly charged, the two peaks should satisfy -dif 2(y, x) ≈ M CO /2 or M NH /2. The fifth feature is used to collect the number of isotope peaks associated with x F 5 = |{y|M(x) ≈ M(y) - 1 or M(x) ≈ M(y) - 0.5)}|

The adjusted intensity of each peak is the original intensity of the peak multiplied by the score computed on basis of the five features. The final score of each peak is calculated as: Score = ω 0 + ω 1 * f 1 + ω 2 * f 2 + ω 3 * f 3 + ω 4 * f 4 + ω 5 * f 5

where f i (i = 1,..., 5) is the normalized value of each feature (Normalized to have the mean of zero and the variance of one), and ω i (i = 0,..., 5) are the coefficients. This study sets the bias ω 0 = 5 to ensure only few peaks have negative score; ω 1 and ω 2 are set to 1.0; both ω 3 and ω 4 are set to 0.2; and ω 5 is set to 0.5.

These values are selected according to the normalization method of Sequest algorithm. In Sequest algorithm, a magnitude of 50 is assigned to the b- and y- ions in a theoretical spectrum. The neutral loss of water ions, the neutral loss of ammonia ions, and a- ions are assigned a value of 10. The ions which have mass difference of ± 1 with b- and y- ions are assigned a value of 25. In this study the values are slightly different from those of the Sequest algorithm to avoid numerical problems incurred by multiplying large numbers, but the relative importance of the value of each parameter is the same as the value of the corresponding parameter of Sequest search engine. Note that the Sequest algorithm does not consider complementary ions. However, from the study of other peptide identification algorithms such as Mascot and our own study, the complement ions are very likely to be signal peaks, e.g., the presence of complementary ions is a very important feature to predict whether a spectrum is of high or poor quality [22, 37]. Therefore, the weight value for feature F 2 is assigned the same as that for feature F 1. The score function is similar to linear discriminative analysis (LDA) which combines a finite number of features into a score.

This study does not use these features to train a classifier to classify a peak as a signal peak or a noisy peak because of the peak distribution properties of tandem mass spectra. For example, the number of peaks in the middle of m/z value range of a spectrum is larger than the number of peaks in the two ends of the spectrum, and most noisy peaks are in the middle of m/z value range. Thus the features we constructed are m/z dependent. In addition, the masses of peptides are widely scattered, and the number of peaks of spectra are quite different. These are all challenges for machine learning algorithms. Elaborated normalization methods are necessary before using these algorithms.

The intensities of signal peaks are increased while the intensities of noisy peaks are decreased after peak intensity adjustment. However, simple threshold is still not effective to differentiate signal peaks from noisy ones because the scores of peaks in a spectrum tend to be larger in the middle of m/z range than the scores of the two ends peaks because most noisy peaks are in the middle of m/z range of a spectrum. It is more reasonable to assume that the noisy peaks in a narrow m/z range are equally distributed, and that the signal peaks are mostly the local maxima of a spectrum after peak intensity adjustment. Therefore, noisy peaks can be removed by keeping only these local maxima.

Peak local maximum extraction

This study employs an algorithm called morphological reconstruction filter [31] to select the local maxima of a spectrum. The inputs of a morphological reconstruction filter are a "mask" signal which is the original signal, and a "marker" signal which specifies the preserved parts in the reconstructed signal. In this study, a mask signal is a tandem mass spectrum while its marker signal is the mask signal subtracted by a very small positive number of 0.0001. Morphological reconstruction filter can be considered as repeated dilations of the marker signal until the contour of the dilated marker signal fits under the mask signal [31, 40]. In each dilation the value of the marker signal at every point will take the maximum value over its neighborhood. As a result, the values of the dilated marker signal are increased except the local maxima of the marker signal which will stay the same as before. The dilation operation is constrained to lie underneath the mask signal. When further dilations do not change the marker signal any more, the process stops. At this point, the dilated marker signal is exactly the same as the mask signal except the local maxima. By comparing the mask signal and the dilated marker signal, the local maxima of the mask signal can be extracted. Figure 3 shows an example of morphological reconstruction filter to extract the local maxima.

Figure 3
figure 3

An example of morphological reconstruction filter. The "marker" is obtained by subtracting a small value of 0.2 from the original signal (a), and the difference between the original signal and the reconstructed signal corresponds to the local maxima of the original signal (b).

References

  1. Jones N, Pevzner P: An introduction to bioinformatics algorithms. MIT Press Cambridge; 2004.

    Google Scholar 

  2. Kinter M, Sherman N: Protein sequencing and identification using tandem mass spectrometry. Wiley. 2000.

    Book  Google Scholar 

  3. Eng J, McCormack A, Yates J: An approach to correlate tandem mass spectral data of peptides with amino acid sequences in a protein database. J Am Soc Mass Spectrom 1994,5(11):976–989.

    Article  CAS  PubMed  Google Scholar 

  4. Perkins D, Pappin D, DM C, Cottrell J: Probability-based protein identification by searching sequence databases using mass spectrometry data. Electrophoresis 1999,20(18):3551–3567.

    Article  CAS  PubMed  Google Scholar 

  5. Elias J, Haas W, Faherty B, Gygi S: Comparative evaluation of mass spectrometry platforms used in large-scale proteomics investigations. Nat Methods 2005,2(9):667–675.

    Article  CAS  PubMed  Google Scholar 

  6. Craig R, Beavis R: TANDEM: matching proteins with tandem mass spectra. Bioinformatics 2004,20(9):921–922.

    Article  Google Scholar 

  7. Colinge J, Masselot A, Giron M, Dessingy T, Magnin J: OLAV: Towards high-throughput tandem mass spectrometry data identification. Proteomics 2003,3(8):1454–1463.

    Article  CAS  PubMed  Google Scholar 

  8. Geer L, Markey S, Kowalak J, Wagner L, Xu M, Maynard D, Yang X, Shi W, Bryant S: Open mass spectrometry search algorithm. Journal of Proteome Research 2004,3(5):958–964.

    Article  CAS  PubMed  Google Scholar 

  9. Gentzel M, Kocher T, Ponnusamy S, Wilm M: Preprocessing of tandem mass spectrometric data to support automatic protein identification. Proteomics 2003,3(8):1597–1610.

    Article  CAS  PubMed  Google Scholar 

  10. Na S, Paek E: Quality assessment of tandem mass spectra based on cumulative intensity normalization. J Proteome Res 2006,5(12):3241–3248.

    Article  CAS  PubMed  Google Scholar 

  11. Frank A, Bandeira N, Shen Z, Tanner S, Briggs S, Smith R, Pevzner P: Clustering millions of tandem mass spectra. J Proteome Res 2008,7(01):113–122.

    Article  CAS  PubMed Central  PubMed  Google Scholar 

  12. Tabb D, MacCoss M, Wu C, Anderson S, Yates J: Similarity among tandem mass spectra from proteomic experiments: detection, significance, and utility. Anal Chem 2003,75(10):2470–2477.

    Article  CAS  PubMed  Google Scholar 

  13. Klammer A, Wu C, MacCoss M, Noble W: Peptide charge state determination for low-resolution tandem mass spectra. Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference 2005, 175–185.

    Chapter  Google Scholar 

  14. Na S, Paek E, Lee C: CIFTER: automated charge-state determination for peptide tandem mass spectra. Anal Chem 2008,80(5):1520–1528.

    Article  CAS  PubMed  Google Scholar 

  15. Tabb D, Shah M, Strader M, Connelly H, Hettich R, Hurst G: Determination of peptide and protein ion charge states by Fourier transformation of isotope-resolved mass spectra. Journal of the American Society for Mass Spectrometry 2006,17(7):903–915.

    Article  CAS  PubMed  Google Scholar 

  16. Mujezinovic N, Raidl G, Hutchins J, Peters J, Mechtler K, Eisenhaber F: Cleaning of raw peptide MS/MS spectra: improved protein identification following deconvolution of multiply charged peaks, isotope clusters, and removal of background noise. Proteomics 2006,6(19):5117–5131.

    Article  CAS  PubMed  Google Scholar 

  17. Purvine S, Kolker N, Kolker E: Spectral quality assessment for high-throughput tandem mass spectrometry proteomics. Omics A Journal of Integrative Biology 2004,8(3):255–265.

    Article  CAS  PubMed  Google Scholar 

  18. Bern M, Goldberg D, McDonald W, Yates J: Automatic quality assessment of peptide tandem mass spectra. Bioinformatics 2004,20(s1):i49-i54.

    Article  CAS  PubMed  Google Scholar 

  19. Nesvizhskii A, Roos F, Grossmann J, Vogelzang M, Eddes J, Gruissem W, Baginsky S, Aebersold R: Dynamic spectrum quality assessment and iterative computational analysis of shotgun proteomic data. Molecular & Cellular Proteomics 2006,5(4):652–670.

    Article  CAS  Google Scholar 

  20. Flikka K, Martens L, Vandekerckhove J, Gevaert K, Eidhammer I: Improving the reliability and throughput of mass spectrometry-based proteomics by spectrum quality filtering. Proteomics 2006,6(7):2086–2094.

    Article  CAS  PubMed  Google Scholar 

  21. Salmi J, Moulder R, Filen J, Nevalainen O, Nyman T, Lahesmaa R, Aittokallio T: Quality classification of tandem mass spectrometry data. Bioinformatics 2006,22(4):400–406.

    Article  CAS  PubMed  Google Scholar 

  22. Wu FX, Gagne P, Droit A, Poirier GG: Quality assessment of peptide tandem mass spectra. BMC Bioinformatics 2008,9(suppl 6):S13.

    Article  PubMed Central  PubMed  Google Scholar 

  23. Wu FX, Ding J, Poirier GG: An approach to assess peptide mass spectral quality without prior information. International Journal of Functional Informatics and Personalised Medicine 2008,1(2):140–155.

    Article  CAS  Google Scholar 

  24. Kang N, Leong H: Algorithm for peptide sequencing by tandem mass spectrometry based on better preprocess and anti-symmetric computational model. Proceedings of the 2007 IEEE Computational Systems Bioinformatics Conference (CSB'07) 2007, 19–30.

    Google Scholar 

  25. Ma B, Zhang K, Liang C: An effective algorithm for peptide de novo sequencing from MS/MS spectra. Journal of Computer and System Sciences 2005,70(3):418–430.

    Article  Google Scholar 

  26. Frank A, Pevzner P: PepNovo: de novo peptide sequencing via probabilistic network modeling. Anal Chem 2005,77(4):964–973.

    Article  CAS  PubMed  Google Scholar 

  27. Grossmann J, Roos F, Cieliebak M, Liptak Z, Mathis L, Muller M, Gruissem W, Baginsky S: AUDENS: a tool for automated peptide de novo sequencing. J Proteome Res 2005,4(5):1768–1774.

    Article  CAS  PubMed  Google Scholar 

  28. Rejtar T, Chen H, Andreev V, Moskovets E, Karger B: Increased identification of peptides by enhanced data processing of high-resolution MALDI TOF/TOF mass spectra prior to database searching. Anal Chem 2004,76(20):6017–6028.

    Article  CAS  PubMed  Google Scholar 

  29. Baginsky S, Cieliebak M, Gruissem W, Kleffmann T, Liptak Z, Muller M, Penna P: AuDeNS: a tool for automatic de novo peptide sequencing. Tecnical Report no 383, ETH Zurich, Dept. of Computer Science 2002.

    Google Scholar 

  30. Zhang J, He S, Ling C, Cao X, Zeng R, Gao W: PeakSelect: preprocessing tandem mass spectra for better peptide identification. Rapid communications in mass spectrometry 2008,22(8):1203–1212.

    Article  CAS  PubMed  Google Scholar 

  31. Vincent L: Morphological grayscale reconstruction in image analysis: applications and efficient algorithms. IEEE Transactions on Image Processing 1993,2(2):176–201.

    Article  CAS  PubMed  Google Scholar 

  32. Balgley B, Laudeman T, Yang L, Song T, Lee C: Comparative Evaluation of Tandem MS Search Algorithms Using a Target-Decoy Search Strategy. Molecular & Cellular Proteomics 2007,6(9):1599–1608.

    Article  CAS  Google Scholar 

  33. Liu J, Bell A, Bergeron J, Yanofsky C, Carrillo B, Beaudrie C, Kearney R: Methods for peptide identification by spectral comparison. Proteome Science 2007.,5(3):

    Google Scholar 

  34. Feng J, Naiman D, Cooper B: Probability model for assessing proteins assembled from peptide sequences inferred from tandem mass spectrometry data. Anal Chem 2007,79(10):3901–3911.

    Article  CAS  PubMed  Google Scholar 

  35. Keller A, Purvine S, Nesvizhskii A, Stolyar S, Goodlett D, Kolker E: Experimental protein mixture for validating tandem mass spectral analysis. OMICS 2002,6(2):207–212.

    Article  CAS  PubMed  Google Scholar 

  36. Tanner S, Shu H, Frank A, Wang L, Zandi E, Mumby M, Pevzner P, Bafna V: Inspect: fast and accurate identification of post-translationally modified peptides from tandem mass spectra. Anal Chem 2005,77(14):4626–4639.

    Article  CAS  PubMed  Google Scholar 

  37. Ding J, Shi J, Zou A, Wu FX: Feature selection for tandem mass spectrum quality assessment. Proceedings of IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM 2008) 2008, 310–313.

    Chapter  Google Scholar 

  38. Wu FX, Gagne P, Droit A, Poirier GG: RT-PSM, a real-time program for peptide-spectrum matching with statistical significance. Rapid communications in mass spectrometry 2006,20(8):1199–1208.

    Article  CAS  PubMed  Google Scholar 

  39. Wong J, Sullivan M, Cartwright H, Cagney G: msmsEval: tandem mass spectral quality assignment for high-throughput proteomics. BMC Bioinformatic 2007.,8(51):

  40. Gonzalez R, Woods R: Digital image processing. Prentice Hall; 2007.

    Google Scholar 

Download references

Acknowledgements

This study is supported by Natural Sciences and Engineering Research Council of Canada (NSERC). We would like to thank Dr Andrew Keller from Institute for Systems Biology for generously providing the ISB dataset as well as Mr. Ken Sin Lo from the Proteomics Platform of the Quebec Genomics Center for discussing. JD thanks the University of Saskatchewan for funding him through a graduate scholarship award.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fang-Xiang Wu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

JD developed the algorithm, designed and executed all experimental work, and wrote the first draft. JHS participated in the discussion and the modification of the manuscript. FXW supervised and initiated project, and intensively revised the manuscript. GGP carried out the collection of TOV data, participated in interpretation of data analysis and modification of the manuscript. All authors read and approved the manuscript.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Ding, J., Shi, J., Poirier, G.G. et al. A novel approach to denoising ion trap tandem mass spectra. Proteome Sci 7, 9 (2009). https://doi.org/10.1186/1477-5956-7-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1477-5956-7-9

Keywords