BACKGROUND
the science of proteomics encapsulates the large-scale identification, characterization and quantitation of proteins from biological samples.
mass spectrometry  has been recognized as a powerful technique to study proteins.
high-performance liquid chromatography  coupled with tandem mass spectrometry  is most commonly used in shotgun proteomics to resolve and identify proteolytic peptides generated from complex protein mixtures  <cit> .
peptide and protein identifications are usually derived from information contained in the tandem ms data.
automated database searching and de novo sequencing algorithms are routinely used to convert the ms/ms data into peptide and protein identifications  <cit> .
database search algorithms are more commonly used at this time due to their relatively low computational expense and higher compatibility with low mass accuracy and low quality ms/ms data  <cit> .
it has also been recognized that the lc retention times of peptides are related to their sequences and can be used as complementary information for their identification and characterization  <cit> .
several methods have been developed to predict peptide retention times in reversed-phase liquid chromatography  based on amino acid compositions and/or sequences  <cit> .
high correlation between observed and predicted retention times for peptides in rplc under different conditions has been achieved by use of these methods.
furthermore, these approaches can be combined with mass spectrometry to achieve better confidence in peptide identification than ms alone.
for example, accurate mass tags combined with peptide retention time prediction has been effectively used by several groups to improve proteome characterization  <cit> .
peptide retention time prediction can also be used to refine and improve peptide identifications resulting from analysis of lc-ms/ms by database search software.
in this way, false peptide matches from database search results can be minimized and true peptide matches can be confirmed with higher confidence.
krokhin et al reported an algorithm to refine the results obtained from the global proteome machine <cit>  database searches  <cit> .
in their approach, either internal or external standard peptides were used to estimate the regression parameters for the linear retention time prediction model used to refine their results.
strittmatter et al reported a post-database search method that evaluated peptide matches from sequest <cit>  based upon their retention times.
they reported a peptide retention time prediction model based on artificial neutral networks  <cit> .
the prediction model was calibrated with highly reliable peptide matches from sequest for each lc-ms/ms analysis  <cit> .
an empirical discriminant score based on retention time and sequest scores was also developed for peptide matches.
it was shown that the number of reliable peptide matches was increased by use of peptide retention time information  <cit> .
klammer et al also developed an algorithm based on support vector regression to improve peptide identifications in tandem mass spectrometry by use of retention time prediction.
as much as 50% of false peptide identifications in database search results from sequest can be filtered and only 3% of true peptide matches were lost.
the algorithm also trains the linear regression model dynamically for each data set  <cit> .
we recently developed a robust linear regression based algorithm for automated evaluation of peptide identifications from database search programs based on retention time in rplc.
the algorithm extends the retention time prediction algorithm and its use for peptide identification in off-line lc-ms/ms by krokhin et al  <cit> .
the algorithm described here works for on-line lc-ms/ms experiments and eliminates the need of retention time prediction model calibration by use of internal or external standard peptides.
the algorithm is generic and can be used to evaluate peptide matches from any database search program.
it has been included in a database search program, massmatrix  <cit> , to perform automated data analysis.
a post-hoc retention time analysis program lr_rt was also developed to analyze search results from other publicly available programs, such as mascot and x!tandem.
furthermore, a score algorithm was developed to provide a statistical score for each peptide match based on its predicted and observed retention times.
methods
sample preparation and mass spectrometry
bovine histones were isolated from bovine thymus tissue as described by sures et al  <cit> .
the bovine histone mixture was digested by use of trypsin in  <dig> mm ammonium bicarbonate buffer .
enzymes were used in 25: <dig> ratio  and the mixture was incubated at 37°c for two hours.
the digested peptides were identified by use of data-dependent nano-lc-ms/ms on an lcq deca xp ion trap mass spectrometer  as reported previously by su et al  <cit> .
in brief,  <dig>  μl of bovine histone peptides at a total concentration of  <dig>  μg/μl was injected and eluted off the capillary hplc column  into the lcq mass spectrometer at a flow rate of ~ <dig> nl/min.
mobile phases a and b were water with  <dig> % acetic acid and acetonitrile with  <dig> % acetic acid respectively.
a linear gradient of 5–50% of mobile phase b over  <dig> minutes was used.
the total run time was  <dig> minutes.
database search and search parameters
the .raw data files obtained from the mass spectrometer were converted to mzxml files by use of readw .
tandem mass spectra that were not derived from singly charged precursor ions were considered as both doubly and triply charged precursors.
the mzxml file was searched by use of massmatrix  against a database that contained both the bovine histone database and a reversed ncbinr human protein database as a decoy database.
the search options were set as follows: i) no variable or fixed modifications; ii) enzyme: trypsin; iii) missed cleavages = 3; iv) peptide length =  <dig> to  <dig> amino acid residues; and v) mass tolerances of  <dig>  da and  <dig>  da for the precursor and product ions respectively.
the data set was also evaluated by mascot  <cit>  and x!tandem  <cit> .
the search parameters were identical to those in massmatrix.
the search results from mascot and x!tandem were then analyzed by the post-hoc retention time analysis program, lr_rt  to obtain retention time based scores for each peptide match from the two search programs.
RESULTS
algorithm development
overview
a key advantage of this algorithm is that the lr model can be trained independently for each search.
thus there is no need to train or calibrate the lr model with internal or external standards for a given batch of samples.
furthermore, the algorithm is generic and can be used to evaluate peptide matches from any database search program.
the algorithm can use different linear regression models for predicting peptide retention times under a variety of chromatographic conditions.
for analysis of shotgun proteomic data sets, the linear regression model for peptide retention time prediction developed by krokhin et al  <cit>  was used.
the model can be used to accurately predict retention times of tryptic peptides on reversed-phase  hplc columns of various sizes with linear water-acetonitrile gradients containing trifluoroacetic acid, acetic acid, or formic acid as the ion-pairing agent  <cit> .
the detailed implementation and performance of the algorithm are described in the next sections.
linear regression model for predicting peptide retention times in rplc
retention times for true peptide matches identified by database search programs were assumed to follow a linear regression  model:  <cit>
t = ah + b + ε;
where t is the retention time of the peptide match, h is the calculated hydrophobicity of the peptide match, a and b are parameters for the linear model that depend on the rplc column and elution gradient, and ε is the residual of the model.
the hydrophobicity for a peptide is calculated from the peptide sequence by use of the model developed by krokhin et al  <cit> .
their model was derived from the work of guo et al  <cit>  in which the hydrophobicity of a peptide is calculated by  <cit>
h={klif h< <dig> kl+ <dig> if h≥ <dig>
where kl is the length correction coefficient of the peptide, n is the length of the peptide in terms of the number of amino acid residues, ∑i=1nrci is the sum of rc values for all amino acid residues of the peptide, and r <dig> cnt, r <dig> cnt, and r <dig> cnt are the rcnt values for the first, second, and third amino acid residues from the n-terminus of the peptide respectively.
the length correction coefficient kl is calculated by eqn.
<dig>
kl={1− <dig> ×if n<101− <dig> ×if n>201otherwise
the rc and rcnt values for the  <dig> common amino acid residues were reported previously by krokhin et al  <cit> .
selection of training data
the retention time of the peptide match for each tandem mass spectrum was obtained from the mzxml or mzdata file.
we assume that retention times for true peptide matches will follow the lr model described in eqn.
<dig>  the parameters of the lr model for true peptide matches are estimated from a training data set, which are then used to evaluate all peptide matches in the search result.
in order to eliminate the need for lr model training by internal or external protein or peptide standards, the algorithm creates a training data set directly from the current database search results.
this training data contains a selected number of peptide matches from the database search program with scores above a specified threshold.
the accuracy and reliability of the lr model directly rely on the quality of this training data set.
there are two major factors that affect model training: 1) size of the training data set and 2) false peptide matches included in the training data set that do not follow the linear regression model of the true matches.
these false peptide matches should appear as outliers in our lr model and are referred to as outlier peptide matches.
these outlier peptide matches have a negative impact on the calculation of parameters in the lr model.
increasing the threshold for statistical scores contained in the training data can minimize outlier peptide matches but will also significantly reduce the size of the training data set.
by setting up moderate thresholds, a typical database search can generate training data sets containing  <dig> to  <dig> peptide matches.
one challenge of this approach is that outlier peptide matches may be retained within the training data, especially for searches with large databases obtained at low mass accuracy.
recursive outlier-removal algorithm
the lr model is vulnerable to outliers which distract the lr model training and lead to inaccurate results.
as a result, it is crucial to remove as many outlier peptide matches as possible before model training.
an algorithm based on robust lr was used to remove those outliers before model training.
the algorithm required an iterative solution that is summarized as follows:
<dig>  for each iteration step, a robust lr model is fitted to the training data set and gives robust estimates, β˜, of the parameters for the lr model in eqn.
<dig> .
<dig>  calculate the residuals e = tn× <dig> based on the robust parameter estimates β˜ by e = t - h β˜.
<dig>  remove those data as outliers that have residuals outside the 95% confidence interval, i.e.
ei ≤ μ˜e -  <dig>  σ˜e or ei ≥ μ˜e +  <dig>  σ˜e, where μ˜e is the median of the residuals, and σ˜e is equal to the median absolute of the residuals divided by  <dig> .
<dig>  repeat steps  <dig>   <dig> and  <dig> until no outliers are detected from the training data set in step  <dig> .
score algorithm based on peptide retention time
after outliers are removed from the training data set, the lr model is fitted to the training data set by ordinary least squares to give estimates of the parameters .
the predicted retention time t^ for a peptide with the calculated hydrophobicity h is given by eqn.
a.
<dig>  the prediction error, d, and the absolute error, Δ, of the predicted retention time for the peptide are respectively defined as
d=t−t^.
and
Δ=|d|=|t−t^|.
the observed error of the prediction, δ, is calculated by
δ=|tobs−t^|.
where tobs is the observed retention time of the peptide.
the score based on peptide retention time, crt, is defined as the probability that the theoretical absolute error Δ for a peptide match is greater than or equal to the observed absolute error δ, given that the peptide is a true match, i.e.
crt=p=p+p
given the two assumptions that all true peptide matches follow the linear regression model in eqn.
<dig> and the linear regression model is a normal error regression model, dset^ follows a t distribution with degrees of freedom of n -  <dig> for true peptides .
the score is calculated by the following equation.
crt=p+p=p+p=2×
where set^ is the standard error of the predicted retention time given in eqn.
a.
<dig>  ft is the cumulative density function of the t distribution with degrees of freedom of n -  <dig>  smaller δ gives higher crt score and indicates a higher confidence for the peptide match.
all cumulative density functions of any continuous distributions, including ft for -∞ <x < ∞, follows a continues uniform distribution over the interval of  <cit> .
the distribution of t=ft=1−crt <dig> is a continuous uniform distribution over the interval of  due to δ >  <dig>  its probability density function is given in eqn.
<dig>
ft={ <dig> ≤t≤ <dig> otherwise
the probability density function of crt for true peptide matches can be derived from that of t=ft=1−crt2
fcrt=|dtdcrt|ft=|ddcrt|ft=12ft
substitution of eqn.
<dig> into eqn.
<dig> yields the following.
fcrt={10≤crt≤10otherwise
thus, crt follows a continuous uniform distribution over the interval  <cit> .
consequently, its cumulative density function is given in eqn.
<dig>
fcrt={0crt<0crt0≤crt≤11crt> <dig>
the theoretical distribution of crt for random peptide matches is unknown and varies from one search to another.
automate evaluation of peptide matches based on their retention times
the retention time score algorithm is included as part of the massmatrix database search program to perform automated evaluation of peptide matches.
due to the robustness of the algorithm, the score threshold for selection of training data does not significantly affect the model training and results.
the score threshold for selection of training data for the algorithm in massmatrix was set to be ≥  <dig>  for both pp and pp <dig> scores  <cit>  and ≥  <dig>  for pptag score  <cit> .
massmatrix takes the mzxml, mzdata and mgf data files as input data formats.
the retention time based algorithm automatically scores peptide matches if the input data file is either mzxml or mzdata.
the retention time based algorithm is not used if the input data file is a mgf file due to the fact that mgf files lack retention times.
post-hoc retention time scoring of other database search programs
the retention time based algorithm described herein is generic and a post-hoc retention time analysis program for all other database search programs, lr_rt, was developed to perform automated post-search evaluation of the peptide matches.
the post-hoc analysis requires the original mzdata or mzxml file along with a tab or space delimited .txt file of the search results.
the search result file must contain the scan number, peptide sequence and score information for each peptide match.
the program was tested on mascot and x!tandem search results.
search results in the tab delimited .txt files can be obtained from mascot html search results or x!tandem pepxml search results by use of perl scripts available at .
score thresholds for selection of training data for the retention time based algorithm are set to be ≥  <dig> and ≤  <dig>  for mascot and x!tandem results respectively.
evaluation of the robust linear regression based algorithm
massmatrix automated evaluation of peptide matches based on their retention times
the robust lr based algorithm built in massmatrix was evaluated against experimental lc-ms/ms data from bovine histone digests acquired by use of a lcq deca xp+ ms. the data set contained  <dig> tandem mass spectra and was searched against a database that contained a bovine histone database and the ncbinr reversed human protein database as decoy sequences.
the complete list of peptide matches is provided in the additional file .
the decoy database was much larger than the bovine histone database and created ~ <dig> times as many theoretical peptides as the bovine histone database.
false positive peptide matches from the bovine histone database were thus assumed to be negligible  <cit> .
as a result peptide matches returned from the bovine histone database were considered as true positives  while those from the decoy database were considered to be false positives .
the accuracy and robustness of the algorithm is illustrated in the scatter plot for all peptide matches from the search .
the solid and dashed lines in the figure represent the lr model and its 99% confidence band fitted to the training data set with a size of  <dig> after outlier removal.
the key concern is that the application of the lr model reduces false positives but not at the expense of true positives.
in fact  <dig> of  <dig>  true peptide matches were observed within the 99% confidence band, i.e.
with crt ≥  <dig>  .
in contrast,  <dig> of  <dig>  false peptide matches were found within the 99% confidence band.
therefore, the majority  of false peptide matches were filtered by the application of the lr model described herein while only  <dig> % of true positive peptide matches were lost.
the distributions of retention time based scores, crt, for true positive and false peptide matches are shown in figure  <dig>  the score distribution for true peptide matches was close to that for the expected theoretical distribution described by eqn.
<dig> &  <dig>  false peptide matches had much lower scores than true peptide matches where majority of the false matches had scores less than  <dig> .
the algorithm was also evaluated by use of two publicly available lc-ms/ms data sets from significantly more complex samples.
the first data set was created by use of lc-ms/ms on an lcq ion trap mass spectrometer from a tryptic digest of a proteome sample from deinococcus radiodurans mr- <dig> gram-positive bacteria.
the data set  along with the experimental details can be obtained at .
the data set was searched by use of the massmatrix database search program against a database that contained both the deinococcus radiodurans database and a dominant reversed ncbinr human protein database used as a decoy database.
the second data set was created by use of 2d-lc-ms/ms on an lcq deca xp+ mass spectrometer from the tryptic digest of a human proteome sample.
the sample was separated by a scx column in  <dig> salt steps and the fraction from each step was analyzed by a c <dig> rplc-ms/ms.
eleven ms/ms data sets were generated.
the data set that was created from the first fraction that contained the greatest number of ms/ms scans among all  <dig> data sets was used in our evaluation.
the data set and the experimental details can be found at  <cit> .
the data set was searched against a database with a target ncbinr human database and a dominant decoy database.
the dominant decoy database contained ten randomized ncbinr human database and one reversed human database.
the search parameters for both data sets were the same as those used for the bovine histone data set.
the algorithm independently trained the peptide retention time prediction lr model for both the deinococcus radiodurans data set and the human proteome data set.
the r <dig> of the linear regression models for the two data sets were  <dig>  and  <dig> .
as shown in figure 5a,  <dig> % of fps was filtered at a threshold of  <dig>  for crt with a loss of  <dig> % of tps for the deinococcus radiodurans data set.
for the human proteome data set,  <dig> % of fps was filtered as loss of  <dig> % tps.
the results suggest that the algorithm implemented in massmatrix can be effectively used to reduce false positives of database search results for lc-ms/ms proteomic data from complex samples.
test of the assumptions of the algorithm
there are two assumption involved in the algorithm.
the first is that all true positives follow the linear regression model.
it can be seen from the previous discussion that this assumption was violated.
however, this departure from the first assumption was small and only caused small losses  of tps.
the second assumption involved in the algorithm is that the linear regression model in eqn.
<dig> is a normal error model, i.e., the residuals of the tps that follow the linear regression model are normally distributed.
this assumption was tested by the quantile-quantile plots  of all the residuals of the tps following the linear regression model, i.e.
with crt ≥  <dig>  for the three data sets.
the three q-q plots for the three data sets are shown in figure  <dig>  it can be seen that the q-q plots for the bovine histone and deinococcus radiodurans data sets formed a linear pattern and the normality assumption was valid .
for the human proteome data set, there was a slight departure from the normality as shown in figure 6c.
however, the small departure from the normality is not significant and does not create any serious concerns.
overall these results demonstrate that there was no significant departure from normality of the residuals for tps that follow the linear model.
post-hoc retention time analysis program for other database search programs
the post-hoc retention time analysis program, lr_rt, was used to evaluate mascot and x!tandem search results for the bovine histone data set with the same database and search parameters as used with the massmatrix search.
peptide matches from these two database search programs were evaluated by our retention time based algorithm, lr_rt.
a retention time based score, crt, was calculated for each peptide match.
the complete lists of peptide matches along with their crt scores are provided in the additional files .
the algorithm independently trained the peptide retention time prediction lr model for both the mascot and x!tandem search results.
similar to the case for massmatrix, search results for mascot and x!tandem were significantly improved after retention time scoring.
the final r <dig> values from the lr models were  <dig>  and  <dig>  for mascot and x!tandem results respectively.
more importantly, the lr_rt program was able to significantly reduce the number of false positives for both mascot and x!tandem search results.
for mascot research results,  <dig> % of false positives were filtered with a threshold of  <dig>  for crt, whereas only  <dig> % of true positives were filtered with the same threshold .
for x!tandem results,  <dig> % of false positives were filtered with a loss of  <dig> % of true positives .
therefore, the majority of the false peptide matches from the two programs can be filtered by the retention time based score algorithm with a modest negative impact on the number of true positives.
the post-hoc retention time analysis program was also evaluated by mascot and x!tandem search results from the deinococcus radiodurans and human proteome data sets from complex samples.
the databases and search parameters in mascot and x!tandem were the same as those used in the massmatrix searches for the two data sets.
for the mascot searches of the deinococcus radiodurans and human data sets  and the x!tandem search of the deinococcus radiodurans data set , the algorithm also effectively reduced false positives with small losses of true positives.
however, the algorithm was not applicable to the x!tandem search of the human data set.
this was due to the fact that x!tandem did not return a significant number of true positives for the data set.
the number of peptide matches with expectation value ≤  <dig>  from the target database of the search was  <dig>  which was not enough for peptide retention time model training.
roc analysis
CONCLUSIONS
an algorithm based on robust lr has been developed for automated evaluation of peptide matches from database searches by use of peptide retention time in reversed-phase hplc.
the recursive outlier-removal algorithm based on robust lr enables the algorithm to train the lr model on the fly for each search thus the need for internal or external protein or peptide standards is eliminated.
the lr model for peptide retention in rplc developed by krokhin et al  <cit>  was adopted in the current implementation of the algorithm.
the algorithm was implemented in the massmatrix database search program and evaluated with a lc-ms/ms data set of bovine histones obtained on a lcq deca xp mass spectrometer.
the r <dig> value for lr model was improved from  <dig>  to  <dig>  after outlier removal.
the majority  of true peptide matches fell within the 99% confidence band for the trained lr model, whereas only  <dig> % of false peptide matches fell in the same 99% confidence band.
by use of this approach the majority  of the false peptide matches can be filtered from the results based on retention time while only losing  <dig> % of the true positive peptide matches.
a post-hoc retention time analysis program, lr_rt, was also developed to analyze peptide matches from other database search programs.
the program was tested on mascot and x!tandem search results for the bovine histone data set.
more than 60% of false positives in mascot and x!tandem search results were filtered by the program with a loss of less than  <dig> % for true positives.
the algorithm was also tested on two publicly available data sets from complex samples.
for the data set from a deinococcus radiodurans proteome sample, the algorithm was able to reduce the majority of false positives at a small loss of true positives for searches in massmatrix, mascot and x!tandem.
for the data set from a human proteome sample, the algorithm could still effectively reduce false rates for searches in massmatrix and mascot.
for the search of that data set in x!tandem, the algorithm was not applicable due to the fact that x!tandem was not able to catch a significant number of true positives.
a statistical score algorithm was developed for ranking peptide matches based on predicted and observed retention times.
the score distribution for true peptide matches was close to its theoretical distribution, which indicates that the lr model trained by the robust lr based algorithm represents the true linear relationship between the peptide retention times in rplc and their calculated hydrophobicities.
false peptide matches tend to have much lower scores than true matches, and the majority of the false matches have scores less than  <dig> .
this score enables differentiation between true and false matches based on retention time.
after removal of peptide matches with insignificant scores based on retention time, higher sensitivities and specificities were achieved and the false positive rates of the searches were significantly lowered as shown by the roc analysis for all the three database search programs.
availability and requirements
project name: massmatrix retention time analysis.
project home page: .
operating systems: windows, linux.
programming language: ansi c++.
other requirements: none.
license: none.
any restrictions to use by non-academics: none.
appendix
<dig>  linear regression
for the lr model described in eqn.
<dig>  the ordinary least-square estimates of the parameters from a training data set of sample size n are given by
β^=−1htt;
where estimated parameter matrix β^=2× <dig>  and matrices for the training data set h=n× <dig>  and t=n× <dig>  hi and ti are the hydrophobicity and experimental retention time of the peptide match i in the training data set.
the predicted retention time for a peptide with hydrophobicity h, is calculated by
t^=hβ^=a^+b^h;
where h = 1× <dig>
a regression model in eqn.
<dig> that assumes the residual ε follows an independent n is called a normal error regression model.
for this type of model, the variance of t is
var = σ <dig>
according to eqn.
a.
<dig> and a.
<dig>  the variance of β^ is
var=var{−1htt}={−1ht}var{−1ht}t={−1ht}σ2i{−1ht}t=σ2− <dig>
and the variance of t^ is
var=var=hvarht=σ2h−1ht
for a peptide match that follows the linear model, the variance of the prediction error
var=var+var=σ2+σ2h−1ht=σ2×{1+h−1ht}
the estimate of σ <dig>  mse, is calculated by
mse=1n−2t
therefore, the variance of the prediction error, t - t^, can be estimated by
v^ar=mse×{1+h−1ht}
and the standard error for the predicted retention time is estimated by
set^=v^ar=mse×{1+h−1ht}
due to the normality assumption of the residuals, the prediction error follows a normal distribution.
therefore, t−t^set^ is a t distribution with degrees of freedom of .
<dig>  robust linear regression
ordinary least-square estimates of lr models can be severely affected by outliers that may lead to incorrect results.
another approach called robust lr is less vulnerable to outliers.
a commonly used solution of a robust lr model involves an iterative method which is summarized as follows: <cit>
<dig>  the ordinary least-square estimates of the lr model from eqn.
a.
<dig> are obtained as initial estimates of the regression parameters, β~ <dig>
<dig>  at the ith iteration step, calculate residuals based on the parameter estimates from the previous i-1th iteration, β~i− <dig>
e=t−hβ˜i−1;
where, e = tn× <dig>  calculate associated weights by
w=n×1=n×1;
where wb is bisquare weight function,
wb={2for |x|≤k0for |x|>k;
and k is the tuning constant for the function that is given by k =  <dig>  σ˜e.
σ˜e is the robust estimate of the standard deviation of the residuals, and it is equal to the median absolute of the residuals divided by  <dig> .
<dig>  calculate the weighted-least-squares estimates
β˜i=−1htwt;
where, w=diag=n×n..
<dig>  repeat steps  <dig> and  <dig> until the parameter estimates converge.
the converged estimates, β˜, are the solution for the robust lr model.
authors' contributions
hx designed the algorithm and drafted the manuscript.
maf was the principle investigator and initiated the project.
maf also provided overall guidance of the project and revised the manuscript critically.
ly prepared the peptide sample and collected the lc-ms/ms data.
all authors have read and approved the final manuscript.
supplementary material
additional file 1
peptide matches from massmatrix search result for the bovine histone data set.
the complete list of peptide matches along with their crt scores from the search in massmatrix for the bovine histone data set.
click here for file
additional file 2
peptide matches from mascot search result for the bovine histone data set.
the complete list of peptide matches along with their crt scores from the search in mascot for the bovine histone data set.
click here for file
additional file 3
peptide matches from x!tandem search result for the bovine histone data set.
the complete list of peptide matches along with their crt scores from the search in x!tandem for the bovine histone data set.
click here for file
acknowledgements
the study was funded by the ohio state university, the national institutes of health , the v foundation  and the leukemia & lymphoma society.
the authors thank ken j auberry, richard d smith, and anderson gordon for the help in obtaining the deinococcus radiodurans data set.
the data set was obtained by richard d. smith and the biological systems analysis and mass spectrometry group at pacific northwest national laboratory  in richland, washington.
portions of this research were supported by the nih national center for research resources , and the w.r. wiley environmental molecular science laboratory .
pnnl is operated by battelle memorial institute for the u.s. department of energy under contract de-ac05-76rl <dig>  <dig>  the human proteome data set was obtained from .

 the science of proteomics encapsulates the large-scale identification, characterization and quantitation of proteins from biological samples. mass spectrometry has been recognized as a powerful technique to study proteins. high-performance liquid chromatography coupled with tandem mass spectrometry is most commonly used in shotgun proteomics to resolve and identify proteolytic peptides generated from complex protein mixtures. peptide and protein identifications are usually derived from information contained in the tandem ms data. automated database searching and de novo sequencing algorithms are routinely used to convert the ms/ms data into peptide and protein identifications. database search algorithms are more commonly used at this time due to their relatively low computational expense and higher compatibility with low mass accuracy and low quality ms/ms data. it has also been recognized that the lc retention times of peptides are related to their sequences and can be used as complementary information for their identification and characterization. several methods have been developed to predict peptide retention times in reversed-phase liquid chromatography based on amino acid compositions and/or sequences. high correlation between observed and predicted retention times for peptides in rplc under different conditions has been achieved by use of these methods. furthermore, these approaches can be combined with mass spectrometry to achieve better confidence in peptide identification than ms alone. for example, accurate mass tags combined with peptide retention time prediction has been effectively used by several groups to improve proteome characterization. peptide retention time prediction can also be used to refine and improve peptide identifications resulting from analysis of lc-ms/ms by database search software. in this way, false peptide matches from database search results can be minimized and true peptide matches can be confirmed with higher confidence. krokhin et al reported an algorithm to refine the results obtained from the global proteome machine database searches. in their approach, either internal or external standard peptides were used to estimate the regression parameters for the linear retention time prediction model used to refine their results. strittmatter et al reported a post-database search method that evaluated peptide matches from sequest based upon their retention times. they reported a peptide retention time prediction model based on artificial neutral networks. the prediction model was calibrated with highly reliable peptide matches from sequest for each lc-ms/ms analysis. an empirical discriminant score based on retention time and sequest scores was also developed for peptide matches. it was shown that the number of reliable peptide matches was increased by use of peptide retention time information. klammer et al also developed an algorithm based on support vector regression to improve peptide identifications in tandem mass spectrometry by use of retention time prediction. as much as 50% of false peptide identifications in database search results from sequest can be filtered and only 3% of true peptide matches were lost. the algorithm also trains the linear regression model dynamically for each data set. we recently developed a robust linear regression based algorithm for automated evaluation of peptide identifications from database search programs based on retention time in rplc. the algorithm extends the retention time prediction algorithm and its use for peptide identification in off-line lc-ms/ms by krokhin et al. the algorithm described here works for on-line lc-ms/ms experiments and eliminates the need of retention time prediction model calibration by use of internal or external standard peptides. the algorithm is generic and can be used to evaluate peptide matches from any database search program. it has been included in a database search program, massmatrix, to perform automated data analysis. a post-hoc retention time analysis program lr_rt was also developed to analyze search results from other publicly available programs, such as mascot and x!tandem. furthermore, a score algorithm was developed to provide a statistical score for each peptide match based on its predicted and observed retention times. methods sample preparation and mass spectrometry bovine histones were isolated from bovine thymus tissue as described by sures et al. the bovine histone mixture was digested by use of trypsin in mm ammonium bicarbonate buffer. enzymes were used in 25: ratio and the mixture was incubated at 37°c for two hours. the digested peptides were identified by use of data-dependent nano-lc-ms/ms on an lcq deca xp ion trap mass spectrometer as reported previously by su et al. in brief, μl of bovine histone peptides at a total concentration of μg/μl was injected and eluted off the capillary hplc column into the lcq mass spectrometer at a flow rate of ~ nl/min. mobile phases a and b were water with % acetic acid and acetonitrile with % acetic acid respectively. a linear gradient of 5–50% of mobile phase b over minutes was used. the total run time was minutes. database search and search parameters the.raw data files obtained from the mass spectrometer were converted to mzxml files by use of readw. tandem mass spectra that were not derived from singly charged precursor ions were considered as both doubly and triply charged precursors. the mzxml file was searched by use of massmatrix against a database that contained both the bovine histone database and a reversed ncbinr human protein database as a decoy database. the search options were set as follows: i) no variable or fixed modifications; ii) enzyme: trypsin; iii) missed cleavages = 3; iv) peptide length = to amino acid residues; and v) mass tolerances of da and da for the precursor and product ions respectively. the data set was also evaluated by mascot and x!tandem. the search parameters were identical to those in massmatrix. the search results from mascot and x!tandem were then analyzed by the post-hoc retention time analysis program, lr_rt to obtain retention time based scores for each peptide match from the two search programs.  algorithm development overview a key advantage of this algorithm is that the lr model can be trained independently for each search. thus there is no need to train or calibrate the lr model with internal or external standards for a given batch of samples. furthermore, the algorithm is generic and can be used to evaluate peptide matches from any database search program. the algorithm can use different linear regression models for predicting peptide retention times under a variety of chromatographic conditions. for analysis of shotgun proteomic data sets, the linear regression model for peptide retention time prediction developed by krokhin et al was used. the model can be used to accurately predict retention times of tryptic peptides on reversed-phase hplc columns of various sizes with linear water-acetonitrile gradients containing trifluoroacetic acid, acetic acid, or formic acid as the ion-pairing agent. the detailed implementation and performance of the algorithm are described in the next sections. linear regression model for predicting peptide retention times in rplc retention times for true peptide matches identified by database search programs were assumed to follow a linear regression model: t = ah + b + ε; where t is the retention time of the peptide match, h is the calculated hydrophobicity of the peptide match, a and b are parameters for the linear model that depend on the rplc column and elution gradient, and ε is the residual of the model. the hydrophobicity for a peptide is calculated from the peptide sequence by use of the model developed by krokhin et al. their model was derived from the work of guo et al in which the hydrophobicity of a peptide is calculated by h={klif h< kl+ if h≥ where kl is the length correction coefficient of the peptide, n is the length of the peptide in terms of the number of amino acid residues, ∑i=1nrci is the sum of rc values for all amino acid residues of the peptide, and r cnt, r cnt, and r cnt are the rcnt values for the first, second, and third amino acid residues from the n-terminus of the peptide respectively. the length correction coefficient kl is calculated by eqn. kl={1− ×if n<101− ×if n>201otherwise the rc and rcnt values for the common amino acid residues were reported previously by krokhin et al. selection of training data the retention time of the peptide match for each tandem mass spectrum was obtained from the mzxml or mzdata file. we assume that retention times for true peptide matches will follow the lr model described in eqn. the parameters of the lr model for true peptide matches are estimated from a training data set, which are then used to evaluate all peptide matches in the search result. in order to eliminate the need for lr model training by internal or external protein or peptide standards, the algorithm creates a training data set directly from the current database search results. this training data contains a selected number of peptide matches from the database search program with scores above a specified threshold. the accuracy and reliability of the lr model directly rely on the quality of this training data set. there are two major factors that affect model training: 1) size of the training data set and 2) false peptide matches included in the training data set that do not follow the linear regression model of the true matches. these false peptide matches should appear as outliers in our lr model and are referred to as outlier peptide matches. these outlier peptide matches have a negative impact on the calculation of parameters in the lr model. increasing the threshold for statistical scores contained in the training data can minimize outlier peptide matches but will also significantly reduce the size of the training data set. by setting up moderate thresholds, a typical database search can generate training data sets containing to peptide matches. one challenge of this approach is that outlier peptide matches may be retained within the training data, especially for searches with large databases obtained at low mass accuracy. recursive outlier-removal algorithm the lr model is vulnerable to outliers which distract the lr model training and lead to inaccurate results. as a result, it is crucial to remove as many outlier peptide matches as possible before model training. an algorithm based on robust lr was used to remove those outliers before model training. the algorithm required an iterative solution that is summarized as follows: for each iteration step, a robust lr model is fitted to the training data set and gives robust estimates, β˜, of the parameters for the lr model in eqn.. calculate the residuals e = tn× based on the robust parameter estimates β˜ by e = t - h β˜. remove those data as outliers that have residuals outside the 95% confidence interval, i.e. ei ≤ μ˜e - σ˜e or ei ≥ μ˜e + σ˜e, where μ˜e is the median of the residuals, and σ˜e is equal to the median absolute of the residuals divided by. repeat steps and until no outliers are detected from the training data set in step. score algorithm based on peptide retention time after outliers are removed from the training data set, the lr model is fitted to the training data set by ordinary least squares to give estimates of the parameters. the predicted retention time t^ for a peptide with the calculated hydrophobicity h is given by eqn. a. the prediction error, d, and the absolute error, Δ, of the predicted retention time for the peptide are respectively defined as d=t−t^. and Δ=|d|=|t−t^|. the observed error of the prediction, δ, is calculated by δ=|tobs−t^|. where tobs is the observed retention time of the peptide. the score based on peptide retention time, crt, is defined as the probability that the theoretical absolute error Δ for a peptide match is greater than or equal to the observed absolute error δ, given that the peptide is a true match, i.e. crt=p=p+p given the two assumptions that all true peptide matches follow the linear regression model in eqn. and the linear regression model is a normal error regression model, dset^ follows a t distribution with degrees of freedom of n - for true peptides. the score is calculated by the following equation. crt=p+p=p+p=2× where set^ is the standard error of the predicted retention time given in eqn. a. ft is the cumulative density function of the t distribution with degrees of freedom of n - smaller δ gives higher crt score and indicates a higher confidence for the peptide match. all cumulative density functions of any continuous distributions, including ft for -∞ <x < ∞, follows a continues uniform distribution over the interval of. the distribution of t=ft=1−crt is a continuous uniform distribution over the interval of due to δ > its probability density function is given in eqn. ft={ ≤t≤ otherwise the probability density function of crt for true peptide matches can be derived from that of t=ft=1−crt2 fcrt=|dtdcrt|ft=|ddcrt|ft=12ft substitution of eqn. into eqn. yields the following. fcrt={10≤crt≤10otherwise thus, crt follows a continuous uniform distribution over the interval. consequently, its cumulative density function is given in eqn. fcrt={0crt<0crt0≤crt≤11crt> the theoretical distribution of crt for random peptide matches is unknown and varies from one search to another. automate evaluation of peptide matches based on their retention times the retention time score algorithm is included as part of the massmatrix database search program to perform automated evaluation of peptide matches. due to the robustness of the algorithm, the score threshold for selection of training data does not significantly affect the model training and results. the score threshold for selection of training data for the algorithm in massmatrix was set to be ≥ for both pp and pp scores and ≥ for pptag score. massmatrix takes the mzxml, mzdata and mgf data files as input data formats. the retention time based algorithm automatically scores peptide matches if the input data file is either mzxml or mzdata. the retention time based algorithm is not used if the input data file is a mgf file due to the fact that mgf files lack retention times. post-hoc retention time scoring of other database search programs the retention time based algorithm described herein is generic and a post-hoc retention time analysis program for all other database search programs, lr_rt, was developed to perform automated post-search evaluation of the peptide matches. the post-hoc analysis requires the original mzdata or mzxml file along with a tab or space delimited.txt file of the search results. the search result file must contain the scan number, peptide sequence and score information for each peptide match. the program was tested on mascot and x!tandem search results. search results in the tab delimited.txt files can be obtained from mascot html search results or x!tandem pepxml search results by use of perl scripts available at. score thresholds for selection of training data for the retention time based algorithm are set to be ≥ and ≤ for mascot and x!tandem results respectively. evaluation of the robust linear regression based algorithm massmatrix automated evaluation of peptide matches based on their retention times the robust lr based algorithm built in massmatrix was evaluated against experimental lc-ms/ms data from bovine histone digests acquired by use of a lcq deca xp+ ms. the data set contained tandem mass spectra and was searched against a database that contained a bovine histone database and the ncbinr reversed human protein database as decoy sequences. the complete list of peptide matches is provided in the additional file. the decoy database was much larger than the bovine histone database and created ~ times as many theoretical peptides as the bovine histone database. false positive peptide matches from the bovine histone database were thus assumed to be negligible. as a result peptide matches returned from the bovine histone database were considered as true positives while those from the decoy database were considered to be false positives. the accuracy and robustness of the algorithm is illustrated in the scatter plot for all peptide matches from the search. the solid and dashed lines in the figure represent the lr model and its 99% confidence band fitted to the training data set with a size of after outlier removal. the key concern is that the application of the lr model reduces false positives but not at the expense of true positives. in fact of true peptide matches were observed within the 99% confidence band, i.e. with crt ≥. in contrast, of false peptide matches were found within the 99% confidence band. therefore, the majority of false peptide matches were filtered by the application of the lr model described herein while only % of true positive peptide matches were lost. the distributions of retention time based scores, crt, for true positive and false peptide matches are shown in figure the score distribution for true peptide matches was close to that for the expected theoretical distribution described by eqn. & false peptide matches had much lower scores than true peptide matches where majority of the false matches had scores less than. the algorithm was also evaluated by use of two publicly available lc-ms/ms data sets from significantly more complex samples. the first data set was created by use of lc-ms/ms on an lcq ion trap mass spectrometer from a tryptic digest of a proteome sample from deinococcus radiodurans mr- gram-positive bacteria. the data set along with the experimental details can be obtained at. the data set was searched by use of the massmatrix database search program against a database that contained both the deinococcus radiodurans database and a dominant reversed ncbinr human protein database used as a decoy database. the second data set was created by use of 2d-lc-ms/ms on an lcq deca xp+ mass spectrometer from the tryptic digest of a human proteome sample. the sample was separated by a scx column in salt steps and the fraction from each step was analyzed by a c rplc-ms/ms. eleven ms/ms data sets were generated. the data set that was created from the first fraction that contained the greatest number of ms/ms scans among all data sets was used in our evaluation. the data set and the experimental details can be found at. the data set was searched against a database with a target ncbinr human database and a dominant decoy database. the dominant decoy database contained ten randomized ncbinr human database and one reversed human database. the search parameters for both data sets were the same as those used for the bovine histone data set. the algorithm independently trained the peptide retention time prediction lr model for both the deinococcus radiodurans data set and the human proteome data set. the r of the linear regression models for the two data sets were and. as shown in figure 5a, % of fps was filtered at a threshold of for crt with a loss of % of tps for the deinococcus radiodurans data set. for the human proteome data set, % of fps was filtered as loss of % tps. the results suggest that the algorithm implemented in massmatrix can be effectively used to reduce false positives of database search results for lc-ms/ms proteomic data from complex samples. test of the assumptions of the algorithm there are two assumption involved in the algorithm. the first is that all true positives follow the linear regression model. it can be seen from the previous discussion that this assumption was violated. however, this departure from the first assumption was small and only caused small losses of tps. the second assumption involved in the algorithm is that the linear regression model in eqn. is a normal error model, i.e., the residuals of the tps that follow the linear regression model are normally distributed. this assumption was tested by the quantile-quantile plots of all the residuals of the tps following the linear regression model, i.e. with crt ≥ for the three data sets. the three q-q plots for the three data sets are shown in figure it can be seen that the q-q plots for the bovine histone and deinococcus radiodurans data sets formed a linear pattern and the normality assumption was valid. for the human proteome data set, there was a slight departure from the normality as shown in figure 6c. however, the small departure from the normality is not significant and does not create any serious concerns. overall these results demonstrate that there was no significant departure from normality of the residuals for tps that follow the linear model. post-hoc retention time analysis program for other database search programs the post-hoc retention time analysis program, lr_rt, was used to evaluate mascot and x!tandem search results for the bovine histone data set with the same database and search parameters as used with the massmatrix search. peptide matches from these two database search programs were evaluated by our retention time based algorithm, lr_rt. a retention time based score, crt, was calculated for each peptide match. the complete lists of peptide matches along with their crt scores are provided in the additional files. the algorithm independently trained the peptide retention time prediction lr model for both the mascot and x!tandem search results. similar to the case for massmatrix, search results for mascot and x!tandem were significantly improved after retention time scoring. the final r values from the lr models were and for mascot and x!tandem results respectively. more importantly, the lr_rt program was able to significantly reduce the number of false positives for both mascot and x!tandem search results. for mascot research results, % of false positives were filtered with a threshold of for crt, whereas only % of true positives were filtered with the same threshold. for x!tandem results, % of false positives were filtered with a loss of % of true positives. therefore, the majority of the false peptide matches from the two programs can be filtered by the retention time based score algorithm with a modest negative impact on the number of true positives. the post-hoc retention time analysis program was also evaluated by mascot and x!tandem search results from the deinococcus radiodurans and human proteome data sets from complex samples. the databases and search parameters in mascot and x!tandem were the same as those used in the massmatrix searches for the two data sets. for the mascot searches of the deinococcus radiodurans and human data sets and the x!tandem search of the deinococcus radiodurans data set, the algorithm also effectively reduced false positives with small losses of true positives. however, the algorithm was not applicable to the x!tandem search of the human data set. this was due to the fact that x!tandem did not return a significant number of true positives for the data set. the number of peptide matches with expectation value ≤ from the target database of the search was which was not enough for peptide retention time model training. roc analysis  an algorithm based on robust lr has been developed for automated evaluation of peptide matches from database searches by use of peptide retention time in reversed-phase hplc. the recursive outlier-removal algorithm based on robust lr enables the algorithm to train the lr model on the fly for each search thus the need for internal or external protein or peptide standards is eliminated. the lr model for peptide retention in rplc developed by krokhin et al was adopted in the current implementation of the algorithm. the algorithm was implemented in the massmatrix database search program and evaluated with a lc-ms/ms data set of bovine histones obtained on a lcq deca xp mass spectrometer. the r value for lr model was improved from to after outlier removal. the majority of true peptide matches fell within the 99% confidence band for the trained lr model, whereas only % of false peptide matches fell in the same 99% confidence band. by use of this approach the majority of the false peptide matches can be filtered from the results based on retention time while only losing % of the true positive peptide matches. a post-hoc retention time analysis program, lr_rt, was also developed to analyze peptide matches from other database search programs. the program was tested on mascot and x!tandem search results for the bovine histone data set. more than 60% of false positives in mascot and x!tandem search results were filtered by the program with a loss of less than % for true positives. the algorithm was also tested on two publicly available data sets from complex samples. for the data set from a deinococcus radiodurans proteome sample, the algorithm was able to reduce the majority of false positives at a small loss of true positives for searches in massmatrix, mascot and x!tandem. for the data set from a human proteome sample, the algorithm could still effectively reduce false rates for searches in massmatrix and mascot. for the search of that data set in x!tandem, the algorithm was not applicable due to the fact that x!tandem was not able to catch a significant number of true positives. a statistical score algorithm was developed for ranking peptide matches based on predicted and observed retention times. the score distribution for true peptide matches was close to its theoretical distribution, which indicates that the lr model trained by the robust lr based algorithm represents the true linear relationship between the peptide retention times in rplc and their calculated hydrophobicities. false peptide matches tend to have much lower scores than true matches, and the majority of the false matches have scores less than. this score enables differentiation between true and false matches based on retention time. after removal of peptide matches with insignificant scores based on retention time, higher sensitivities and specificities were achieved and the false positive rates of the searches were significantly lowered as shown by the roc analysis for all the three database search programs. availability and requirements project name: massmatrix retention time analysis. project home page:. operating systems: windows, linux. programming language: ansi c++. other requirements: none. license: none. any restrictions to use by non-academics: none. appendix linear regression for the lr model described in eqn. the ordinary least-square estimates of the parameters from a training data set of sample size n are given by β^=−1htt; where estimated parameter matrix β^=2× and matrices for the training data set h=n× and t=n× hi and ti are the hydrophobicity and experimental retention time of the peptide match i in the training data set. the predicted retention time for a peptide with hydrophobicity h, is calculated by t^=hβ^=a^+b^h; where h = 1× a regression model in eqn. that assumes the residual ε follows an independent n is called a normal error regression model. for this type of model, the variance of t is var = σ according to eqn. a. and a. the variance of β^ is var=var{−1htt}={−1ht}var{−1ht}t={−1ht}σ2i{−1ht}t=σ2− and the variance of t^ is var=var=hvarht=σ2h−1ht for a peptide match that follows the linear model, the variance of the prediction error var=var+var=σ2+σ2h−1ht=σ2×{1+h−1ht} the estimate of σ mse, is calculated by mse=1n−2t therefore, the variance of the prediction error, t - t^, can be estimated by v^ar=mse×{1+h−1ht} and the standard error for the predicted retention time is estimated by set^=v^ar=mse×{1+h−1ht} due to the normality assumption of the residuals, the prediction error follows a normal distribution. therefore, t−t^set^ is a t distribution with degrees of freedom of. robust linear regression ordinary least-square estimates of lr models can be severely affected by outliers that may lead to incorrect results. another approach called robust lr is less vulnerable to outliers. a commonly used solution of a robust lr model involves an iterative method which is summarized as follows: the ordinary least-square estimates of the lr model from eqn. a. are obtained as initial estimates of the regression parameters, β~ at the ith iteration step, calculate residuals based on the parameter estimates from the previous i-1th iteration, β~i− e=t−hβ˜i−1; where, e = tn× calculate associated weights by w=n×1=n×1; where wb is bisquare weight function, wb={2for |x|≤k0for |x|>k; and k is the tuning constant for the function that is given by k = σ˜e. σ˜e is the robust estimate of the standard deviation of the residuals, and it is equal to the median absolute of the residuals divided by. calculate the weighted-least-squares estimates β˜i=−1htwt; where, w=diag=n×n.. repeat steps and until the parameter estimates converge. the converged estimates, β˜, are the solution for the robust lr model. authors' contributions hx designed the algorithm and drafted the manuscript. maf was the principle investigator and initiated the project. maf also provided overall guidance of the project and revised the manuscript critically. ly prepared the peptide sample and collected the lc-ms/ms data. all authors have read and approved the final manuscript. supplementary material additional file 1 peptide matches from massmatrix search result for the bovine histone data set. the complete list of peptide matches along with their crt scores from the search in massmatrix for the bovine histone data set. click here for file additional file 2 peptide matches from mascot search result for the bovine histone data set. the complete list of peptide matches along with their crt scores from the search in mascot for the bovine histone data set. click here for file additional file 3 peptide matches from x!tandem search result for the bovine histone data set. the complete list of peptide matches along with their crt scores from the search in x!tandem for the bovine histone data set. click here for file acknowledgements the study was funded by the ohio state university, the national institutes of health, the v foundation and the leukemia & lymphoma society. the authors thank ken j auberry, richard d smith, and anderson gordon for the help in obtaining the deinococcus radiodurans data set. the data set was obtained by richard d. smith and the biological systems analysis and mass spectrometry group at pacific northwest national laboratory in richland, washington. portions of this research were supported by the nih national center for research resources, and the w.r. wiley environmental molecular science laboratory. pnnl is operated by battelle memorial institute for the u.s. department of energy under contract de-ac05-76rl the human proteome data set was obtained from.
this report describes the implementation of an automated approach to reduce false positives and validate peptide matches. several methods have been developed to use the peptide retention time as to refine and improve peptide identifications from database search algorithms. the robust algorithm does not require internal or external peptide standards to train or calibrate the linear regression model used for peptide retention time prediction. it provides a statistical score for each peptide match based on its retention time. rejection of false positive peptide matches in database searches of shotgun proteomic experimental data is highly desirable. overall higher sensitivities and specificities were achieved for database searches carried out with massmatrix, mascot and x!tandem after implementation of the retention time based score algorithm. analysis of peptide matches where the retention time score was included resulted in a significant reduction of false positive matches with little effect on the number of true positives. the algorithm scores peptides based on their predicted and observed reversed-phase liquid chromatography retention times. the algorithm is generic and can be incorporated into any database search program to perform automated evaluation of the candidate peptide matches based on their retention times. a robust linear regression based algorithm was developed to automate the evaluation of peptide identifications obtained from shotgun proteomic experiments.
 rejection of false positive peptide matches in database searches of shotgun proteomic experimental data is highly desirable. several methods have been developed to use the peptide retention time as to refine and improve peptide identifications from database search algorithms. this report describes the implementation of an automated approach to reduce false positives and validate peptide matches.  a robust linear regression based algorithm was developed to automate the evaluation of peptide identifications obtained from shotgun proteomic experiments. the algorithm scores peptides based on their predicted and observed reversed-phase liquid chromatography retention times. the robust algorithm does not require internal or external peptide standards to train or calibrate the linear regression model used for peptide retention time prediction. the algorithm is generic and can be incorporated into any database search program to perform automated evaluation of the candidate peptide matches based on their retention times. it provides a statistical score for each peptide match based on its retention time.  analysis of peptide matches where the retention time score was included resulted in a significant reduction of false positive matches with little effect on the number of true positives. overall higher sensitivities and specificities were achieved for database searches carried out with massmatrix, mascot and x!tandem after implementation of the retention time based score algorithm. 