ProbCons is an open source probabilistic consistency-based multiple alignment of amino acid sequences. It is one of the most efficient protein multiple sequence alignment programs, since it has repeatedly demonstrated a statistically significant advantage in accuracy over similar tools, including Clustal and MAFFT.[1] [2]
The following describes the basic outline of the ProbCons algorithm.[3]
For every pair of sequences compute the probability that letters
xi
yi
a*
\begin{align} P(xi\simyi|x,y)&\stackrel{def}{=}Pr[xi\simyiinsomea|x,y]\\ &=
\sum | |
alignmentawithxi-yi |
Pr[a|x,y]\\ &=\sumalignmenta1\{xi-yi\ina\}Pr[a|x,y] \end{align}
(Where
1\{xi\simyi\ina\}
xi
yi
The accuracy of an alignment
a*
a
Calculate expected accuracy of each sequence:
\begin{align} EPr[a|x,y](acc(a*,a))&=\sumaPr[a|x,y]acc(a*,a)\\ &=
1 | |
min(|x|,|y|) |
⋅ \suma1\{xi\simyi\ina\}Pr[a|x,y]\\ &=
1 | |
min(|x|,|y|) |
⋅
\sum | |
xi-yi |
P(xi\simyj|x,y) \end{align}
This yields a maximum expected accuracy (MEA) alignment:
E(x,y)=
\argmax | |
a* |
EPr[a|x,y](acc(a*,a))
All pairs of sequences x,y from the set of all sequences
l{S}
P'(xi-yi|x,y)=
1 | |
|l{S |
|}\sumz\sum1P(xi\simzi|x,z) ⋅ P(zi\simyi|z,y)
This step can be iterated.
Construct a guide tree by hierarchical clustering using MEA score as sequence similarity score. Cluster similarity is defined using weighted average over pairwise sequence similarity.
Finally compute the MSA using progressive alignment or iterative alignment.