Bioinformatics Advance Access originally published online on September 4, 2009
Bioinformatics 2009 25(21):2751-2756; doi:10.1093/bioinformatics/btp530
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Algorithms for optimal protein structure alignment
Department of Computer Science, University of Northern Iowa, Cedar Falls, IA 50614, USA
 |
Abstract |
|---|
Motivation: Structural alignment is an important tool for understanding the evolutionary relationships between proteins. However, finding the best pairwise structural alignment is difficult, due to the infinite number of possible superpositions of two structures. Unlike the sequence alignment problem, which has a polynomial time solution, the structural alignment problem has not been even classified as solvable.
Results: We study one of the most widely used measures of protein structural similarity, defined as the number of pairs of residues in two proteins that can be superimposed under a predefined distance cutoff. We prove that, for any two proteins, this measure can be optimized for all but finitely many distance cutoffs. Our method leads to a series of algorithms for optimizing other structure similarity measures, including the measures commonly used in protein structure prediction experiments. We also present a polynomial time algorithm for finding a near-optimal superposition of two proteins. Aside from having a relatively low cost, the algorithm for near-optimal solution returns a superposition of provable quality. In other words, the difference between the score of the returned superposition and the score of an optimal superposition can be explicitly computed and used to determine whether the returned superposition is, in fact, the best superposition.
Contact: poleksic{at}cs.uni.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
Associate Editor: Anna Tramontano
Received on May 19, 2009; revised on August 14, 2009; accepted on September 1, 2009
CiteULike 
Connotea 
Del.icio.us What's this?