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 (53)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Barker, J. A.
Right arrow Articles by Thornton, J. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Barker, J. A.
Right arrow Articles by Thornton, J. M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 no. 13 2003
Pages 1644-1649
© 2003 Oxford University Press

An algorithm for constraint-based structural template matching: application to 3D templates with statistical analysis

Jonathan A. Barker *,{dagger} and Janet M. Thornton

European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, UK

Received on February 5, 2003 ; revised on March 28, 2003 ; accepted on April 1, 2003

Motivation: Structural templates consisting of a few atoms in a specific geometric conformation provide a powerful tool for studying the relationship between protein structure and function. Current methods for template searching constrain template syntax and semantics by their design. Hence there is a need for a more flexible core algorithm upon which to build more sophisticated tools. Statistical analysis of structural similarity is still in its infancy when compared with its analogue in sequence alignment. In the context of template matching, there is an urgent need for normalization of scores so that results from templates with differing sensitivity may be compared directly.

Results: We introduce Jess, a fast and flexible algorithm for searching protein structures for small groups of atoms under arbitrary constraints on geometry and chemistry. We apply the algorithm to a set of manually derived enzyme active site templates, and derive an empirical measure for estimating the relative significance of hits encountered using differing templates.

Availability: Jess will be available in the near future under a restricted open source licence.

Contact: jbarker{at}ebi.ac.uk

* To whom correspondence should be addressed.

{dagger} Supported by a MRC Training Fellowship in Bioinformatics.


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
Proc. Natl. Acad. Sci. USAHome page
D. Petrey, M. Fischer, and B. Honig
Structural relationships among proteins with different global topologies and their implications for function annotation strategies
PNAS, October 13, 2009; 106(41): 17377 - 17382.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
L. Xie, L. Xie, and P. E. Bourne
A unified statistical model to support local sequence order independent similarity searching for ligand-binding sites and its application to genome-based drug discovery
Bioinformatics, June 15, 2009; 25(12): i305 - i312.
[Abstract] [Full Text] [PDF]


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
Proc. Natl. Acad. Sci. USAHome page
L. Xie and P. E. Bourne
Detecting evolutionary relationships across existing fold space, using sequence order-independent profile-profile alignments
PNAS, April 8, 2008; 105(14): 5441 - 5446.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
I. A. Gariev and S. D. Varfolomeev
Hierarchical classification of hydrolases catalytic sites
Bioinformatics, October 15, 2006; 22(20): 2574 - 2576.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
B. J. Polacco and P. C. Babbitt
Automated discovery of 3D motifs for protein function annotation
Bioinformatics, March 15, 2006; 22(6): 723 - 730.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
M. Jambon, O. Andrieu, C. Combet, G. Deleage, F. Delfaud, and C. Geourjon
The SuMo server: 3D search for protein functional sites
Bioinformatics, October 15, 2005; 21(20): 3929 - 3930.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
R. A. Laskowski, J. D. Watson, and J. M. Thornton
ProFunc: a server for predicting protein function from 3D structure
Nucleic Acids Res., July 1, 2005; 33(suppl_2): W89 - W93.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Shulman-Peleg, R. Nussinov, and H. J. Wolfson
SiteEngines: recognition and comparison of binding sites and protein-protein interfaces
Nucleic Acids Res., July 1, 2005; 33(suppl_2): W337 - W341.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
K. Wang and R. Samudrala
FSSA: a novel method for identifying functional signatures from structural alignments
Bioinformatics, July 1, 2005; 21(13): 2969 - 2977.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
C. T. Porter, G. J. Bartlett, and J. M. Thornton
The Catalytic Site Atlas: a resource of catalytic sites and residues identified in enzymes using structural data
Nucleic Acids Res., January 1, 2004; 32(90001): D129 - 133.
[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.