A deterministic optimization approach to protein sequence design using continuous models

Koh, Sung K. ; Ananthasuresh, G. K. ; Vishveshwara, Saraswathi (2005) A deterministic optimization approach to protein sequence design using continuous models The International Journal of Robotics Research, 24 (2-3). pp. 109-130. ISSN 0278-3649

Full text not available from this repository.

Official URL: http://ijr.sagepub.com/content/24/2-3/109.short

Related URL: http://dx.doi.org/10.1177/0278364905050354


Determining the sequence of amino acid residues in a heteropolymer chain of a protein with a given conformation is a discrete combinatorial problem that is not generally amenable for gradient-based continuous optimization algorithms. In this paper we present a new approach to this problem using continuous models. In this modeling, continuous "state functions" are proposed to designate the type of each residue in the chain. Such a continuous model helps define a continuous sequence space in which a chosen criterion is optimized to find the most appropriate sequence. Searching a continuous sequence space using a deterministic optimization algorithm makes it possible to find the optimal sequences with much less computation than many other approaches. The computational efficiency of this method is further improved by combining it with a graph spectral method, which explicitly takes into account the topology of the desired conformation and also helps make the combined method more robust. The continuous modeling used here appears to have additional advantages in mimicking the folding pathways and in creating the energy landscapes that help find sequences with high stability and kinetic accessibility. To illustrate the new approach, a widely used simplifying assumption is made by considering only two types of residues: hydrophobic (H) and polar (P). Self-avoiding compact lattice models are used to validate the method with known results in the literature and data that can be practically obtained by exhaustive enumeration on a desktop computer. We also present examples of sequence design for the HP models of some real proteins, which are solved in less than five minutes on a single-processor desktop computer. Some open issues and future extensions are noted.

Item Type:Article
Source:Copyright of this article belongs to Sage Publications.
Keywords:Protein Sequence Design; Deterministic Optimization; Inverse Folding; Lattice Models; Graph Spectral Method
ID Code:57067
Deposited On:26 Aug 2011 02:43
Last Modified:26 Aug 2011 02:43

Repository Staff Only: item control page