Evidence map›Paper›PMID 25888064›Full record

ArticleBMC bioinformatics2015

Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs.

Joseph L Herman, Ádám Novák, Rune Lyngsø, Adrienn Szabó, István Miklós, Jotun Hein

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
1.8field-weighted citation impact, top 15% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed, 20 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 3 institutions in 3 countries.

Joseph L HermanDepartment of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. herman@stats.ox.ac.uk.
Ádám NovákDepartment of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. novak@stats.ox.ac.uk.
Rune LyngsøDepartment of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. rune@lyngsoe.eu.
Adrienn SzabóInstitute of Computer Science and Control, Hungarian Academy of Sciences, Lagymanyosi u. 11., Budapest, 1111, Hungary. adrienn.szabo@sztaki.mta.hu.
István MiklósInstitute of Computer Science and Control, Hungarian Academy of Sciences, Lagymanyosi u. 11., Budapest, 1111, Hungary. miklosi@renyi.hu.
Jotun HeinDepartment of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. hein@stats.ox.ac.uk.
University of Oxford · GBAlfréd Rényi Institute of Mathematics · HUInstitute for Computer Science and Control · HU

Funding

Biotechnology and Biological Sciences Research Council
6 · The paper itself

Abstract

backgroundA standard procedure in many areas of bioinformatics is to use a single multiple sequence alignment (MSA) as the basis for various types of analysis. However, downstream results may be highly sensitive to the alignment used, and neglecting the uncertainty in the alignment can lead to significant bias in the resulting inference. In recent years, a number of approaches have been developed for probabilistic sampling of alignments, rather than simply generating a single optimum. However, this type of probabilistic information is currently not widely used in the context of downstream inference, since most existing algorithms are set up to make use of a single alignment.

resultsIn this work we present a framework for representing a set of sampled alignments as a directed acyclic graph (DAG) whose nodes are alignment columns; each path through this DAG then represents a valid alignment. Since the probabilities of individual columns can be estimated from empirical frequencies, this approach enables sample-based estimation of posterior alignment probabilities. Moreover, due to conditional independencies between columns, the graph structure encodes a much larger set of alignments than the original set of sampled MSAs, such that the effective sample size is greatly increased.

conclusionsThe alignment DAG provides a natural way to represent a distribution in the space of MSAs, and allows for existing algorithms to be efficiently scaled up to operate on large sets of alignments. As an example, we show how this can be used to compute marginal probabilities for tree topologies, averaging over a very large number of MSAs. This framework can also be used to generate a statistically meaningful summary alignment; example applications show that this summary alignment is consistently more accurate than the majority of the alignment samples, leading to improvements in downstream tree inference. Implementations of the methods described in this article are available at http://statalign.github.io/WeaveAlign .

Indexed as

AlgorithmsComputer GraphicsModels, StatisticalSoftwareComputational BiologyComputer SimulationHumansSequence AlignmentUncertainty

Identifiers

PMID25888064
PMCPMC4395974
OpenAlexW2069319306

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.