Related Experiment Video
Updated: Jun 29, 2026

A Protocol for Computer-Based Protein Structure and Function Prediction
Published on: November 3, 2011
Optimal nonlinear scoring function for global fitness landscape of protein design
Changyu Hu1, Xiang Li, Jie Liang
1Dept. of Bioeng., Illinois Univ., Chicago, IL, USA.
Abstract:
Protein design aims to identify sequences compatible with a given protein fold but incompatible to any alternative folds. To select the correct sequences and to guide the search process, a design scoring function is critically important. It is also important that a design scoring function can characterize the global fitness landscape of many proteins simultaneously. We describe how finding optimal design scoring functions can be understood from two geometric viewpoints, and propose a formulation using mixture of Gaussian kernel functions. We give results of distinguishing native sequences for a major portion of representative protein structures from a large number of alternative decoy sequences. We succeeded in deriving nonlinear scoring function that perfectly discriminate a set of 440 representative native proteins of known protein structures from 14 million sequence decoys. We show that no linear scoring function can have perfect discrimination. In an independent blind test using 194 unrelated proteins, our scoring function misclassifies only 13 native proteins. This compares favorably with 37 or 51 misclassifications when optimal linear functions reported in literature are used.
Related Concept Videos
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Protein-protein Interfaces
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Conservation of Protein Domains
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Lagrange Multipliers: Two Constraints

