Pairwise protein structure alignment based on an orientation-independent backbone representation

Jieping Ye, Ravi Janardan, Songtao Liu

Research output: Contribution to journalArticle

11 Citations (Scopus)

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 and LOCK.

Original languageEnglish (US)
Pages (from-to)699-717
Number of pages19
JournalJournal of Bioinformatics and Computational Biology
Volume2
Issue number4
DOIs
StatePublished - Dec 2004
Externally publishedYes

Fingerprint

Proteins
Dynamic programming
Experiments

Keywords

  • Backbone representation
  • Dynamic programming
  • Optimization
  • Protein structure alignment

ASJC Scopus subject areas

  • Medicine(all)
  • Cell Biology

Cite this

Pairwise protein structure alignment based on an orientation-independent backbone representation. / Ye, Jieping; Janardan, Ravi; Liu, Songtao.

In: Journal of Bioinformatics and Computational Biology, Vol. 2, No. 4, 12.2004, p. 699-717.

Research output: Contribution to journalArticle

@article{313a13db5af444bda82891fffa3729e0,
title = "Pairwise protein structure alignment based on an orientation-independent backbone representation",
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 and LOCK.",
keywords = "Backbone representation, Dynamic programming, Optimization, Protein structure alignment",
author = "Jieping Ye and Ravi Janardan and Songtao Liu",
year = "2004",
month = "12",
doi = "10.1142/S021972000400082X",
language = "English (US)",
volume = "2",
pages = "699--717",
journal = "Journal of Bioinformatics and Computational Biology",
issn = "0219-7200",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Pairwise protein structure alignment based on an orientation-independent backbone representation

AU - Ye, Jieping

AU - Janardan, Ravi

AU - Liu, Songtao

PY - 2004/12

Y1 - 2004/12

N2 - 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.

AB - 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.

KW - Backbone representation

KW - Dynamic programming

KW - Optimization

KW - Protein structure alignment

UR - http://www.scopus.com/inward/record.url?scp=10944222215&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10944222215&partnerID=8YFLogxK

U2 - 10.1142/S021972000400082X

DO - 10.1142/S021972000400082X

M3 - Article

C2 - 15617162

AN - SCOPUS:10944222215

VL - 2

SP - 699

EP - 717

JO - Journal of Bioinformatics and Computational Biology

JF - Journal of Bioinformatics and Computational Biology

SN - 0219-7200

IS - 4

ER -