On the computational complexity of sequence design problems
- Sandia National Labs., Albuquerque, NM (United States). Algorithms and Discrete Mathematics Dept.
Inverse protein folding concerns the identification of an amino acid sequence that folds to a given structure. Sequence design problems attempt to avoid the apparent difficulty of inverse protein folding by defining an energy that can be minimized to find protein-like sequences. The authors evaluate the practical relevance of two sequence design problems by analyzing their computation complexity. They show that the canonical method of sequence design is intractable, and describe approximation algorithms for this problem. The authors also describe an efficient algorithm that exactly solves the grand canonical method. The analysis shows how sequence design problems can fail to reduce the difficulty of the inverse protein folding problem, and highlights the need to analyze these problems to evaluate their practical relevance.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 425316
- Report Number(s):
- SAND--96-2161C; CONF-970137--1-Extd.Abst.; ON: DE96014496
- Country of Publication:
- United States
- Language:
- English
Similar Records
Native sequence determines sidechain packing in a protein, but does optimal sidechain packing determine the native sequence?
A method to identify protein sequences that fold into a known three-dimensional structure