Abstract
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.
NSF Grant CCR-9820888.
NSF Grants CCR-9531028 and EIA-0112934.
Merck Genome Research Institute Grant and NSF Grant DEB-9806570.
NSF Grant CCR-9820888.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Atkins and W. E. Hart. On the intractability of protein folding with a finite alphabet of amino acids. Algorithmica, 25(2–3):279–294, 1999.
J. Banavar, M. Cieplak, A. Maritan, G. Nadig, F. Seno, and S. Vishveshwara. Structure-based design of model proteins. Proteins: Structure, Function, and Genetics, 31:10–20, 1998.
A. Bateman, E. Birney, R. Durbin, S. R. Eddy, K. L. Howe, and E. L. L. Sonnhammer. PFAM-A database of protein domain family alignments and HMMs. Nucleic Acids Research, 28:263–266, 2000.
F. Eisenhaber, P. Lijnzaad, P. Argos, C. Sander, and M. Scharf. The double cube lattice method: Efficient approaches to numerical integration of surface area and volume and to dot surface contouring of molecular assemblies. Journal of Computational Chemistry, 16(N3):273–284, 1995.
W. E. Hart. On the computational complexity of sequence design problems. In RECOMB, pages 128–136, 1997.
J. M. Kleinberg. Efficient algorithms for protein sequence design and the analysis of certain evolutionary fitness landscapes. In RECOMB, pages 226–237, 1999.
J.-C. Picard and M. Queyranne. On the structure of all minimum cuts in a network and applications. Mathematical Programming Study, (13):8–16, 1980.
C. Reidys, P. Stadler, and P. Schuster. Generic properties of combinatory maps: Neutral networks of RNA secondary structures. Bulletin of Mathematical Biology, 59:339–397, 1997.
S. J. Sun, R. Brem, H. S. Chan, and K. A. Dill. Designing amino acid sequences to fold with good hydrophobic cores. Protein Engineering, 8(12):1205–1213, Dec. 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aspnes, J., Hartling, J., Ming-Yang, K., Kim, J., Shah, G. (2001). A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive