Protein Β-Sheet Prediction Using an Efficient Dynamic Programming Algorithm

No Thumbnail Available

Date

2017

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Sci Ltd

Open Access Color

Green Open Access

No

OpenAIRE Downloads

OpenAIRE Views

Publicly Funded

No
Impulse
Average
Influence
Average
Popularity
Top 10%

Research Projects

Journal Issue

Abstract

Predicting the beta-sheet structure of a protein is one of the most important intermediate steps towards the identification of its tertiary structure. However, it is regarded as the primary bottleneck due to the presence of non-local interactions between several discontinuous regions in beta-sheets. To achieve reliable long-range interactions, a promising approach is to enumerate and rank all beta-sheet conformations for a given protein and find the one with the highest score. The problem with this solution is that the search space of the problem grows exponentially with respect to the number of beta-strands. Additionally, brute force calculation in this conformational space leads to dealing with a combinatorial explosion problem with intractable computational complexity. The main contribution of this paper is to generate and search the space of the problem efficiently to reduce the time complexity of the problem. To achieve this, two tree structures, called sheet-tree and grouping-tree, are proposed. They model the search space by breaking it into sub-problems. Then, an advanced dynamic programming is proposed that stores the intermediate results, avoids repetitive calculation by repeatedly uses them efficiently in successive steps and reduces the space of the problem by removing those intermediate results that will no longer be required in later steps. As a consequence, the following contributions have been made. Firstly, more accurate beta-sheet structures are found by searching all possible conformations, and secondly, the time complexity of the problem is reduced by searching the space of the problem efficiently which makes the proposed method applicable to predict beta-sheet structures with high number of beta-strands. Experimental results on the BetaSheet916 dataset showed significant improvements of the proposed method in both execution time and the prediction accuracy in comparison with the state-of-the-art beta-sheet structure prediction methods Moreover, we investigate the effect of different contact map predictors on the performance of the proposed method using BetaSheet1452 dataset. The source code is available at http://www.conceptsgate.com/BetaTop.rar. (C) 2017 Elsevier Ltd. All rights reserved.

Description

Sabzekar, Mostafa/0000-0002-6886-1240; Naghibzadeh, Mahmoud/0000-0001-5550-5565; Naghibzadeh, Mahmoud/0000-0001-5550-5565

Keywords

Beta-Sheet Structure Prediction, Dynamic Programming, Repetitive Calculation, Sheet-Tree, Grouping-Tree, Computational Biology, Algorithms, Protein Structure, Secondary

Turkish CoHE Thesis Center URL

Fields of Science

0301 basic medicine, 03 medical and health sciences, 0206 medical engineering, 02 engineering and technology

Citation

WoS Q

Q1

Scopus Q

Q3
OpenCitations Logo
OpenCitations Citation Count
9

Source

Computational Biology and Chemistry

Volume

70

Issue

Start Page

142

End Page

155
PlumX Metrics
Citations

CrossRef : 1

Scopus : 10

Captures

Mendeley Readers : 19

Google Scholar Logo
Google Scholar™
OpenAlex Logo
OpenAlex FWCI
0.40084413

Sustainable Development Goals