Sequence design in lattice models by graph theoretical methods

Citation
Bs. Sanjeev et al., Sequence design in lattice models by graph theoretical methods, J CHEM PHYS, 114(4), 2001, pp. 1906-1914
Citations number
43
Categorie Soggetti
Physical Chemistry/Chemical Physics
Journal title
JOURNAL OF CHEMICAL PHYSICS
ISSN journal
00219606 → ACNP
Volume
114
Issue
4
Year of publication
2001
Pages
1906 - 1914
Database
ISI
SICI code
0021-9606(20010122)114:4<1906:SDILMB>2.0.ZU;2-B
Abstract
A general strategy has been developed based on graph theoretical methods, f or finding amino acid sequences that take up a desired conformation as the native state. This problem of inverse design has been addressed by assignin g topological indices for the monomer sites (vertices) of the polymer on a 3x3x3 cubic lattice. This is a simple design strategy, which takes into acc ount only the topology of the target protein and identifies the best sequen ce for a given composition. The procedure allows the design of a good seque nce for a target native state by assigning weights for the vertices on a la ttice site in a given conformation. It is seen across a variety of conforma tions that the predicted sequences perform well both in sequence and in con formation space, in identifying the target conformation as native state for a fixed composition of amino acids. Although the method is tested in the f ramework of the HP model [K. F. Lau and K. A. Dill, Macromolecules 22, 3986 (1989)] it can be used in any context if proper potential functions are av ailable, since the procedure derives unique weights for all the sites (vert ices, nodes) of the polymer chain of a chosen conformation (graph). (C) 200 1 American Institute of Physics.