Abstract
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 [12] and LOCK [19].
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the International Conference on Tools with Artificial Intelligence |
| Pages | 2-9 |
| Number of pages | 8 |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Proceedings: 15th IEEE International Conference on Tools with artificial Intelligence - Sacramento, CA, United States Duration: Nov 3 2003 → Nov 5 2003 |
Other
| Other | Proceedings: 15th IEEE International Conference on Tools with artificial Intelligence |
|---|---|
| Country | United States |
| City | Sacramento, CA |
| Period | 11/3/03 → 11/5/03 |
Keywords
- Dynamic programming
- Frobenius norm
- Rigid motion
- Root-mean squared deviation
- Singular value decomposition
- Structure alignment
ASJC Scopus subject areas
- Software
Fingerprint Dive into the research topics of 'Pairwise protein structure alignment based on an orientation-independent representation of the backbone geometry'. Together they form a unique fingerprint.
Cite this
Ye, J., Janardan, R., & Liu, S. (2003). Pairwise protein structure alignment based on an orientation-independent representation of the backbone geometry. In Proceedings of the International Conference on Tools with Artificial Intelligence (pp. 2-9)