Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Proteins: Structure, Function, and Genetics 22 (1995), S. 100-109 
    ISSN: 0887-3585
    Keywords: protein structure ; RNA structure ; lattice model ; chain connectivity ; self-avoiding ; dynamic programming ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Medicine
    Notes: An algorithm based on dynamic programming gives the lattice models having the minimal RMS deviations from the actual folds of protein (RNA, etc.) chains for a given lattice and a given orientation of the macromolecule relative to the lattice. The algorithm is applicable for 3-D lattices of any kind. The accuracy of the lattice approximation increases when the distance between neighbor chain links is not rigidly fixed. Special repulsive potentials facilitate generation of self-avoiding lattice chains. The results of model building show the efficiency and precisionof this proposed general method when compared with others. © 1995 Wiley-Liss, Inc.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    Proteins: Structure, Function, and Genetics 26 (1996), S. 1-8 
    ISSN: 0887-3585
    Keywords: lattice models of proteins ; self-consistent field optimization ; self-avoiding ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Medicine
    Notes: We present an algorithm to build self-avoiding lattice models of chain molecules with low RMS deviation from their actual 3D structures. To find the optimal coordinates for the lattice chain model, we minimize a function that consists of three terms: (1) the sum of squared deviations of link coordinates on a lattice from their off-lattice values, (2) the sum of “short-range” terms, penalizing violation of chain connectivity, and (3) the sum of “long-range” repulsive terms, penalizing chain self-intersections. We treat this function as a chain molecule “energy” and minimize it using self-consistent field (SCF) theory to represent the pairwise link repulsions as 3D fields acting on the links. The statistical mechanics of chain molecules enables computation of the chain distribution in this field on the lattice. The field is refined by iteration to become self-consistent with the chain distribution, then dynamic programming is used to find the optimal lattice model as the “lowest-energy” chain pathway in this SCF. We have tested the method on one of the coarsest (and most difficult) lattices used for model building on proteins of all structural types and show that the method is adequate for building self-avoiding models of proteins with low RMS deviations from the actual structures. © 1996 Wiley-Liss, Inc.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...