TY - JOUR

T1 - Ranking beta sheet topologies with applications to protein structure prediction

AU - Fonseca, Rasmus

AU - Helles, Glennie

AU - Winter, Pawel

PY - 2011

Y1 - 2011

N2 - One reason why ab initio protein structure predictors do not perform very well is their inability to reliably identify long-range interactions between amino acids. To achieve reliable long-range interactions, all potential pairings of ß-strands (ß-topologies) of a given protein are enumerated, including the native ß-topology. Two very different ß-topology scoring methods from the literature are then used to rank all potential ß-topologies. This has not previously been attempted for any scoring method. The main result of this paper is a justification that one of the scoring methods, in particular, consistently top-ranks native ß-topologies. Since the number of potential ß-topologies grows exponentially with the number of ß-strands, it is unrealistic to expect that all potential ß-topologies can be enumerated for large proteins. The second result of this paper is an enumeration scheme of a subset of ß-topologies. It is shown that native-consistent ß-topologies often are among the top-ranked ß-topologies of this subset. The presence of the native or native-consistent ß-topologies in the subset of enumerated potential ß-topologies relies heavily on the correct identification of ß-strands. The third contribution of this paper is a method to deal with the inaccuracies of secondary structure predictors when enumerating potential ß-topologies. The results reported in this paper are highly relevant for ab initio protein structure prediction methods based on decoy generation. They indicate that decoy generation can be heavily constrained using top-ranked ß-topologies as they are very likely to contain native or native-consistent ß-topologies.

AB - One reason why ab initio protein structure predictors do not perform very well is their inability to reliably identify long-range interactions between amino acids. To achieve reliable long-range interactions, all potential pairings of ß-strands (ß-topologies) of a given protein are enumerated, including the native ß-topology. Two very different ß-topology scoring methods from the literature are then used to rank all potential ß-topologies. This has not previously been attempted for any scoring method. The main result of this paper is a justification that one of the scoring methods, in particular, consistently top-ranks native ß-topologies. Since the number of potential ß-topologies grows exponentially with the number of ß-strands, it is unrealistic to expect that all potential ß-topologies can be enumerated for large proteins. The second result of this paper is an enumeration scheme of a subset of ß-topologies. It is shown that native-consistent ß-topologies often are among the top-ranked ß-topologies of this subset. The presence of the native or native-consistent ß-topologies in the subset of enumerated potential ß-topologies relies heavily on the correct identification of ß-strands. The third contribution of this paper is a method to deal with the inaccuracies of secondary structure predictors when enumerating potential ß-topologies. The results reported in this paper are highly relevant for ab initio protein structure prediction methods based on decoy generation. They indicate that decoy generation can be heavily constrained using top-ranked ß-topologies as they are very likely to contain native or native-consistent ß-topologies.

U2 - 10.1007/s10852-011-9162-4

DO - 10.1007/s10852-011-9162-4

M3 - Journal article

VL - 10

SP - 357

EP - 369

JO - Journal of Mathematical Modelling and Algorithms in Operations Research

JF - Journal of Mathematical Modelling and Algorithms in Operations Research

SN - 2214-2487

IS - 4

ER -