Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
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 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 (24)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pennec, X.
Right arrow Articles by Ayache, N.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Pennec, X.
Right arrow Articles by Ayache, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics, Vol 14, 516-522, Copyright © 1998 by Oxford University Press

ARTICLES

A geometric algorithm to find small but highly similar 3D substructures in proteins

X Pennec and N Ayache
INRIA, BP 93, 2004 route des Lucioles, 06902 Sophia Antipolis Cedex, France. Xavier.Pennec@sophia.inria.fr

MOTIVATION: Most biological actions of proteins depend on some typical parts of their three-dimensional structure, called 3D motifs. It is desirable to find automatically common geometric substructures between proteins to discover similarities in new structures or to model precisely a particular motif. Most algorithms for structural comparison of proteins deal with large (fold) similarities. Here, we focus on small but precise similarities. RESULTS: We propose a new 3D substructure matching algorithm based on geometric hashing techniques. The key feature of the method is the introduction of a 3D reference frame attached to each residue. This allows us to reduce drastically the complexity of the recognition. Our experimental results confirm the validity of the approach and allow us to find smaller similarities than previous methods. AVAILABILITY: The program uses commercial libraries and thus cannot be completely freely distributed. It can be found at ftp://www.inria.fr in the directory epidaure/Outgoing/xpennec/Prospect, but it requires a key to be run, available by request to xavier.pennec@sophia.inria.fr CONTACT: Xavier.Pennec@sophia.inria.fr; Nicholas.Ayache@sophia.inria.fr
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
 Brief Funct Genomic ProteomicHome page
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]

Home page
 Nucleic Acids ResHome page
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]

Home page
 Nucleic Acids ResHome page
D. T.-H. Chang, C.-Y. Chen, W.-C. Chung, Y.-J. Oyang, H.-F. Juan, and H.-C. Huang
ProteMiner-SSM: a web server for efficient analysis of similar protein tertiary substructures
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W76 - W82.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
V. A. Ivanisenko, S. S. Pintus, D. A. Grigorovich, and N. A. Kolchanov
PDBSiteScan: a program for searching for active, binding and posttranslational modification sites in the 3D structures of proteins
Nucleic Acids Res., July 1, 2004; 32(suppl_2): W549 - W554.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
A. Smit and A. Mushegian
Biosynthesis of Isoprenoids via Mevalonate in Archaea: The Lost Pathway
Genome Res., October 1, 2000; 10(10): 1468 - 1484.
[Abstract] [Full Text]


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.