|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM21599471X |
| 003 |
DE-627 |
| 005 |
20231224030734.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2012 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1002/jcc.22956
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0720.xml
|
| 035 |
|
|
|a (DE-627)NLM21599471X
|
| 035 |
|
|
|a (NLM)22396194
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Kim, Deok-Soo
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Beta-decomposition for the volume and area of the union of three-dimensional balls and their offsets
|
| 264 |
|
1 |
|c 2012
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 22.12.2015
|
| 500 |
|
|
|a Date Revised 01.05.2015
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Copyright © 2011 Wiley Periodicals, Inc.
|
| 520 |
|
|
|a Given a set of spherical balls, called atoms, in three-dimensional space, its mass properties such as the volume and the boundary area of the union of the atoms are important for many disciplines, particularly for computational chemistry/biology and structural molecular biology. Despite many previous studies, this seemingly easy problem of computing mass properties has not been well-solved. If the mass properties of the union of the offset of the atoms are to be computed as well, the problem gets even harder. In this article, we propose algorithms that compute the mass properties of both the union of atoms and their offsets both correctly and efficiently. The proposed algorithms employ an approach, called the Beta-decomposition, based on the recent theory of the beta-complex. Given the beta-complex of an atom set, these algorithms decompose the target mass property into a set of primitives using the simplexes of the beta-complex. Then, the molecular mass property is computed by appropriately summing up the mass property corresponding to each simplex. The time complexity of the proposed algorithm is O(m) in the worst case where m is the number of simplexes in the beta-complex that can be efficiently computed from the Voronoi diagram of the atoms. It is known in ℝ(3) that m = O(n) on average for biomolecules and m = O(n(2)) in the worst case for general spheres where n is the number of atoms. The theory is first introduced in ℝ(2) and extended to ℝ(3). The proposed algorithms were implemented into the software BetaMass and thoroughly tested using molecular structures available in the Protein Data Bank. BetaMass is freely available at the Voronoi Diagram Research Center web site
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Lee‐Richards (accessible) surface
|
| 650 |
|
4 |
|a Voronoi diagram of spheres
|
| 650 |
|
4 |
|a accessible area
|
| 650 |
|
4 |
|a accessible volume
|
| 650 |
|
4 |
|a beta‐complex
|
| 650 |
|
4 |
|a beta‐shape
|
| 650 |
|
4 |
|a molecular area
|
| 650 |
|
4 |
|a molecular surface
|
| 650 |
|
4 |
|a molecular volume
|
| 650 |
|
4 |
|a offset surface
|
| 650 |
|
4 |
|a offset‐area
|
| 650 |
|
4 |
|a offset‐volume
|
| 650 |
|
4 |
|a quasi‐triangulation
|
| 650 |
|
4 |
|a solvent accessible surface
|
| 650 |
|
4 |
|a van der Waals area
|
| 650 |
|
4 |
|a van der Waals volume
|
| 700 |
1 |
|
|a Ryu, Joonghyun
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shin, Hayong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cho, Youngsong
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t Journal of computational chemistry
|d 1984
|g 33(2012), 13 vom: 15. Mai, Seite 1252-73
|w (DE-627)NLM098138448
|x 1096-987X
|7 nnns
|
| 773 |
1 |
8 |
|g volume:33
|g year:2012
|g number:13
|g day:15
|g month:05
|g pages:1252-73
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1002/jcc.22956
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 33
|j 2012
|e 13
|b 15
|c 05
|h 1252-73
|