Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

Open Access Highly Accessed Research article

Comparison of public peak detection algorithms for MALDI mass spectrometry data analysis

Chao Yang*, Zengyou He and Weichuan Yu

Author Affiliations

Laboratory for Bioinformatics and Computational Biology, Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, PR China

For all author emails, please log on.

BMC Bioinformatics 2009, 10:4  doi:10.1186/1471-2105-10-4


The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1471-2105/10/4


Received:19 July 2008
Accepted:6 January 2009
Published:6 January 2009

© 2009 Yang et al; licensee BioMed Central Ltd.

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

Abstract

Background

In mass spectrometry (MS) based proteomic data analysis, peak detection is an essential step for subsequent analysis. Recently, there has been significant progress in the development of various peak detection algorithms. However, neither a comprehensive survey nor an experimental comparison of these algorithms is yet available. The main objective of this paper is to provide such a survey and to compare the performance of single spectrum based peak detection methods.

Results

In general, we can decompose a peak detection procedure into three consequent parts: smoothing, baseline correction and peak finding. We first categorize existing peak detection algorithms according to the techniques used in different phases. Such a categorization reveals the differences and similarities among existing peak detection algorithms. Then, we choose five typical peak detection algorithms to conduct a comprehensive experimental study using both simulation data and real MALDI MS data.

Conclusion

The results of comparison show that the continuous wavelet-based algorithm provides the best average performance.

Background

Proteome research requires the analysis of large-volume protein data in a high-throughput manner. Mass Spectrometry (MS) is a common analytical tool in proteome research. It can be used as a technique to measure masses of proteins/peptides in complex mixtures obtained from biological samples. This provides tremendous potential to study disease proteome and to identify drug targets directly at the protein/peptide level [1].

In a typical proteomic experiment, a huge volume (e.g. 1 GB) of MS data is often generated. Each of MS spectra consists of two large vectors corresponding to mass to charge ratio (m/z) and intensity value, respectively. The first step in proteomic data analysis is to extract peptide induced signals (i.e., peaks) from raw MS spectra. Peak detection is not only a feature extraction step, but also an indispensable step for subsequent protein identification, quantification and discovery of disease-related biomarkers [2,3]. However, peak detection is a challenging task since mass spectra are often corrupted by noise. As a result, various algorithms have been proposed to facilitate the identification of informative peaks that correspond to true peptide signals. These algorithms differ from each other in their principles, implementations and performance. In order to provide a comprehensive comparison of existing peak detection algorithms and extract reasonable criteria for developing new peak detection methods, we need to answer the following questions:

1. What's the working mechanism of an algorithm?

2. What are the differences and common points among different algorithms?

3. What is their performance in MS data analysis?

To address the above questions, we study the peak detection process using a common framework: smoothing, baseline correction and peak finding. Such a decomposition enables us to better elucidate the fundamental principles underlying different peak detection algorithms. More importantly, it helps us to clearly identify the differences and similarities among existing peak detection algorithms.

We describe each part in the peak detection process with particular emphasis on their technical details, hoping that this can help readers implement their own peak detection algorithms.

During evaluation, we choose five typical peak detection algorithms to conduct a comparative experimental study. In the experiments, we use both simulation data and real MALDI MS data for performance comparison. The results show that the continuous wavelet-based algorithm provides the best average performance.

The remainder of this paper is organized as follows: section 2 provides details on existing peak detection algorithms and highlights their differences and similarities; section 3 conducts a performance comparison on some typical peak detection algorithms using simulation data and real MALDI MS data; section 4 concludes the paper.

Methods

Peak Detection Process

Usually, peptide signals appear as local maxima (i.e., peaks) in MS spectra. However, detecting these signals still remains challenging due to the following reasons:

(1) Some peptides with low abundance may be buried by noise, causing high false positive rate of peak detection.

(2) The chemical, ionization, and electronic noise often result in a decreasing curve in the background of MALDI/SELDI MS data, which is referred to as baseline [4]. The existence of baseline produces strong bias in peak detection. It is desirable to remove baseline before peak detection.

To facilitate peak detection, we often use the framework shown in Figure 1. It should be noted that smoothing and baseline correction may switch their locations in the pipeline. Figure 2 gives a concrete example of peak detection by showing the result after each step of the pipeline.

thumbnailFigure 1. Peak detection framework. The input mass spectrum is transformed into a list of peaks.

thumbnailFigure 2. An example of the peak detection process. (a) A raw spectrum, (b) the spectrum after smoothing, (c) the spectrum after smoothing and baseline correction and (d) final peak detection results with peaks marked as circles.

Categorization

Existing peak detection algorithms can be categorized according to the methods used in each step of peak detection process. Table 1 lists some popular MS data analysis methods and their peak detection functions. In this paper, we use CWT to denote MassSpecWavelet and LMS to denote Local Maximum Search. Similarities and differences among these methods can be addressed from the table. Here we would like to highlight the following:

Table 1. Open source software packages for MS data analysis

(1) The algorithms in Table 1 are chosen according to three criteria:

• The software is mainly designed for MS data pre-processing.

• The software is open source.

• The software is described in a publication.

(2) In Table 1, S1-S7, B1-B5 and P1-P8 denote different smoothing methods, baseline correction methods and peak finding criteria, respectively. We shall provide their details in subsequent sub-sections.

• Smoothing

S1: Moving average filter

S2: Savitzky-Golay filter

S3: Gaussian filter

S4: Kaiser window

S5: Continuous Wavelet Transform

S6: Discrete Wavelet Transform

S7: Undecimated Discrete Wavelet Transform

• Baseline Correction

B1: Monotone minimum

B2: Linear interpolation

B3: Loess

B4: Continuous Wavelet Transform

B5: Moving average of minima

• Peak Finding Criterion

P1: SNR

P2: Detection/Intensity threshold

P3: Slopes of peaks

P4: Local maximum

P5: Shape ratio

P6: Ridge lines

P7: Model-based criterion

P8: Peak width

Smoothing Filters

These methods usually apply traditional signal processing techniques such as moving average filter, Savitzky-Golay filter and Gaussian filter. For an input spectrum, we represent it as [m/z, x] with the first element as m/z vector and the second element as intensity vector (with equal length). To facilitate descriptions in signal processing, we further use x(t) to denote the continuous form of intensity vector and use x[n] to denote the discrete form of intensity vector. Here t and n serve as indexing variables. The input spectrum is always discrete. We use the continuous form to be consistent with the original description. In real applications, we usually sample the continuous filter to obtain its discrete form. We can obtain m/z values from m/z vector easily by using the corresponding indexing variable as well. A spectrum after smoothing can be expressed as y[n] = x[n] * w[n] for discrete case and y(t) = x(t) * w(t) for continuous case, where * denotes convolution operation. In above equations, w[n] and w(t) are a weight vector and a weight function, respectively. The use of different w[n] and w(t) will lead to different filters.

S1: Moving average filter [5]:

The output of the moving average filter y[n] reads:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M1','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M1">View MathML</a>

(1)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M2','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M2">View MathML</a>, -k n k. The odd number 2k + 1 denotes filter width. The greater the filter width, the more intense the smoothing effect.

S2: Savitzky-Golay filter:

The Saviztky-Golay filtering can be considered as a generalized moving average filter. It performs a least squares fit of a small set of consecutive data points to a polynomial and takes the central point of the fitted polynomial curve as output.

The smoothed data point y[n] after Savitzky-Golay filtering is given by the following equation:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M3','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M3">View MathML</a>

(2)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M4','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M4">View MathML</a>, -k n k. Here, Ai controls the polynomial order. Figure 3(a) shows Savitzky-Golay filters with different polynomial orders. For more information about Ai, please refer to [6].

thumbnailFigure 3. Smoothing filters. In (a), "PO" stands for polynomial order of polynomial fitting in Savitzky-Golay filter. In (b), σ is the standard deviation. In (c), α determines the shape of Kaiser window. In (d), a is the scale of the wavelet.

S3: Gaussian filter

After a signal x(t) passing Gaussian filter, the output reads:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M5','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M5">View MathML</a>

(3)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M6','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M6">View MathML</a>. The degree of smoothing is determined by the standard deviation σ. In fact, we can view Gaussian filter as a weighted moving average filter. This filter sets larger weight factors for points in the center and smaller weight factors for points away from the center. Figure 3(b) shows Gaussian filters with different σ.

Some researchers use the second-derivative of Gaussian to perform smoothing. Their argument is that the second-derivative of Gaussian can implicitly remove background when smoothing signals [7,8].

S4: Kaiser window

After a signal passing a Kaiser window:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M7','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M7">View MathML</a>

(4)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M8','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M8">View MathML</a>, 0 ≤ n N. α determines the shape of the Kaiser window. A large α indicates a sharp Kaiser window. N denotes the width of window. I0 is zeroth-order modified Bessel function of the first kind [9]. Figure 3(c) shows two Kaiser windows with different α values.

S5, S6, S7: Wavelet based filters

Wavelet can be grouped as continuous wavelet transform and discrete wavelet transform. The continuous wavelet transform can be written as

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M9','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M9">View MathML</a>

(5)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M10','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M10">View MathML</a>. a denotes scale and ψ denotes mother wavelet function. In continuous wavelet analysis, Du et al [10]choose Mexican Hat wavelet. Mexican Hat wavelet reads as:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M11','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M11">View MathML</a>

(6)

Then w(t) forms a scaled Mexican Hat wavelet. Figure 3(d) shows w(t) with different a. Here, a determines the width of the wavelet. With different a, we can use w(t) to model peaks with different width. This is especially important for low-resolution data in which peak width varies a lot. Peaks with higher m/z values tend to have larger width. Using fixed-window filters will not perform well in this case. Discrete wavelet transform computes on scales and translations based on the power of two. Figure 4 shows a typical method for computing discrete wavelet transform, where h[n] is a high-pass filter and g[n] is a low-pass filter. The procedure to compute discrete wavelet transform is as follows:

thumbnailFigure 4. The process of computing DWT. Here "↓ 2" means down sampling by 2, h[n] is a high-pass filter and g[n] is a low-pass filter.

(1) Signal is decomposed simultaneously by a low-pass filter g[n] and a high-pass filter h[n].

(2) The output of h[n] is then down sampled by two to generate detail coefficients and the output of g[n] is down sampled by two to generate approximation coefficients. The coefficients obtained from the output of h[n] are named level one coefficients.

(3) The output of g[n] goes through another group of high-pass filter and low-pass filter. Steps (1) and (2) go on until we obtain the last level of coefficients.

The advantage of discrete wavelet transform over continuous wavelet transform is its efficiency because it only computes on the scales and positions based on the power of two, while the redundancy of continuous wavelet transform makes the interpretation of MS peak detection easier [10].

Discrete wavelet transform is shift-variant. To achieve shift invariance, undecimated discrete wavelet transform has been proposed [11,12].

Baseline Correction

Baseline correction is typically a two-step process: (1) estimating the baseline and (2) subtracting the baseline from the signal. In the following, we list details of some commonly used baseline correction methods. Since baseline substraction is straightforward, we mainly focus on the baseline estimation procedure in different methods.

B1: Monotone minimum

This method includes two steps to estimate baseline. The first step is to compute the difference, which can be used to determine the slope of each point. Then, this method starts from the leftmost point A in the spectrum and continues the following procedure until the rightmost point is reached:

• If the slope of a local point A is smaller than zero, a nearest point B to the right of A whose slope is larger than zero is located. All points between A and B serve as baseline between A and B.

• If the slope of a local point A is larger than zero, a nearest points B to the right of A whose intensity is smaller than A is located. The intensity of every point on the result baseline between A and B equals to the intensity of A.

• Let A = B.

B2: Linear interpolation

Linear interpolation takes two steps to estimate baseline:

• Divide the raw spectrum into small segments and use the mean, the minimum or the median of the points in each segment as the baseline point.

• Generate a baseline for the raw spectrum by linearly interpolating baseline points across all small segments.

B3: Loess

First, it divides the raw spectrum into small segments. Then, in each small segment, it computes the quantile. After that, it estimates a predictor in every small segment for baseline estimation. The predictor in each small segment is obtained using the following rules:

• If the intensity of a point A is smaller than the quantile in the segment, then the intensity of corresponding point on predictor equals the intensity of A.

• If the intensity of a point is larger than or equal to the quantile in the segment, then the intensity of corresponding point on predictor equals the quantile.

Baseline is obtained by applying local polynomial regression fitting to the predictor.

B4: Continuous Wavelet Transform

In local regions, baselines are monotonic. Baseline can be modeled as the following function:

Base = B(t) + C,(7)

where C is a constant and B(t) is an odd function [10]. The continuous wavelet transform of the equation reads:

Base(a, b) = ∫ B(t)ψa,b(t)dt + ∫ a,b(t)dt,(8)

where <a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M12','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M12">View MathML</a>. Because wavelet function has zero mean, the second term of equation (8) is

zero. If we use a symmetric wavelet function (like Mexican Hat wavelet), the first item in Equation (8) is also zero. Thus, continuous wavelet transform removes baseline automatically.

B5: Moving average of minima

This method uses two steps to estimate baseline:

• Estimate a rough baseline by finding local minimum within a two Da window for each point.

• Use a moving window to smooth the rough baseline obtained in the first step.

Peak Finding Criteria

There are many peak detection methods. Most methods detect peaks after smoothing and baseline correction. However, it should be noted that there is a special case, CWT does not have explicit smoothing and baseline correction steps. Du et al. [10] claim that baseline can be removed if continuous wavelet transform is carried out on a raw spectrum. We have shown this fact in Section Baseline Correction. In the following, we illustrate the criteria used by different algorithms to find similarities among different algorithms.

P1: SNR

SNR stands for signal to noise ratio. Different methods define noise differently. Below are two examples:

• Noise is estimated as 95-percentage quantile of absolute continuous wavelet transform (CWT) coefficients of scale one within a local window [10].

• Noise is estimated as the median of the absolute deviation (MAD) of points within a window [13].

P2: Detection/Intensity threshold

This threshold is used to filter out small peaks in flat regions. In these regions, the median of the absolute deviation (MAD) is quite small, which may result in big SNR. Using SNR alone may identify many noisy points as peaks.

P3: Slopes of peaks

This criterion uses the shape of peaks to remove false peak candidates. In order to compute the left slope and the right slope of a peak, both the left end point and the right end point of the peak need to be identified. Peak candidate is discarded if both left slope and right slope are less than a threshold. The threshold is defined as half of the local noise level [14].

P4: Local maximum

A peak is a local maximum of N neighboring points.

P5: Shape ratio

Peak area is computed as the area under the curve within a small distance of a peak candidate. Shape ratio is computed as the peak area divided by the maximum of all peak areas. The shape ratio of a peak must be larger than a threshold.

P6: Ridge lines

Ridge lines are obtained in the following steps:

• Carry out continuous wavelet transform on raw spectrum. This step produces 2-D coefficient matrix with size of M × N, where M is the number of scales and N is the length of spectrum.

• Connect nearest local maximal coefficients of adjacent scales to obtain ridge lines. The distance between two adjacent points on a ridge line should be smaller than a window size.

• Use a variable gap to count how many successive times that a local maximal coefficient can not find its nearest counterpart in the next scale. If the gap is larger than a given threshold, the ridge line is dropped.

Ridge lines are used in the following ways:

• False peaks are removed if the length of their ridge lines are smaller than a given threshold supplied by users.

• The width of a peak is proportional to the scale corresponding to the maximum amplitude on the ridge line [10]. A peak candidate is dropped if its width is not in a given range.

P7: Model-based criterion

The application of this criterion consists of three steps:

• Locate the endpoints of both sides for each peak. The left endpoint and right endpoint of a peak define its peak area.

• Estimate the centroid for each peak. For m/z axis, the centroid of a peak is computed as intensity-weighted average of points within the peak area [15].

• Use a model function to fit peaks.

Different methods choose different model functions to fit peaks. OpenMS [15] chooses asymmetric Lorentzian or sech2 function while MapQuant [16] uses Gaussian function to fit peaks.

P8: Peak width

The two end points of a peak define its peak area. The intensities of all points within the peak area should be larger than a given noise level. A simple way to locate a peak area is to start from a point with intensity above a given noise level and move to the right until we run into a point with intensity below the noise level.

After peak end points have been identified, peak width is computed as the mass difference of right end point and left end point. The peak width should be within a given range.

Results and discussion

Data Description and Algorithm Selection

In comparison, we use one group of simulation data and one group of real MALDI MS data. The low resolution simulation data is downloaded from the website of M. D. Anderson Cancer Center [17,18]. The high resolution real data is obtained from Aurum Data Set [19], which contains known purified and tryptic-digested proteins. For simulation data, the number of true peaks in a spectrum is around 70 on average. The m/z range is between 400 Da and 64800 Da. The mass variation is: Δm ∈ [0.251 Da, 3.915 Da]. The median of SNR is around 0.675. For real data, the number of true peaks in a spectrum varies from 50 and 100. The m/z range is between 800 Da and 3500 Da. The mass variation is: Δm ∈ [0.016 Da, 0.034 Da]. The median of SNR is around 4.854. The reader is referred to additional file 1 for more details on the data.

Additional file 1. Data and results. This file lists the data used in this paper and the results for the experiments.

Format: DOC Size: 27KB Download file

This file can be viewed with: Microsoft Word ViewerOpen Data

Software programs for LC-MS data analysis consider additional information along the LC-axis during peak detection. In order to obtain a fair comparison, here we only focus on single spectrum based peak detection algorithms. According to this criterion, only five algorithms in Table 1 will remain: Cromwell, CWT, LMS, LIMPIC and PROcess. These algorithms are designed to analyze MALDI MS data. They can also be used to analyze MS/MS data in a spectrum by spectrum manner. It should be noted that these methods are very representative as LC-MS oriented programs also use similar ideas for peak detection along the m/z axis.

Evaluation Criteria

In simulation data, the list of ground-truth peaks is the input before data generation. In real data, the trypsin-digested theoretical peaks (without adding isotope masses) are used as the ground-truth peaks. In both cases, a detected peak is labeled as a false peak if its mass is not within the ± 1% error range of the expected m/z value. Multiple peaks within the error range will be considered as one peak. We use false discovery rate (FDR) and sensitivity to measure the performance of algorithms. False discovery rate is defined as the number of falsely identified peaks divided by the total number of peaks found by algorithms. Sensitivity is defined as the number of correctly identified peaks divided by the total number of true peaks. For two algorithms with the same false discovery rate, the larger the sensitivity, the better the algorithm performance.

It is difficult for two algorithms to produce the same false discovery rate. Here we divide false discovery rate into small segments. Such segments have clear interpretations. For example, the FDR [0,0.1] range reveals the algorithm's ability to recognize the most abundant (based on SNR) peaks in the spectrum. Every time when we obtain peak lists, both false discovery rates and sensitivity are computed. We group the sensitivity together if the corresponding false discovery rates fall into the same small segment. Then average values of sensitivity in the same group are computed. The average value of sensitivity is used to evaluate the performance of one algorithm in that area.

As ground truth is known for both simulation data and real data in this paper, the ROC curve is probably the most informative measure for evaluation of different peak detection methods. However, the false discovery rates of wavelet-based methods are limited to a relatively small range across all possible parameter settings. On one hand, this reflects the robustness of wavelet-based methods. On the other hand, the plot of ROC curve becomes difficult in wavelet-based methods. Here we use the following alternative method to conduct performance comparison: we select four regions of false discovery rate:[0, 0.1), [0.2, 0.3), [0.4, 0.5), [0.6, 0.7) and compare sensitivity of different algorithms in these regions using boxplot. Such strategy is capable of providing an overall performance evaluation since it is roughly a "discrete" ROC curve in four regions. Moreover, the boxplots illustrate the performance variances of different algorithms.

Different programs have different parameters to adjust when performing peak detection. Since it is very time consuming to optimize each algorithm using all potential combinations of different parameters, we mainly test combinations of parameters that are related to peak finding and use default values for other parameters. Please refer to additional file 2 for more details.

Comparison of Algorithms Using Simulation Data

The simulation data is generated using a model that incorporates some characteristics of real MALDI-TOF mass spectrometers: The simulation engine takes a peak list with both m/z values and intensity values as input and generates an artificial spectrum as output. The user-specified peaks are labeled as the ground-truth during data generation, while other peaks are labeled as false peaks in the simulation spectrum. In addition, the simulation engine assumes that the isotopic distribution follows the Bernoulli distribution. It also includes exponential baseline curve and Gaussian additive noise.

This data set has 25 groups of data and each group has 100 spectra. Each spectrum has a true peak list provided by data set. We directly use these peak lists as ground truth in our experiment. We use different parameter settings to perform peak detection repeatedly on 100 spectra in the same group, and then compute the average value of sensitivity with corresponding false discovery rates locating in the same small region. For each algorithm, we obtain 25 average values of sensitivity in each small region.

Figure 5 shows the performance of five algorithms. CWT provides the best performance among these algorithms. Our explanation is that the use of wavelets in baseline modeling/correction and the use of ridge lines enable CWT-based algorithm to achieve better performance.

thumbnailFigure 5. Performance of different algorithms at different false discovery rates using simulation data. In this figure, (a), (b), (c) and (d) show the average sensitivity when false discovery rate is around 0.05, 0.25, 0.45 and 0.65, respectively.

Comparison of Algorithms Using Aurum Data

Aurum Dataset is a high resolution data set, which contains spectra from 246 known, individually purified and trypsin-digested protein samples with an ABI 4700 MALDI TOF/TOF mass spectrometer. In the experiments, we do not use MS/MS data and limit our analysis only to MS spectra. For each MS spectrum, we generate the ground truth peaks in silico using the following parameters: trypsin digestion with a maximum of one missed cleavage, monoisotopic peaks and single charge state. We also consider some typical PTMs (Post-Translational Modifications): carboxyamidomethyl cysteine as the fixed modification and oxidation of methionine as the variable modification. Note that peptides having missed cleavages and PTMs are also used to generate ground-truth peaks. After obtaining the theoretic peak list, we merge identical peaks into one peak and delete peaks whose m/z values are not in the range between 800 Da and 3500 Da. We select 200 spectra, and divide the spectra into eight groups. We perform the same performance test as we did for the simulation data.

Figure 6 shows the performance of these five methods. The noisy nature of real data causes larger performance variations of most methods in this experiment. LIMPIC achieves comparable performance as CWT in Figure 6(b) and outperforms CWT in Figure 6(c). On average, CWT provides the best results.

thumbnailFigure 6. Performance of different algorithms at different false discovery rates using Aurum data. In this figure, (a), (b), (c) and (d) show the average sensitivity when false discovery rate is around 0.05, 0.25, 0.45 and 0.65, respectively.

Report of Running Time

For high-throughput data analysis, high efficiency is always desirable. In Table 2, we list the average running time of different algorithms on both simulation data and Aurum data, respectively. We obtain the running time of different algorithms using their original software packages on the same PC. It should be noted that these programs are implemented in different languages. Even without considering the implementation efficiency, complexity comparison is reasonable only for programs implemented in the same language. In this sense, Table 2 only serves as a reference for those readers who are interested in computational cost.

Table 2. Average processing time per spectrum using different programs

Parameter Tuning

When the false discovery rate is 5%, half of true peaks are not detected; when 90% of true peaks are detected, many other identified peaks are noise peaks. We use the F1 measure to measure the performance of an algorithm by compromising between false discovery rate and sensitivity. The F1 measure is defined as:

<a onClick="popup('http://www.biomedcentral.com/1471-2105/10/4/mathml/M13','MathML',630,470);return false;" target="_blank" href="http://www.biomedcentral.com/1471-2105/10/4/mathml/M13">View MathML</a>

(9)

The larger F1 is, the better a parameter combination will be. We exhaustively try combination of parameters and count the numbers that a parameter combination provides the maximal F1. The parameter combination that produces the largest number of maximal F1 is considered as the best combination. We also test the peak detection precision for each algorithm with its best parameter combination. For readers who are interested in parameter settings, please refer to the additional file 2 for more information.

Additional file 2. Parameter setting. This file gives parameters settings in experiments for each program compared in this work.

Format: DOC Size: 41KB Download file

This file can be viewed with: Microsoft Word ViewerOpen Data

Conclusion

In this paper, we provide a comprehensive survey of existing peak detection methods. In addition, we compare performance of five single spectrum based peak detection algorithms. Results show that CWT provides the best performance.

The reasons that CWT provides the best performance are two-fold:

(1) CWT optimally characterizes the shape of peaks in mass spectra. In a real spectrum, peak width varies a lot [10]. Hence smoothing the spectrum using fixed-window filters may fail. CWT avoids the problem by performing multi-scale smoothing.

(2) True peptide-related peaks are more consistent at multiple scales than false positive peaks that are mainly caused by high frequency noise. The concept of forming ridge lines in CWT effiectively removes false positive peaks.

Algorithms studied in this paper mainly focus on how to identify peak positions correctly. They ignore how to compute peak abundance, which is very important in some applications (e.g. protein quantification). In our future work, we plan to study the issue of peak detection in LC-MS data. It will be interesting to see if additional information along the LC-axis may help to improve peak detection results.

Authors' contributions

CY performed the implementations and drafted the manuscript. ZH participated in the categorization of related work. WY conceived the study and finalized the manuscript. All authors read and approved the final manuscript.

Acknowledgements

We are grateful to the anonymous reviewers for their valuable comments and suggestions, which greatly helped us improve the manuscript. This work was supported with the GRF Grant 621707 from the Hong Kong Research Grant Council, a research proposal competition award RPC07/08.EG25 and a postdoctoral fellowship award from the Hong Kong University of Science and Technology.

References

  1. Aebersold R, Mann M: Mass spectrometry-based proteomics.

    Nature 2003, 422:198-207. PubMed Abstract | Publisher Full Text OpenURL

  2. Gras R, Müller M, Gasteiger E, Gay S, Binz PA, Bienvenut W, Hoogland C, Sanchez JC, Bairoch A, Hochstrasser DF, Appel RD: Improving protein identification from peptide mass fingerprinting through a parameterized multi-level scoring algorithm and an optimized peak detection.

    Electrophoresis 1999, 20:3535-3550. PubMed Abstract | Publisher Full Text OpenURL

  3. Adam BL, Qu Y, Davis JW, Ward MD, Clements MA, Cazares LH, Semmes OJ, Schellhammer PF, Yasui Y, Feng Z, Wright GL: Serum protein fingerprinting coupled with a pattern-matching algorithm distinguishes prostate cancer from benign prostate hyperplasia and healthy men.

    Cancer Research 2002, 62:3609-3614. PubMed Abstract | Publisher Full Text OpenURL

  4. Malyarenko DI, Cooke WE, Adam BL, Malik G, Chen H, Tracy ER, Trosset MW, Sasinowski M, Semmes OJ, Manos DM: Enhancement of sensitivity and resolution of surface-enhanced laser desorption/ionization time-of-flight mass spectrometric records for serum peptides using time-series analysis techniques.

    Clinical Chemistry 2005, 51:65-74. PubMed Abstract | Publisher Full Text OpenURL

  5. Oppenheim AV, Schafer RW, Buck JR: Discrete-time signal processing. second edition. Prentice Hall; 1999. OpenURL

  6. Savitzky A, Golay MJE: Smoothing and differentiation of data by simplified least squares procedures.

    Analytical Chemistry 1964, 36:1627-1639. OpenURL

  7. Danielsson R, Bylund D, Markides KE: Matched filtering with background suppression for improved quality of base peak chromatograms and mass spectra in liquid chromatography-mass spectrometry.

    Analytica Chimica Acta 2002, 454:167-184. OpenURL

  8. Smith CA, Want EJ, Maille GO, Abagyan R, Siuzdak G: XCMS: processing mass spectrometry data for metabolite profiling using nonlinear peak alignment, matching, and identification.

    Analytical Chemistry 2006, 78:779-787. PubMed Abstract | Publisher Full Text OpenURL

  9. Kaiser JF, Schafer RW: On the use of the I0-Sinh window for spectrum analysis.

    IEEE Transactions on Acoustics, Speech, and Signal Processing 1980, 28:105-107. OpenURL

  10. Du P, Kibbe WA, Lin SM: Improved peak detection in mass spectrum by incorporating continuous wavelet transform-based pattern matching.

    Bioinformatics 2006, 22:2059-2065. PubMed Abstract | Publisher Full Text OpenURL

  11. Lang M, Guo H, Odegard JE, Burrus CS: Noise reduction using an undecimated discrete wavelet transform.

    IEEE Signal Processing Letters 1996, 3:10-12. OpenURL

  12. Coombes KR, Tsavachidis S, Morris JS, Baggerly KA, Hung MC, Kuerer HM: Improved peak detection and quantification of mass spectrometry data acquired from surface-enhanced laser desorption and ionization by denoising spectra with the undecimated discrete wavelet transform.

    Proteomics 2005, 5:4107-4117. PubMed Abstract | Publisher Full Text OpenURL

  13. Li X, Gentleman R, Lu X, Shi Q, Iglehart JD, Harris L, Miron A: SELDI-TOF mass spectrometry Protein Data. In Bioinformatics and Computational Biology Solutions Using R and Bioconductor. Springer; 2005:91-109. OpenURL

  14. Coombes KR, Fritsche HA, Clarke C, Chen J, Baggerly KA, Morris JS, Xiao L, Hung M, Kuerer HM: Quality control and peak finding for proteomics data collected from nipple aspirate fluid by surface-enhanced laser desorption and ionization.

    Clinical Chemistry 2003, 49:1615-1623. PubMed Abstract | Publisher Full Text OpenURL

  15. Lange E, Gropl C, Reinert K, Kohlbacher O, Hildebrandt A: High-accuracy peak picking of proteomics data using wavelet techniques. In Pac Symp Biocomput. Maui, Hawaii, USA; 2006:243-254. PubMed Abstract OpenURL

  16. Leptos KC, Sarracino DA, Jaffe JD, Krastins B, Church GM: MapQuant: Open-source software for large-scale protein quantification.

    Proteomics 2006, 6:1770-1782. PubMed Abstract | Publisher Full Text OpenURL

  17. Coombes KR, Koomen JM, Baggerly KA, Morris JS, Kobayashi R: Understanding the characteristics of mass spectrometry data through the use of simulation.

    Cancer Informatics 2005, 1:41-52. OpenURL

  18. Morris JS, Coombes KR, Koomen J, Baggerly KA, Kobayashi R: Feature extraction and quantification for mass spectrometry in biomedical applications using the mean spectrum.

    Bioinformatics 2005, 21:1764-1775. PubMed Abstract | Publisher Full Text OpenURL

  19. Falkner JA, Veine DM, Kachman M, Walker A, Strahler JR, Andrews PC: Validated MALDI-TOF/TOF mass spectra for protein standards.

    J Am Soc Mass Spectrom 2007, 18(5):850-855. PubMed Abstract | Publisher Full Text OpenURL

  20. Du P, Sudha R, Prystowsky MB, Angeletti RH: Data reduction of isotope-resolved LC-MS spectra.

    Bioinformatics 2007, 23:1394-1400. PubMed Abstract | Publisher Full Text OpenURL

  21. Mantini D, Petrucci F, Pieragostino D, DelBoccio P, Nicola MD, Ilio CD, Federici G, Sacchetta P, Comani S, Urbani A: LIMPIC: a computational method for the separation of protein MALDI-TOF-MS signals from noise.

    BMC Bioinformatics 2007, 8:101. PubMed Abstract | Publisher Full Text | PubMed Central Full Text OpenURL

  22. Yasui Y, Pepe M, Thompson ML, Adam BL, Wright GL, Qu Y, Potter JD, Winget M, Thornquist M, Feng Z: A data-analytic strategy for protein biomarker discovery:profiling of high-dimensional proteomic data for cancer detection.

    Biostatistics 2003, 4:449-463. PubMed Abstract | Publisher Full Text OpenURL

  23. Bellew M, Coram M, Fitzgibbon M, Igra M, Randolph T, Wang P, May D, Eng J, Fang R, Lin CW, Chen JZ, Goodlett D, Whiteaker J, Paulovich A, McIntosh M: A suite of algorithms for the comprehensive analysis of complex protein mixtures using high-resolution LC-MS.

    Bioinformatics 2006, 22:1902-1909. PubMed Abstract | Publisher Full Text OpenURL

  24. Katajamaa M, Miettinen J, Oresic M: MZmine: Toolbox for processing and visualization of mass spectrometry based molecular profile data.

    Bioinformatics 2006, 22:634-636. PubMed Abstract | Publisher Full Text OpenURL

  25. Karpievitch YV, Hill EG, Smolka AJ, Morris JS, Coombes KR, Baggerly KA, Almeida JS: PrepMS: TOF MS data graphical preprocessing tool.

    Bioinformatics 2007, 23:264-265. PubMed Abstract | Publisher Full Text OpenURL