{
  "id": "enwiki-001247430708",
  "slug": "probcons",
  "title": "ProbCons",
  "qid": "",
  "lead": "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.",
  "body": "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. ==Algorithm== The following describes the basic outline of the ProbCons algorithm. ===Step 1: Reliability of an alignment edge=== For every pair of sequences compute the probability that letters x_i and y_i are paired in a^* an alignment that is generated by the model. \\begin{align} P(x_i \\sim y_i|x,y) \\ \\overset{\\underset{\\mathrm{def}}{}}{=}& \\ \\Pr[x_i \\sim y_i \\text{ in some } a|x,y] \\\\[8pt] ===Step 2: Maximum expected accuracy=== 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: \\begin{align} E_{\\Pr[a|x,y]}(\\operatorname{acc}(a^*,a)) & = \\sum_{a}\\Pr[a|x,y] \\operatorname{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{align} This yields a maximum expected accuracy (MEA) alignment: E(x,y) = \\arg\\max_{a^*} \\; E_{\\Pr[a|x,y]}(\\operatorname{acc}(a^*,a)) ===Step 3: Probabilistic Consistency Transformation=== All pairs of sequences x,y from the set of all sequences \\mathcal{S} are now re-estimated using all intermediate sequences z: P'(x_i - y_i|x,y) = \\frac{1} \\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=== 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=== Finally compute the MSA using progressive alignment or iterative alignment. ==References== ==External links==",
  "categories": [
    "23603337",
    "26220375",
    "44381894"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1247430708",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1727155501.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001247430708",
    "type": "webpage",
    "title": "ProbCons",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/probcons",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001247430708",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1247430708",
    "note": "Immutable snapshot enwiki-001247430708"
  }
}