You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: structure/alignment.md
+64-11Lines changed: 64 additions & 11 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,4 +1,4 @@
1
-
Structure Alignment
1
+
Structure Alignments
2
2
===========================
3
3
4
4
## What is a Structure Alignment?
@@ -227,9 +227,33 @@ interface.
227
227
228
228
## Multiple Structure Alignment
229
229
230
-
Since BioJava 4.1.0, multiple structure alignments can be generated.
230
+
This Java implementation for multiple structure alignments, named MultipleMC, is based on the original CE-MC implementation by [Guda C, Scheeff ED, Bourne PE & Shindyalov IN in 2001](http://psb.stanford.edu/psb-online/proceedings/psb01/abstracts/p275.html)
The idea remains unchanged: perform **all-to-all pairwise alignments** of the structures, choose the
234
+
**reference** as the most similar structure to all others and run a **Monte Carlo optimization** of
235
+
the multiple residue equivalencies (EQRs) to minimize a score function that depends on the inter-residue
236
+
distances.
237
+
238
+
Although the main idea is the same as in the original algorithm, some details of the implementation have
239
+
been changed in the BioJava version. They are described in the main class, but as a summary:
240
+
241
+
1. It accepts **any pairwise alignment** algorithm (instead of being attached to CE), so any
242
+
of the algorithms described before is suitable for generating a seed for optimization. Note that
243
+
this property allows *non-topological* and *flexible* multiple structure alignments, always restricted
244
+
by the pairwise alignment algorithm limitations.
245
+
2. The **moves** in the Monte Carlo optimization have been simplified to 3, instead of 4.
246
+
3. A **new move** to insert and delete individual gaps has been added.
247
+
4. The scoring function has been modified to a **continuous** function, maintaining the properties that the authors described.
248
+
5. The **probability function** is normalized in synchronization with the optimization progression, to improce the convergence into a score maximum after some random exploration of the multidimensiona space.
249
+
250
+
The algorithm performs similarly to other multiple structure alignment algorithms for most protein families.
251
+
The parameters both for the pairwise aligner and the MC optimization can have an impact on the final result. There is not a unique set of parameters, because they usually depend on the specific case. Thus, trying some parameter combinations, keeping in mind the effect they produce in the score function, is a good practice when doing structure alignments.
0 commit comments