Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms

dc.creatorHart,William
dc.creatorIstrail,Sorin
dc.date2000
dc.date.accessioned2024-02-06T12:50:35Z
dc.date.available2024-02-06T12:50:35Z
dc.descriptionCrystal 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. We define a master approximation algorithm that has provable performance guarantees provided that a specific sublattice exists within a given lattice. We describe a broad class of crystal lattices that are approximable, which further suggests that approximability is a general property of HP lattice models. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-006-06-0560
dc.identifierhttps://lib.jucs.org/article/27683/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/7769
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 6(6): 560-579
dc.subjectProtein folding
dc.subjectlattice models
dc.subjectHP model
dc.subjectapproximation algorithm
dc.titleInvariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms
dc.typeResearch Article
Файлы
Коллекции