Structural Alignment problem has received immense attention in the
past few decades especially with the increasing number of teritary
structures in Protein Data Bank (PDB) [1] The problem of
Structural Alignment asks to find a similar substructure
between the two proteins
and
. The number of protein structures have drastically increased from 10,000 in year 1999
to 45,000 in year 2007. This makes the manual structural alignment
almost impossible, we need algorithms which can give almost similar
accuracy as manual alignment and are fast enough.
Almost all of the existing algorithms do the structural alignment based on the backbone
of the protein, for any two given proteins these algorithms [3]
[9][7][10][8]
try to find the correspondence between the
atoms on the backbone
along with the transformation matricies
(Rotational) and
(Translational)
which when applied will transform the other protein and will minimize the
inter-atomic distance between the corresponding
atoms. Although just
considering the backbone of the protein is a fair approximation of the complex
3-D structure, but still this approximation is not that accurate in classifying
the proteins in Folds,Classes and Super Families[2][4]
and we feel that the conformations of side-chains should be considered during the
structural alginment. Another major fact is that all these algorithms only consider
the global structural alignment between the two protein structures
and
rather than the local alignment, biologists often look for structural motifs which
occur very often in the proteins, local structural alignment can be very effective in such
situations rather than global structural alignment.
In this paper we try to address the preceeding drawbacks in the existing structural alignment algorithms. Our algorithms address the following issues