| Revision as of 02:26, 2 April 2004 editBrona (talk | contribs)Extended confirmed users990 edits + See also sequence alignment← Previous edit | Revision as of 19:58, 11 May 2004 edit undoNaddy (talk | contribs)Extended confirmed users11,345 edits diacriticNext edit → | ||
| Line 21: | Line 21: | ||
| Dynamic programming can be used to find local regions of similarity which are then expanded. | Dynamic programming can be used to find local regions of similarity which are then expanded. | ||
| The Dali algorithm (named after ]) uses network isomorphism between the contact networks of two proteins to perform alignment. | The Dali algorithm (named after ]) uses network isomorphism between the contact networks of two proteins to perform alignment. | ||
| Sequence similarity between proteins can be used to optimize structural alignmens. | Sequence similarity between proteins can be used to optimize structural alignmens. | ||
Revision as of 19:58, 11 May 2004
 | This article's factual accuracy is disputed. Relevant discussion may be found on the talk page. Please help to ensure that disputed statements are reliably sourced. (Learn how and when to remove this message) |
So we should fix it (please do)!
Protein structural alignment (also known as structure superposition) is a powerful form of alignment.
Two protein domain structures (structural domains) can be aligned by superposing their 3D coordinates, with the aim of minimizing the root mean square deviation (RMSD) of the structural superposition (which is not quite the same as quantum superposition).
Many algorithms have been developed to optimize this complex task.
The task is complex because of the large number of degrees of freedom between two datasets of points in 3D (each protein molecule has six degrees of freedom, three translational and three rotational). This is just the simple case of 'rigid body' superposition.
Algorithms
Some approaches use quaternerions to reduce the dimensionality of the space without removing any information (isomorphic translation).
A major class of approaches is based on reducing the representation of the complex protein molecules into its secondary structure. Secondary structucture elements can be approximatly represented as vectors and aligned in pairs.
Dynamic programming can be used to find local regions of similarity which are then expanded.
The Dali algorithm (named after Salvador Dalí) uses network isomorphism between the contact networks of two proteins to perform alignment.
Sequence similarity between proteins can be used to optimize structural alignmens.
Geometric hashing is a good technique!
Packages
Many tools exist to perform structural alignment and multiple structural alignment.
- VMD
- SSM
- CE
- Dali
- Deep View
... And many many more!
For example see...
o ProSup The ProSup - structure comparison server. o MASS MULTIPLE Alignment by Secondary Structures
Uses
Structural alignment may be used to uncover distant homology between proteins, or to uncover the evolutionary protein domains.
It is a major tool in structural biology and (the related) structural genomics.