Skip to content
naulon

Not checkedNot checked for notices yet.

A global optimization algorithm for protein surface alignment

Guerra Concettina, Bertolazzi Paola, Liuzzi Giampaolo

BMC Bioinformatics · 2010

doi:10.1186/1471-2105-11-488 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

<p>Abstract</p> <p>Background</p> <p>A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined with physico-chemical properties of the site since the conformation, size and chemical composition of the protein surface are all relevant for the interaction with a specific ligand. Several matching strategies have been designed for the recognition of protein-ligand binding sites and of protein-protein interfaces but the problem cannot be considered solved.</p> <p>Results</p> <p>In this paper we propose a new method for local structural alignment of protein surfaces based on continuous global optimization techniques. Given the three-dimensional structures of two proteins, the method finds the isometric transformation (rotation plus translation) that best superimposes active regions of two structures. We draw our inspiration from the well-known Iterative Closest Point (ICP) method for three-dimensional (3D) shapes registration. Our main contribution is in the adoption of a controlled random search as a more efficient global optimization approach along with a new dissimilarity measure. The reported computational experience and comparison show viability of the proposed approach.</p> <p>Conclusions</p> <p>Our method performs well to detect similarity in binding sites when this in fact exists. In the future we plan to do a more comprehensive evaluation of the method by considering large datasets of non-redundant proteins and applying a clustering technique to the results of all comparisons to classify binding sites.</p>

Abstract licence: CC BY-NC-ND

References45

    40 more references, whose wording the paper’s licence keeps private.

    All 45 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.