Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: CGAT: a comparative genome analysis tool for visualizing alignments in the analysis of complex evolutionary changes between closely related genomes

Figure 2

Merging overlapping alignments. (A) A directed acyclic graph (DAG) is constructed from the overlapping alignments, and the best path is then searched by a dynamic programming algorithm in order to resolve the overlap. A node of the DAG is every endpoint of block (filled circle) or internal point of block (filled square) that can be connected to some endpoint with a gap, and an edge of the DAG represents a block (solid line) or a gap (broken line). The blocks of two original alignments are indicated with red and blue lines, respectively. (B) A simplified example involving two overlapping alignment blocks. (C) The resolved alignment derived by taking the best path (thick lines).

Back to article page