Skip Navigation



Bioinformatics Advance Access published online on April 12, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti444
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/12/2856    most recent
bti444v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Varrazzo, D.
Right arrow Articles by Niccolai, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Varrazzo, D.
Right arrow Articles by Niccolai, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org
Received February 9, 2005
Revised March 30, 2005
Accepted April 7, 2005

Article

Three-dimensional computation of atom depth in complex molecular structures

Daniele Varrazzo 1, Andrea Bernini 2, Ottavia Spiga 2, Arianna Ciutti 3, Stefano Chiellini 3, Vincenzo Venditti 1, Luisa Bracci 1, and Neri Niccolai 2*

1 Biomolecular Structure Research Center and Department of Molecular Biology, Università di Siena, I-53100 Siena, Italy
2 Biomolecular Structure Research Center and Department of Molecular Biology, Università di Siena, I-53100 Siena, Italy; SienaBioGrafix Srl, I-53100 Siena, Italy
3 SienaBioGrafix Srl, I-53100 Siena, Italy

* To whom correspondence should be addressed.
Neri Niccolai, E-mail: niccolai{at}unisi.it


  Abstract

Motivation: For a complex molecular system the delineation of atom-atom contacts, exposed surface and binding sites represents a fundamental step to predict its interaction with solvent, ligands and other molecules. Recently, atom depth has been also considered as an additional structural descriptor to correlate protein structure with folding and functional properties. The distance between an atom and the nearest water molecule or the closest surface dot has been proposed as a measure of the atom depth, but, in both cases, the three-dimensional character of depth is largely lost. To calculate atom depths in a way that the molecular shape can be taken into account, a new approach is here proposed.

Results: An algorithm has been developed to calculate intersections between the molecular volume and spheres centered on the atoms whose depth has to be quantified. Many proteins with different size and shape have been chosen to compare the results obtained from distance-based and volume-based depth calculations. From the wealth of experimental data available for hen egg white lysozyme, H/D exchange rates and TEMPOL induced paramagnetic perturbations have been analyzed both in terms of depth indexes and of atom distances to the solvent accessible surface. The algorithm here proposed yields better correlations between experimental data and atom depth, particularly for those atoms which are located near to the protein surface.

Availability: Instructions to obtain source code and the executable program are available either from http://sienabiografix.com or http://sadic.sourceforge.net.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
V. Venditti, N. Niccolai, and S. E. Butcher
Measuring the dynamic surface accessibility of RNA with the small paramagnetic molecule TEMPOL
Nucleic Acids Res., March 27, 2008; 36(4): e20 - e20.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.