skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

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:
Research Org.:
Sandia National Labs., Albuquerque, NM (US); Sandia National Labs., Livermore, CA (US)
Sponsoring Org.:
US Department of Energy (US)
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
Country of Publication:
United States
Language:
English
Subject:
59 BASIC BIOLOGICAL SCIENCES; PROTEINS; PROTEIN STRUCTURE; ALGORITHMS; MOLECULAR STRUCTURE

Citation Formats

HART,WILLIAM E., and ISTRAIL,SORIN. Invariant patterns in crystal lattices: Implications for protein folding algorithms. United States: N. p., 2000. Web.
HART,WILLIAM E., & ISTRAIL,SORIN. Invariant patterns in crystal lattices: Implications for protein folding algorithms. United States.
HART,WILLIAM E., and ISTRAIL,SORIN. Thu . "Invariant patterns in crystal lattices: Implications for protein folding algorithms". United States. doi:. https://www.osti.gov/servlets/purl/756065.
@article{osti_756065,
title = {Invariant patterns in crystal lattices: Implications for protein folding algorithms},
author = {HART,WILLIAM E. and ISTRAIL,SORIN},
abstractNote = {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.},
doi = {},
journal = {Journal for Universal Computer Science},
number = ,
volume = ,
place = {United States},
year = {Thu Jun 01 00:00:00 EDT 2000},
month = {Thu Jun 01 00:00:00 EDT 2000}
}