Protein threading by linear programming

Xu J, Li M, Lin G, Kim D, Xu Y

Department of Computer Science, University of Waterloo, Waterloo, Ont. N2L SG1, Canada. j3xu@math.uwaterloo.ca

Pac Symp Biocomput. 2003;:264-75.


Abstract

Protein three-dimensional structure prediction through threading approach has been extensively studied and various models and algorithms have been proposed. In order to further explore ways to improve accuracy and efficiency of the threading process, this paper investigates the effectiveness of a new method: protein threading via linear programming. Based on the contact map model of protein 3D structure, we formulate the protein threading problem as a large scale integer programming problem, then relax to a linear programming problem, and finally solve the integer program by a branch-and-bound method. The final solution is optimal with respect to energy functions incorporating pairwise interaction and allowing variable gaps. The algorithm has been implemented as software package RAPTOR--RApid Protein Threading predictOR. Experimental results for fold recognition show that RAPTOR significantly outperforms other programs at the fold similarity level. The RAPTOR webserver is at http://www.cs.uwaterloo.ca/-j3xu/RAPTOR_form.htm.


[Full-Text PDF] [PSB Home Page]