Next Article in Journal
A Review of Closed-Loop Algorithms for Glycemic Control in the Treatment of Type 1 Diabetes
Next Article in Special Issue
Recent Advances in the Computational Discovery of Transcription Factor Binding Sites
Previous Article in Journal
Semi-empirical Algorithm for the Retrieval of Ecology-Relevant Water Constituents in Various Aquatic Environments
Previous Article in Special Issue
Structural Fingerprints of Transcription Factor Binding Site Regions
Article Menu

Export Article

Open AccessArticle
Algorithms 2009, 2(1), 498-517;

A Novel Algorithm for Macromolecular Epitope Matching

Department of Bioinformatics, Centre for Medical Biotechnology, University of Duisburg-Essen, Universit¨atsstrasse, 45117 Essen, Germany
Author to whom correspondence should be addressed.
Received: 27 October 2008 / Revised: 11 January 2009 / Accepted: 25 February 2009 / Published: 11 March 2009
(This article belongs to the Special Issue Algorithms and Molecular Sciences)
Full-Text   |   PDF [1685 KB, uploaded 11 March 2009]   |  


Many macromolecules, namely proteins, show functional substructures or epitopes defined by characteristic spatial arrangements of groups of specific atoms or residues. The identification of such substructures in a set of macromolecular 3D-structures solves an important problem in molecular biology as it allows the assignment of functions to molecular moieties and thus opens the possibility of a mechanistic understanding of molecular function. We have devised an algorithm that models a functional epitope formed by a group of atoms or residues as set of points in cartesian space with associated functional properties. The algorithm searches for similar epitopes in a database of structures by an efficient multistage comparison of distance sets in the epitope and in the structures from the database. The search results in a list of optimal matches and corresponding optimal superpositions of query epitope and matching epitopes from the database. The algorithm is discussed against the background of related approaches, and it is successfully tested in three application scenarios: global match of two homologous proteins, search for an epitope on a homologous protein, and finding matching epitopes in a protein database. View Full-Text
Keywords: molecular similarity; matching algorithms; epitopes; molecular sub-structures; maximum common subgraph molecular similarity; matching algorithms; epitopes; molecular sub-structures; maximum common subgraph

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Jakuschev, S.; Hoffmann, D. A Novel Algorithm for Macromolecular Epitope Matching. Algorithms 2009, 2, 498-517.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top