ProbCons

In bioinformatics and proteomics, ProbCons is an open source software for probabilistic consistency-based multiple alignment of amino acid sequences.

Uses your system voice; voice and rate in settings.

≈ 3 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In bioinformatics and proteomics, ProbCons is an open source software for 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 edit source

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

Step 1: Reliability of an alignment edge

edit edit source

For every pair of sequences compute the probability that letters xi and yi are paired in a∗ an alignment that is generated by the model.

P(xi∼yi|x,y) =def Pr⁡[xi∼yi in some a|x,y]= ∑alignment awith xi−yiPr⁡[a|x,y]= ∑alignment a𝟏{xi−yi∈a}Pr⁡[a|x,y]

(Where 𝟏{xi∼yi∈a} is equal to 1 if xi and yi are in the alignment and 0 otherwise.)

Step 2: Maximum expected accuracy

edit edit source

The accuracy of an alignment a∗ with respect to another alignment a is defined as the number of common aligned pairs divided by the length of the shorter sequence.

Calculate expected accuracy of each sequence:

EPr⁡[a|x,y](acc⁡(a∗,a))=∑aPr⁡[a|x,y]acc⁡(a∗,a)=1min⁡(|x|,|y|)⋅∑a𝟏{xi∼yi∈a}Pr⁡[a|x,y]=1min⁡(|x|,|y|)⋅∑xi−yiP(xi∼yj|x,y)

This yields a maximum expected accuracy (MEA) alignment:

E(x,y)=arg⁡maxa∗EPr⁡[a|x,y](acc⁡(a∗,a))

Step 3: Probabilistic Consistency Transformation

edit edit source

All pairs of sequences x,y from the set of all sequences 𝒮 are now re-estimated using all intermediate sequences z:

P′(xi−yi|x,y)=1|𝒮|∑z∑1≤k≤|z|P(xi∼zi|x,z)⋅P(zi∼yi|z,y)

This step can be iterated.

Step 4: Computation of guide tree

edit edit source

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 edit source

Finally compute the MSA using progressive alignment or iterative alignment.

See also

edit edit source

References

edit edit source
  1. ^ Do CB, Mahabhashyam MS, Brudno M, Batzoglou S (2005). "PROBCONS: Probabilistic Consistency-based Multiple Sequence Alignment". Genome Research. 15 (2): 330–340. doi:10.1101/gr.2821705. PMC 546535. PMID 15687296. Wikipedia revision 1247430708, retrieved 2026-11-18
  2. ^ Roshan, Usman (2014-01-01). "Multiple Sequence Alignment Using Probcons and Probalign". In Russell, David J (ed.). Multiple Sequence Alignment Methods. Methods in Molecular Biology. Vol. 1079. Humana Press. pp. 147–153. doi:10.1007/978-1-62703-646-7_9. ISBN 9781627036450. PMID 24170400. Wikipedia revision 1247430708, retrieved 2026-11-18
  3. ^ Lecture "Bioinformatics II" at University of Freiburg Wikipedia revision 1247430708, retrieved 2026-11-18
edit edit source

Text derived from https://en.wikipedia.org/w/index.php?oldid=1247430708 under CC BY-SA 4.0; modifications have been made.

Words in each sectionAlgorithmAlgorithmAlgorithm: 324 words324See alsoSee alsoSee also: 11 words11
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001247430708 · captured 2024-09-24 · ledger · version history

Cite this page as: encyclopegia.org, “ProbCons”, snapshot enwiki-001247430708. https://encyclopegia.org/a/probcons