Determining structural similarities between proteins is an important problem since it can help identify functional and evolutionary relationships. In this paper, an algorithm is proposed to align two protein structures. Given the protein backbones, the algorithm finds a rigid motion of one backbone onto the other such that large substructures are matched. The algorithm uses a representation of the backbones that is independent of their relative orientations in space and applies dynamic programming to this representation to compute an initial alignment, which is then refined iteratively. Experiments indicate that the algorithm is competitive with two well-known algorithms, namely DALI and LOCK.
|Original language||English (US)|
|Number of pages||19|
|Journal||Journal of Bioinformatics and Computational Biology|
|State||Published - Dec 2004|
- Backbone representation
- Dynamic programming
- Protein structure alignment