By Topic

A branch-and-bound algorithm for optimal protein threading with pairwise (contact potential) amino acid interactions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lathrop, R.H. ; Artificial Intelligence Lab., MIT, Cambridge, MA, USA ; Smith, T.F.

Presents a new branch-and-bound method of searching the space of possible "threadings" for the optimal match of a sequence to an adjacency matrix of environments in the "motif threading" version of the "inverse protein folding problem." The method is guaranteed to find the optimal threading first, and thereafter will enumerate successive candidate threadings in order of decreasing optimality. We require minimal conditions on how environments are defined and the form of the score function, and the search method is sufficiently general to be used with many different score functions which model contact potentials or other interactions between explicit pairs of amino acids. This algorithm has been used in conjunction with a pairwise interaction score function to identify the optimal threading out of as many as 1.69/spl times/10/sup 24/ possibilities on a Sun Sparcstation IPC workstation in 40 minutes total elapsed time.<>

Published in:

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on  (Volume:5 )

Date of Conference:

4-7 Jan. 1994