A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model

In modern biology, one of the most important research problems is to understand how protein sequences fold into their native 3D structures. To investigate this problem at a high level, one wishes to analyze the protein landscapes, i.e., the structures of the space of all protein sequences and their native 3D structures. Perhaps the most basic computational problem at this level is to take a target 3D structure as input and design a fittest protein sequence with respect to one or more fitness functions of the target 3D structure. We develop a toolbox of combinatorial techniques for protein landscape analysis in the Grand Canonical model of Sun, Brem, Chan, and Dill. The toolbox is based on linear programming, network flow, and a linear-size representation of all minimum cuts of a network. It not only substantially expands the network flow technique for protein sequence design in Kleinberg's seminal work but also is applicable to a considerably broader collection of computational problems than those considered by Kleinberg. We have used this toolbox to obtain a number of efficient algorithms and hardness results. We have further used the algorithms to analyze 3D structures drawn from the Protein Data Bank and have discovered some novel relationships between such native 3D structures and the Grand Canonical model.

[1]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[2]  Drexler Ke,et al.  Molecular engineering: An approach to the development of general capabilities for molecular manipulation. , 1981 .

[3]  Mihalis Yannakakis,et al.  On the Complexity of Protein Folding , 1998, J. Comput. Biol..

[4]  K. Dill,et al.  A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .

[5]  A. Maritan,et al.  Design of proteins with hydrophobic and polar amino acids , 1997, Proteins.

[6]  K. Dill,et al.  Inverse protein folding problem: designing polymer sequences. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Deutsch,et al.  New algorithm for protein design. , 1995, Physical review letters.

[8]  E. Shakhnovich,et al.  A new approach to the design of stable proteins. , 1993, Protein engineering.

[9]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[10]  Flavio Seno,et al.  Structure‐based design of model proteins , 1998, Proteins.

[11]  William E. Hart,et al.  On the Intractability of Protein Folding with a Finite Alphabet of Amino Acids , 1999, Algorithmica.

[12]  John Maynard Smith,et al.  Natural Selection and the Concept of a Protein Space , 1970, Nature.

[13]  P. Schuster,et al.  Generic properties of combinatory maps: neutral networks of RNA secondary structures. , 1997, Bulletin of mathematical biology.

[14]  K. Dill,et al.  Theory for protein mutability and biogenesis. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[15]  M. Kimura,et al.  The neutral theory of molecular evolution. , 1983, Scientific American.

[16]  J. Ponder,et al.  Tertiary templates for proteins. Use of packing criteria in the enumeration of allowed sequences for different structural classes. , 1987, Journal of molecular biology.

[17]  K. Dill,et al.  Designing amino acid sequences to fold with good hydrophobic cores. , 1995, Protein engineering.

[18]  D. Yee,et al.  Principles of protein folding — A perspective from simple exact models , 1995, Protein science : a publication of the Protein Society.

[19]  William E. Hart.  On the computational complexity of sequence design problems , 1997, RECOMB '97.

[20]  Frank Eisenhaber,et al.  Improved strategy in analytic surface calculation for molecular systems: Handling of singularities and computational efficiency , 1993, J. Comput. Chem..

[21]  Chris Sander,et al.  The double cubic lattice method: Efficient approaches to numerical integration of surface area and volume and to dot surface contouring of molecular assemblies , 1995, J. Comput. Chem..

[22]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[23]  Harold N. Gabow,et al.  Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  George Steiner,et al.  An algorithm to generate the ideals of a partial order , 1986 .

[26]  Mihalis Yannakakis,et al.  Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) , 1992, ICALP.

[27]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[28]  P. Stadler,et al.  Neutral networks in protein space: a computational study based on knowledge-based potentials of mean force. , 1997, Folding & design.

[29]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..