skip to main content

Title: Invariant patterns in crystal lattices: Implications for protein folding algorithms

Crystal lattices are infinite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to define the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist invariants across lattices related to fundamental properties of the protein folding process. This paper considers whether performance-guaranteed approximability is such an invariant for HP lattice models. The authors define a master approximation algorithm that has provable performance guarantees provided that a specific sublattice exists within a given lattice. They describe a broad class of crystal lattices that are approximable, which further suggests that approximability is a general property of HP lattice models.
Authors:
;
Publication Date:
OSTI Identifier:
756065
Report Number(s):
SAND2000-1396J
TRN: AH200020%%40
DOE Contract Number:
AC04-94AL85000
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal for Universal Computer Science; Other Information: Submitted to Journal for Universal Computer Science; PBD: 1 Jun 2000
Research Org:
Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
Sponsoring Org:
US Department of Energy (US)
Country of Publication:
United States
Language:
English
Subject:
59 BASIC BIOLOGICAL SCIENCES; PROTEINS; PROTEIN STRUCTURE; ALGORITHMS; MOLECULAR STRUCTURE