Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
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 ISI Web of Science
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 arrow Search for citing articles in:
ISI Web of Science (11)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pintar, A.
Right arrow Articles by Pongor, S.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pintar, A.
Right arrow Articles by Pongor, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 2 2003
Pages 313-314
© 2003 Oxford University Press


Applications Note

DPX: for the analysis of the protein core

Alessandro Pintar 1,*, Oliviero Carugo 1,2 and Sándor Pongor 1

1 Protein Structure and Bioinformatics Group, International Center for Genetic Engineering and Biotechnology (ICGEB), AREA Science Park, Padriciano 99, 34012 Trieste
2 Department of General Chemistry, University of Pavia, Viale Taramelli 12, 27100 Pavia, Italy

Received on May 23, 2002 ; revised on July 22, 2002 ; accepted on September 13, 2002

Summary: In order to obtain an accurate description of the protein interior, we describe a simple and fast algorithm that measures the depth of each atom in a protein (dpx), defined as its distance (Å) from the closest solvent accessible atom. The program reads a PDB file containing the atomic solvent accessibility in the B-factor field, and writes a file in the same format, where the B-factor field now contains the dpx value. Output structure files can be thus directly displayed with molecular graphics programs like RASMOL, MOLMOL, Swiss-PDB View and colored according to dpx values.

Availability: The algorithm is implemented in a standalone program written in C and its source is freely available at ftp.icgeb.trieste.it/pub/DPX or on request from the authors.

Contact: pintar{at}icgeb.org; carugo{at}icgeb.org; pongor{at}icgeb.org

* To whom correspondence should be addressed.


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
BioinformaticsHome page
M. Stout, J. Bacardit, J. D. Hirst, and N. Krasnogor
Prediction of recursive convex hull class assignments for protein residues
Bioinformatics, April 1, 2008; 24(7): 916 - 923.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
B. Bennett, P. Langan, L. Coates, M. Mustyakimov, B. Schoenborn, E. E. Howell, and C. Dealwis
Neutron diffraction studies of Escherichia coli dihydrofolate reductase complexed with methotrexate
PNAS, December 5, 2006; 103(49): 18493 - 18498.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
K. Vlahovicek, A. Pintar, L. Parthasarathi, O. Carugo, and S. Pongor
CX, DPX and PRIDE: WWW servers for the analysis and comparison of protein 3D structures
Nucleic Acids Res., July 1, 2005; 33(suppl_2): W252 - W254.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
D. Varrazzo, A. Bernini, O. Spiga, A. Ciutti, S. Chiellini, V. Venditti, L. Bracci, and N. Niccolai
Three-dimensional computation of atom depth in complex molecular structures
Bioinformatics, June 15, 2005; 21(12): 2856 - 2860.
[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.