ProbCons

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]

Algorithm[edit]

The following describes the basic outline of the ProbCons algorithm.^[3]

Step 1: Reliability of an alignment edge[edit]

For every pair of sequences compute the probability that letters ${\displaystyle x_{i}}$ and ${\displaystyle y_{i}}$ are paired in ${\displaystyle a^{*}}$ an alignment that is generated by the model.

${\displaystyle {\begin{aligned}P(x_{i}\sim y_{i}|x,y)&{\stackrel {def}{=}}Pr[x_{i}\sim y_{i}{\text{ in some a }}|x,y]\\&=\sum _{{\text{alignment a with }}x_{i}-y_{i}}Pr[a|x,y]\\&=\sum _{\text{alignment a}}\mathbf {1} \{x_{i}-y_{i}\in a\}Pr[a|x,y]\end{aligned}}}$

(Where ${\displaystyle \mathbf {1} \{x_{i}\sim y_{i}\in a\}}$ is equal to 1 if ${\displaystyle x_{i}}$ and ${\displaystyle y_{i}}$ are in the alignment and 0 otherwise.)

Step 2: Maximum expected accuracy[edit]

The accuracy of an alignment ${\displaystyle a^{*}}$ with respect to another alignment ${\displaystyle a}$ is defined as the number of common aligned pairs divided by the length of the shorter sequence.

Calculate expected accuracy of each sequence:

${\displaystyle {\begin{aligned}E_{Pr[a|x,y]}(acc(a^{*},a))&=\sum _{a}Pr[a|x,y]acc(a^{*},a)\\&={\frac {1}{min(|x|,|y|)}}\cdot \sum _{a}\mathbf {1} \{x_{i}\sim y_{i}\in a\}Pr[a|x,y]\\&={\frac {1}{min(|x|,|y|)}}\cdot \sum _{x_{i}-y_{i}}P(x_{i}\sim y_{j}|x,y)\end{aligned}}}$

This yields a maximum expected accuracy (MEA) alignment:

${\displaystyle E(x,y)=\arg \max _{a^{*}}\;E_{Pr[a|x,y]}(acc(a^{*},a))}$

Step 3: Probabilistic Consistency Transformation[edit]

All pairs of sequences x,y from the set of all sequences ${\displaystyle {\mathcal {S}}}$ are now re-estimated using all intermediate sequences z:

${\displaystyle P'(x_{i}-y_{i}|x,y)={\frac {1}{|{\mathcal {S}}|}}\sum _{z}\sum _{1\leq k\leq |z|}P(x_{i}\sim z_{i}|x,z)\cdot P(z_{i}\sim y_{i}|z,y)}$

This step can be iterated.

Step 4: Computation of guide tree[edit]

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.

Step 5: Compute MSA[edit]

Finally compute the MSA using progressive alignment or iterative alignment.

See also[edit]

• Sequence alignment software
• Clustal
• MUSCLE
• AMAP
• T-Coffee
• Probalign

References[edit]

External links[edit]

• Official website