ProteMiner-SSM: a web server for efficient analysis of similar protein tertiary substructures
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC, 1 Institute of Biotechnology and Department of Chemical Engineering, National Taipei University of Technology, Taipei, Taiwan, ROC and 2 Institute of Biological Chemistry, Academia Sinica, Taipei, Taiwan, ROC
* To whom correspondence should be addressed. Tel: +886 2 23625336 #431 Fax: +886 2 23688675; Email: yjoyang{at}csie.ntu.edu.tw
Correspondence may also be addressed to Chien-Yu Chen. Email: cychen{at}mars.csie.ntu.edu.tw
Present address: Chien-Yu Chen, Graduate School of Biotechnology and Bioinformatics, Yuan-Ze University, Chung-Li, Taiwan
Received February 15, 2004; Revised April 1, 2004; Accepted April 12, 2004
Analysis of proteinligand interactions is a fundamental issue in drug design. As the detailed and accurate analysis of proteinligand interactions involves calculation of binding free energy based on thermodynamics and even quantum mechanics, which is highly expensive in terms of computing time, conformational and structural analysis of proteins and ligands has been widely employed as a screening process in computer-aided drug design. In this paper, a web server called ProteMiner-SSM designed for efficient analysis of similar protein tertiary substructures is presented. In one experiment reported in this paper, the web server has been exploited to obtain some clues about a biochemical hypothesis. The main distinction in the software design of the web server is the filtering process incorporated to expedite the analysis. The filtering process extracts the residues located in the caves of the protein tertiary structure for analysis and operates with O(nlogn) time complexity, where n is the number of residues in the protein. In comparison, the
-hull algorithm, which is a widely used algorithm in computer graphics for identifying those instances that are on the contour of a three-dimensional object, features O(n2) time complexity. Experimental results show that the filtering process presented in this paper is able to speed up the analysis by a factor ranging from 3.15 to 9.37 times. The ProteMiner-SSM web server can be found at http://proteminer.csie.ntu.edu.tw/. There is a mirror site at http://p4.sbl.bc.sinica.edu.tw/proteminer/.
The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
P. F. Gherardini and M. Helmer-Citterich Structure-based function prediction: approaches and applications Brief Funct Genomic Proteomic, July 3, 2008; (2008) eln030v1. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. S. C. Shih, R.-c. R. Gan, and M.-J. Hwang OPAAS: a web server for optimal, permuted, and other alternative alignments of protein structures. Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W95 - W98. [Abstract] [Full Text] [PDF] |
||||
![]() |
D. T.-H. Chang, Y.-Z. Weng, J.-H. Lin, M.-J. Hwang, and Y.-J. Oyang Protemot: prediction of protein binding sites with automatically extracted geometrical templates. Nucleic Acids Res., July 1, 2006; 34(Web Server issue): W303 - W309. [Abstract] [Full Text] [PDF] |
||||
![]() |
D. T.-H. Chang, Y.-J. Oyang, and J.-H. Lin MEDock: a web server for efficient prediction of ligand binding sites based on a novel optimization algorithm Nucleic Acids Res., July 1, 2005; 33(suppl_2): W233 - W238. [Abstract] [Full Text] [PDF] |
||||

