Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

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

Figure 2

Interchanges between alignments can result in a multiplication of the number of possible paths through the DAG.a) Two alignments coded under the map C, as described in Equation (1). b) The resulting alignment DAG contains an interchange column, such that there are four paths through the DAG, arising from only two alignments. c) Correspondence between alignment columns and edges connecting cells in a dynamic programming matrix.

Back to article page