Automatic Peak Selection by a Benjamini-Hochberg-Based Algorithm

نویسندگان

  • Ahmed Abbas
  • Xin-Bing Kong
  • Zhi Liu
  • Bing-Yi Jing
  • Xin Gao
چکیده

A common issue in bioinformatics is that computational methods often generate a large number of predictions sorted according to certain confidence scores. A key problem is then determining how many predictions must be selected to include most of the true predictions while maintaining reasonably high precision. In nuclear magnetic resonance (NMR)-based protein structure determination, for instance, computational peak picking methods are becoming more and more common, although expert-knowledge remains the method of choice to determine how many peaks among thousands of candidate peaks should be taken into consideration to capture the true peaks. Here, we propose a Benjamini-Hochberg (B-H)-based approach that automatically selects the number of peaks. We formulate the peak selection problem as a multiple testing problem. Given a candidate peak list sorted by either volumes or intensities, we first convert the peaks into [Formula: see text]-values and then apply the B-H-based algorithm to automatically select the number of peaks. The proposed approach is tested on the state-of-the-art peak picking methods, including WaVPeak [1] and PICKY [2]. Compared with the traditional fixed number-based approach, our approach returns significantly more true peaks. For instance, by combining WaVPeak or PICKY with the proposed method, the missing peak rates are on average reduced by 20% and 26%, respectively, in a benchmark set of 32 spectra extracted from eight proteins. The consensus of the B-H-selected peaks from both WaVPeak and PICKY achieves 88% recall and 83% precision, which significantly outperforms each individual method and the consensus method without using the B-H algorithm. The proposed method can be used as a standard procedure for any peak picking method and straightforwardly applied to some other prediction selection problems in bioinformatics. The source code, documentation and example data of the proposed method is available at http://sfb.kaust.edu.sa/pages/software.aspx.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Order Selection for Multipath Mimo Channels Using the Benjamini-hochberg Procedure

We solve the model order selection problem for a multipleinput multiple-output (MIMO) channel in analogy to the detection problem for multiple signals embedded in noisy observations. Our approach uses a multiple hypothesis test based on log-likelihood ratios. This multiple test detects the number of propagation paths in a multipath channel iteratively. To control the global level of the multipl...

متن کامل

On Signal Detection Using the Benjamini-hochberg Procedure

We investigate a multiple hypothesis test designed for detecting signals embedded in noisy observations of a sensor array. The global level of the multiple test is controlled by the false discovery rate (FDR) criterion recently suggested by Benjamini and Hochberg instead of the classical familywise error rate (FWE) criterion. In the previous study [3], the suggested procedure has shown promisin...

متن کامل

The Benjamini-Hochberg method in the case of discrete test statistics.

We present a reformulation of the Benjamini-Hochberg method that is useful in 'large-scale' multiple testing problems based on discrete test statistics and derive its basic asymptotic (as the number of hypotheses tends to infinity) properties, subsuming earlier results. A set of gene expression data is used to illustrate the workings of the method in a multiple testing problem based on Kolmogor...

متن کامل

Iterative Approach for Automatic Beam Angle Selection in Intensity Modulated Radiation Therapy Planning

Introduction: Beam-angle optimization (BAO) is a computationally intensive problem for a number of reasons. First, the search space of the solutions is huge, requiring enumeration of all possible beam orientation combinations. For example, when choosing 4 angles out of 36 candidate beam angles, C36 = 58905 possible combinations exist.  Second, any change in a   beam 4 config...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2013