Multi-resolution protein model

Cited 1 time in scopus
Metadata Downloads
Title
Multi-resolution protein model
Author(s)
D S Kim; B Lee; C I Won; D Kim; J Ryu; Y Cho; C M Kim; Sung Hoon Lee; Jong Bhak
Bibliographic Citation
Lecture Notes in Computer Science, vol. 4706, no. 2, pp. 639-652
Publication Year
2007
Abstract
The area of molecular biology opens new applications for the communities of computer graphics, geometric modeling and computational geometry. It has been a usual understanding that the structure of a molecule is one of the major factors determining the functions of the molecule and therefore the efforts to better understand the molecular structure have been made. It turns out that the analysis and the prediction of the spatial structure of a molecule usually takes a significant amount of computation even though the number of atoms involved in the molecule is relatively small. Examples are the protein-ligand docking, protein folding, etc. In many molecules, however, the number of atoms is quite large. The number of atoms in the system varies from hundreds to thousands of thousand. The problem size gets even larger by both incorporating more details of a model and expanding the scope of the model from a single protein to a whole cell. This trend will continue as the computational resource gets more powerful and therefore the computational requirement will always remain critical. In this paper, we propose a multi-resolution model for a protein (MRPM) to find a seemingly optimal trade-off between the computational requirement and the solution quality. There are two aspects of the proposal: The avoidance of computation and the delay of computation until it is really necessary.
Keyword
A proteinA Voronoi diagram of atomsDrug design
ISSN
0302-9743
Publisher
Springer Verlag (Germany)
DOI
http://dx.doi.org/10.1007/978-3-540-74477-1_59
Type
Article
Appears in Collections:
1. Journal Articles > Journal Articles
Files in This Item:
  • There are no files associated with this item.


Items in OpenAccess@KRIBB are protected by copyright, with all rights reserved, unless otherwise indicated.