# Genome alignment with graph data structures: a comparison

- Birte Kehr
^{1, 2}Email author, - Kathrin Trappe
^{1}, - Manuel Holtgrewe
^{1}and - Knut Reinert
^{1}

**15**:99

**DOI: **10.1186/1471-2105-15-99

© Kehr et al.; licensee BioMed Central Ltd. 2014

**Received: **27 February 2013

**Accepted: **28 March 2014

**Published: **9 April 2014

## Abstract

### Background

Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference.

Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment.

### Results

We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures.

### Conclusion

We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools.

## Background

Sequence comparison through multiple alignment is an indispensable tool for understanding genomes and their shared histories [1]. Even though the foundation for genomic sequence alignment was already laid in the 1980s [2], the interest is still ongoing [1, 3, 4], one reason being that it has critical relevance [5] for many bioinformatics analyses. The aim of sequence alignment is to uncover *homologies* by assigning sequence positions to each other, which implies that these positions derived from a common ancestor.

Evolutionary events that change genomic sequences are often classified into small changes and large structural changes [6]. Small changes affect only one or few sequence positions and include substitutions, insertions, and deletions. They do not influence the order of sequence positions, and thus can be captured by *colinear* alignment. Structural changes involve longer genomic segments, thereby affecting the structure and order of genomic sequences. They include *non-colinear* changes like inversions, translocations and duplications in addition to insertions and deletions of longer segments.

While colinear multiple sequence alignment has been studied extensively for a long time [7–16], the problem of non-colinear alignment has been brought into focus only within the last decade [17–22], after more and more whole genomes started to become available. Non-colinear alignments, as opposed to colinear alignments, model all kinds of evolutionary changes and thereby enable correct homology prediction for whole genomes with non-colinear changes. This is comparable to the way global alignments integrate more information than local alignments by assigning all parts of sequences to each other, and the way multiple alignments take information from more than two sequences into account for homology prediction. Over and above, non-colinear multiple global alignments of whole genomes, *genome alignments* for short, integrate as much sequence similarity information as is available.

Together with the prediction of homology, genome alignments provide a *segmentation* of the genomes originating from large structural changes. Depending on the similarity of genomes, segments can be shorter or span several genes and reveal local colinearity. Rearrangement studies [23] explore the order of such segments and infer genomic distances based on the number of breakpoints [24, 25] or predict scenarios of evolutionary changes [26–28]. These studies often employ graphs, e. g., breakpoint graphs [29–31], that resemble graph data structures used for genome alignment. Despite this similarity in the approach, genome alignments pursue a slightly different goal than rearrangement studies. The goal is homology prediction instead of reconstruction of evolutionary histories. Genome alignments, which are the focus of this article, integrate more information than rearrangement studies by combining segmentation and sequence similarity.

For the step of selecting subsets of local alignments and for inducing a segmentation, graphs serve as a convenient tool. The idea is that graphs show substructures indicating errors in the alignment, e. g., specific cycles. Once identified in a graph, we can eliminate these substructures, e. g., by removing local alignments, which is a modification of the genome alignment. Thus, graphs can assist in improving genome alignments. In addition, graphs provide an intuitive representation of similarities and changes between genomes, and so visualize alignment structures. In comparison to tabular alignments, genome alignment graphs are more versatile insofar that it is possible to model colinear and non-colinear changes without the need of choosing a reference genome.

Several graphs have been proposed, each in the context of a specific application such as synteny detection, segmentation, or simply colinear alignment. The earliest graph has been the *alignment graph*, formally defined for colinear multiple alignment by Kececioglu in 1993 [32]. In his definition, the graph contains a vertex for each sequence character and edges for aligned characters. The alignment graph has since been used in various versions, e. g., with additional sequence edges [33] and with genes [34] or segments [15] instead of single characters. In all versions, a colinear alignment can be obtained from the alignment graph by solving the maximum weight trace problem [32], but its structure also allows non-colinear changes to be modeled (see below).

Pevzner et al. introduced *A-Bruijn graphs*[35] as a generalization of de Bruijn graphs [36, 37]. The structure of A-Bruijn graphs revisits an idea briefly mentioned by Kececioglu [32], the idea of merging aligned vertices. Consequently, A-Bruijn graphs have one vertex for sets of aligned positions, and edges represent sequence adjacencies. For the purpose of genome alignment with A-Bruijn graphs, the maximum subgraph with large girth (MSLG) problem [19] and the sequence modification problem (SMP) [38] were proposed, both targeting types of short cycles in A-Bruijn graphs in order to eliminate local alignments that hide local colinearity.

In the context of a pipeline for genome alignment that consists of the programs Enredo and Pecan [39], another graph has been published, the *Enredo graph*. The program Enredo applies Enredo graphs to partition genomes into segments. Subsequently, the program Pecan provides nucleotide-level colinear alignments of segments. Enredo graphs have two vertices per set of aligned segments, a head and a tail vertex, resembling breakpoint graphs from rearrangement studies. The Enredo method iteratively eliminates various substructures from the Enredo graph before deriving a final genome segmentation.

A recent and slightly dissimilar graph is the *cactus graph*[22, 40]. Cactus graphs have vertices for adjacencies and edges for genome segments. Their structure has two valuable properties. The cactus property subdivides the graph (and genomes) into independent units by ensuring that any edge is part of at most one simple cycle [41]. These units assist in computing genome alignments with the cactus alignment filter (CAF) algorithm [22]. The second property is the existence of an Eulerian circuit. This circuit traverses all genome segments exactly once, even duplicated segments, conveniently providing a consensus genome.

## Results

### Terminology

The biological term *homologous* denotes two or more genomic positions that derived from a single position in an ancestral genome, or two or more segments that derived from a single segment in an ancestral genome. An alignment of genomes is an assignment of positions from the aligned genomes. Usually, the goal is to align only homologous positions to each other, but since the ancestral genome is unknown, an alignment can only be a prediction of homology.

In the following, we formally define a genomic position and give a very general definition of an alignment. Next, we define a genomic segment and constrain the alignment definition to colinearity. Since colinearity is often too strict for predicting homology in whole genomes, genome aligners use so-called blocks, which are colinear alignments of genomic segments. Blocks can be arbitrarily combined to non-colinear genome alignments. We give a general definition of blocks as the basic entities that underlie graph-based genome aligners. Finally, we define the terms adjacency and breakpoint.

Let
be a set of genomes. Each *genome*$g\in \mathcal{G}$ is a sequence of characters from the DNA alphabet *Σ*={*A*,*C*,*G*,*T*}. We define the *position* of the (*i*+1)^{
s
t
} character in genome *g* as *p*=(*g*,*i*) with 0≤*i*<|*g*|, where |*g*| denotes the *length* of *g*. To compare two positions with the operators < and >, we assume an arbitrary strict total ordering of the genomes (such that for any pair of genomes ${g}_{1},{g}_{2}\in \mathcal{G}$ either *g*_{1}<*g*_{2} or *g*_{2}<*g*_{1}). Then, *p*_{1}<*p*_{2} where *p*_{1}=(*g*_{1},*i*_{1}) and *p*_{2}=(*g*_{2},*i*_{2}), if *g*_{1}<*g*_{2} or if *g*_{1}=*g*_{2} and *i*_{1}<*i*_{2}. Let ${P}_{\mathcal{G}}=\{p\mid p=(g,i),g\in \mathcal{G},0\le i<|g\left|\right\}$ be the set of all positions of the genomes
. An *alignment component* (column) *A* is a subset of ${P}_{\mathcal{G}}$. For example, all pairs of positions connected by a line in Figure 1 form alignment components. Without any demand for optimality, an *alignment*
is simply a set of alignment components.

*p*=(

*g*,

*i*) and

*q*=(

*g*,

*j*) from the same genome

*g*defines a

*segment*

*s*=(

*p*,

*q*) of length |

*i*−

*j*|, where min{

*p*,

*q*} is the smallest position and max{

*p*,

*q*} the position directly following the largest position in the segment. If

*p*<

*q*, the segment is in the

*forward orientation*, and if

*p*>

*q*, the segment is in the

*reverse complemented*orientation (see Figure 3). As an alternative to an ordered pair (

*p*,

*q*), a segment could equivalently be represented by a start position, a length, and an additional orientation bit. Two segments

*s*

_{1}=(

*p*

_{1},

*q*

_{1}) and

*s*

_{2}=(

*p*

_{2},

*q*

_{2}), where without loss of generality min{

*p*

_{1},

*q*

_{1}}≤ min{

*p*

_{2},

*q*

_{2}}, are

*non-overlapping*if max{

*p*

_{1},

*q*

_{1}}≤ min{

*p*

_{2},

*q*

_{2}}. If max{

*p*

_{1},

*q*

_{1}}= min{

*p*

_{2},

*q*

_{2}},

*s*

_{1}and

*s*

_{2}are

*adjacent*and define the

*adjacency*at position

*a*= max{

*p*

_{1},

*q*

_{1}} (see Figure 3). Two segments

*fully overlap*if both min{

*p*

_{1},

*q*

_{1}}= min{

*p*

_{2},

*q*

_{2}} and max{

*p*

_{1},

*q*

_{1}}= max{

*p*

_{2},

*q*

_{2}}.

An alignment
of a set of segments *S* is *colinear* if each alignment component contains at most one position from each segment *s*∈*S* and if it is possible to impose a strict total ordering ≺ on the alignment components $A\in \mathcal{A}$ (such that for any pair of distinct alignment components ${A}_{1},{A}_{2}\in \mathcal{A}$ either *A*_{1}≺*A*_{2} or *A*_{2}≺*A*_{1}) as follows: The relation *A*_{1}≺*A*_{2} holds if for any two positions *p*_{1}∈*A*_{1} and *p*_{2}∈*A*_{2} from the same segment *s*∈*S*, *p*_{1}<*p*_{2} if *s* is in the forward orientation and *p*_{2}<*p*_{1} if *s* is in the reverse complemented orientation. If an alignment violates the conditions for colinearity, it is *non-colinear* (see Figure 1). To put it simply, inversions, duplications, and translocations of parts of the aligned sequences are non-colinear operations that violate colinearity.

Non-colinear operations divide an alignment into units that are colinear in themselves but not with respect to each other. We call these units *blocks* and define a block as a colinear alignment of a set of segments. Note that a block may contain multiple segments of the same genome if duplications are present. We refer to the number of segments in a block as the *size* of a block (not to be confused with the *length* of segments). In Figure 1, areas shaded in blue and red indicate blocks. For example in the left alignment, the two dinucleotides CG form a block and the two dinucleotides AT form another block. In the right alignment of Figure 1, the segment ATCG and its reverse complement in the second sequence form a block.

A block always has two equivalent representations. In the first block representation, some segments are in the forward orientation and some may be in the reverse complemented orientation. In the second block representation all segments are in the reverse complemented orientation that are in the forward orientation in the first block representation and all segments are in the forward orientation that are in the reverse complemented orientation in the first block representation. The essential information about possible inversions is the orientation of segments with respect to each other and not the orientation of the block representation. Once we choose one of the two representations, we implicitly assign a tail and a head to a block *b*. The *head* is the set of positions {*p*} of all segments *s*∈*b* with *s*=(*p*,*q*), and the *tail* is the set of positions {*q*}. We refer to the two sets as the *ends* of *b* in cases where the orientation of a block is not given.

A set of blocks constitutes a genome alignment and is input for building a genome alignment graph. To simplify the exposition of the graphs below, we define ${B}_{\mathcal{G}}$ as a set of blocks that is a tiling of the genomes : All pairs of blocks ${b}_{1},{b}_{2}\in {B}_{\mathcal{G}}$ have to be non-overlapping; for unaligned segments between blocks and unaligned segments at the ends of the genomes, ${B}_{\mathcal{G}}$ includes blocks of size 1.

Two blocks ${b}_{1},{b}_{2}\in {B}_{\mathcal{G}}$ are *adjacent* if there are two segments *s*_{1}∈*b*_{1} and *s*_{2}∈*b*_{2} that are adjacent. Since all blocks have two ends, there may be up to four different adjacencies between two blocks: the head of *b*_{1} can be adjacent to the head of *b*_{2} or to the tail of *b*_{2}, or the tail of *b*_{1} can be adjacent to the head of *b*_{2} or to the tail of *b*_{2}. Each of the four adjacencies is defined by a set of adjacency positions between segments from the two blocks, e. g., if the tail of *b*_{1} is adjacent to the head of *b*_{2}, the adjacency is defined by the set of positions {*q*_{1}} of segments *s*_{1}∈*b*_{1} with *s*_{1}=(*p*_{1},*q*_{1}) for which there is a segment *s*_{2}∈*b*_{2} with *s*_{2}=(*p*_{2},*q*_{2}) where *p*_{1}=*q*_{2}. Since a block can contain more than one segment from the same genome, a block can be adjacent to itself. In the literature, adjacencies of blocks are sometimes defined as segments between two blocks [39]. Given that the set of blocks ${B}_{\mathcal{G}}$ is a tiling of the genomes, we can refer to an adjacency as a set of single positions.

An adjacency of two blocks ${b}_{1},{b}_{2}\in {B}_{\mathcal{G}}$ is called a *breakpoint* if *b*_{1} and *b*_{2} are adjacent in only a subset of the segments. Then, the set of positions that define the adjacency is smaller than the size of the block. More formally, let *s*_{1}∈*b*_{1} and *s*_{2}∈*b*_{2} be two adjacent segments with *s*_{1}=(*p*_{1},*q*_{1}) and *s*_{2}=(*p*_{2},*q*_{2}). Without loss of generality, let *q*_{1}=*p*_{2}. Then, *b*_{1} and *b*_{2} define a breakpoint if there is a segment ${s}_{1}^{\prime}\in {b}_{1}$ with ${s}_{1}^{\prime}=({p}_{1}^{\prime},{q}_{1}^{\prime})$ for which no segment ${s}_{2}^{\prime}\in {b}_{2}$ with ${s}_{2}^{\prime}=({p}_{2}^{\prime},{q}_{2}^{\prime})$ exists where ${q}_{1}^{\prime}={p}_{2}^{\prime}$.

Most commonly, genome alignment programs use pairwise local alignment methods to generate blocks. Pairwise local alignments are blocks of size two. These blocks can be combined with each other to form blocks of a larger size (multiple local alignments) if a segment from one block fully overlaps with a segment from another block. We briefly address this preprocessing of blocks in the Discussion and conclusions section, and assume that a set ${B}_{\mathcal{G}}$ is given for constructing the graphs.

In the literature, blocks are often referred to as synteny blocks or locally colinear blocks. The definitions of blocks differ, usually depending on the specific type of local alignment method being used for generating blocks. For example, blocks can be defined as gapped or ungapped colinear alignments with or without mismatches, or simply as single alignment components. The graph representations are independent from the precise assignment of positions to alignment components within blocks. Only the set of segments including their relative orientation within the block is relevant. For this reason, the different block definitions can be used interchangeably except for preprocessing the set of blocks to obtain ${B}_{\mathcal{G}}$ (see Discussion and conclusions section).

Within the graphs described in the following sections, blocks and adjacencies are represented by vertices or edges or a combination of both. For each graph, every genome is a (not necessarily simple) path through the graph. We use the term *to thread* for following the path of a genome through the graph [17, 35].

### Graphs for genome alignment

The input for building a graph is a set of non-overlapping blocks ${B}_{\mathcal{G}}$ defined on a given set of genomes
. We assume the blocks to be a tiling of
. For all four graphs, we define the *graph structures* *G*=(*V*,*E*) as ordered pairs of vertices *V* and edges *E*. In addition, we define *graph models* *M*_{
G
}=(*G*,*ℓ*), which are ordered pairs of the respective graph structure *G* and a *labeling function* *ℓ*. Most original publications remain vague about labels on vertices and edges of the graph structures. We define *ℓ* such that the set of blocks ${B}_{\mathcal{G}}$ can be recovered from *M*_{
G
}.

Along with the definitions of *G* and *M*_{
G
} for each of the four graphs, we describe how it is possible to transform the different graph structures into each other (e. g., an alignment graph structure into an A-Bruijn graph structure). A *transformation* is an operation that has as input one graph structure *G* and outputs another graph structure *G*^{′}, where both *G* and *G*^{′} represent the same genome alignment. If it is possible to obtain a graph structure *G*^{′} from another graph structure *G* without the help of ${B}_{\mathcal{G}}$ and without a labeling function, then *G* provides at least as much alignment information as *G*^{′}. Moreover, if a graph structure *G* provides less information about the alignment than another graph structure *G*^{′}, a transformation from *G* to *G*^{′} is ambiguous, thus, impossible.

We examine the transformations that are depicted as arrows in Figure 2. Straight arrows indicate a possible transformation; the other arrows indicate that a transformation among the structures is impossible, which we prove below by providing examples for ambiguity. Nevertheless, we describe all transformations depicted as arrows in Figure 2, using additional information from graph labels if necessary to resolve ambiguity. We define the sparse labeling functions *ℓ*^{
d
u
p
}, *ℓ*^{
i
n
v
}, or *ℓ*^{
a
d
j
} for this purpose. The sparse labeling functions provide sufficient information for the transformation but less information than *ℓ* in the graph models. Note that a transformation among graph models is trivial given that ${B}_{\mathcal{G}}$ can be recovered from the model *M*_{
G
} of any of the four graphs. The need for labels to resolve ambiguity proves that the graph structures *G* differ in their information content.

#### Alignment graphs

In the following section, let *G*=(*V*,*E*) be an alignment graph structure and *M*_{
G
}=(*G*,*ℓ*) be an alignment graph model. We define *ℓ* as a labeling function of the vertices *V* of *G*. The set of edges *E*=*E*_{
A
}∪*E*_{
B
} decomposes into a set of directed adjacency edges *E*_{
A
} and a set of undirected block edges *E*_{
B
}. With both directed and undirected edges, *G* is a *mixed graph*.

The vertices *V* of *G* represent segments of the genomes. There is a vertex in *V* for every segment in the set of all segments (${S}_{B}=\bigcup _{b\in {B}_{\mathcal{G}}}b$) from all blocks ${B}_{\mathcal{G}}$. The function *ℓ*:*V*→*S*_{
B
} labels each vertex *v*∈*V* with the corresponding segment *s*∈*S*_{
B
} such that *ℓ*(*v*)=*s*.

Directed adjacency edges *E*_{
A
} (colored edges in Figure 4) represent adjacencies of segments. Given any pair of vertices *v*_{1},*v*_{2}∈*V* and their labels *ℓ*(*v*_{1})=(*p*_{1},*q*_{1}) and *ℓ*(*v*_{2})=(*p*_{2},*q*_{2}), there is a directed edge *e*∈*E*_{
A
} from *v*_{1} to *v*_{2} if max{*p*_{1},*q*_{1}}= min{*p*_{2},*q*_{2}}, i. e., the segment *ℓ*(*v*_{2}) is adjacent to the segment *ℓ*(*v*_{1}) in
. Adjacency edges thread the genomes through the alignment graph.

Finally, undirected block edges *E*_{
B
} (gray edges in Figure 4) connect vertices labeled with segments from the same block $b\in {B}_{\mathcal{G}}$. For each vertex *v*_{1}∈*V* with *ℓ*(*v*_{1})∈*b*, there are undirected edges *E*_{
B
} between *v*_{1} and any other vertex *v*_{2}∈*V* with *ℓ*(*v*_{2})∈*b*. As a consequence, each block $b\in {B}_{\mathcal{G}}$ forms a *block edge connected component* *C*⊆*V* in the alignment graph.

The formation of connected components is important for recovering ${B}_{\mathcal{G}}$ from *M*_{
G
}. Let
be the set of block edge connected components of *G*. It holds $V=\bigcup _{C\in \mathcal{C}}C$, and *C*_{1}∩*C*_{2}=*∅* for any ${C}_{1},{C}_{2}\in \mathcal{C}$. Thus, we may recover ${B}_{\mathcal{G}}$ by forming a block *b*={*ℓ*(*v*)∣*v*∈*C*} for every component $C\in \mathcal{C}$.

Our definition of the alignment graph structure *G* models non-colinear changes among the input genomes, in particular translocations and duplications. Translocations appear in *G* as mixed cycles. A *mixed cycle* is a cycle in a mixed graph formed by both directed and undirected edges. Duplications appear as block edges within the set of vertices of one genome. Because of these edges our alignment graph is not n-partite as in its original definition [32].

*G*; the orientation of segments remains unclear (see also Figure 5). We define the sparse labeling function

*ℓ*

^{ i n v }:

*V*→{+,−} as

*ℓ*(

*v*)=(

*p*,

*q*). The function

*ℓ*

^{ i n v }assigns bits to the vertices that indicate the orientation of the represented segments. As an alternative to vertex labels, it is possible to label block edges with bits that indicate equal or opposite orientation of the segments in the endpoints (visualized as dashed and solid lines in Figure 4 or red and black edges in [42]).

#### A-Bruijn graphs

Let now *G*=(*V*,*E*) be an A-Bruijn graph structure and *M*_{
G
}=(*G*,*ℓ*) be an A-Bruijn graph model. A-Bruijn graphs have only one type of edge *E*. We define *ℓ* as a labeling function of the vertices *V*. In contrast, the functions *ℓ*^{
i
n
v
} and *ℓ*^{
d
u
p
} described below provide labels for the edges *E*.

The vertices *V* of *G* represent blocks. For every block in ${B}_{\mathcal{G}}$, there is a vertex in *V*. There is only one vertex per block regardless of the block’s size and of duplications. The function $\ell :V\to {B}_{\mathcal{G}}$ labels each vertex *v*∈*V* with the corresponding block $b\in {B}_{\mathcal{G}}$ such that *ℓ*(*v*)=*b*. With this labeling, recovering ${B}_{\mathcal{G}}$ from *M*_{
G
} is straightforward.

The edges *E* of *G* represent adjacencies just like adjacency edges in alignment graphs. Given any pair of vertices *v*_{1},*v*_{2}∈*V* and their labels *b*_{1}=*ℓ*(*v*_{1}) and *b*_{2}=*ℓ*(*v*_{2}), there is a directed edge *e*∈*E* from *v*_{1} to *v*_{2} for every two adjacent segments *s*_{1}=(*p*_{1},*q*_{1}) and *s*_{2}=(*p*_{2},*q*_{2}) with max{*p*_{1},*q*_{1}}= min{*p*_{2},*q*_{2}} where *s*_{1}∈*b*_{1} and *s*_{2}∈*b*_{2}. If multiple adjacent pairs of segments exist in *b*_{1} and *b*_{2}, *E* contains multiple edges from *v*_{1} to *v*_{2}. Thus, *G* is a multi-graph. In the present paper, we prefer the multi-graph representation with multiple separate edges between two vertices over the multi-graph representation with multiplicity labels on edges.

*G*. However, the path from threading one genome is not necessarily simple. It traverses vertices multiple times if duplications are present (see block J in Figure 4) making the path ambiguous. Thus, threading requires label information that allows incoming and outgoing edges of a vertex to be paired. Such information is not required in the alignment graph structure, where each vertex has at most one incoming and one outgoing edge. Without duplications it is sufficient to color edges of

*G*by genome (red, blue, and green in Figure 4) instead of providing the full labels

*ℓ*. In the presence of duplications,

*G*can be ambiguous even with color labels (see Figure 6 and block J in Figure 4).

*G*for threading, we define the sparse labeling function ${\ell}^{\mathit{\text{dup}}}:E\to \mathbb{N}$ as a total ordering on the edges. This function assigns numbers to the edges that describe the order of the adjacencies in the genomes. In Figure 6, for example, the edges could be numbered 1 through 8: for genome ABDABCEBC, one edge from A to B would be labeled with 1, the edge from B to D would be labeled with 2, the edge from D to A would be labeled with 3, and so on; for genome ABCEBDABC, also one edge from A to B would be labeled with 1, but then the edge from B to C would be labeled with 2, and so on. To describe

*ℓ*

^{ d u p }formally, we use adjacency positions of the edges

*E*that we determine with the help of

*ℓ*. Given a pair of vertices

*v*

_{1},

*v*

_{2}∈

*V*, each edge

*e*∈

*E*from

*v*

_{1}to

*v*

_{2}corresponds to one pair of adjacent segments

*s*

_{1}∈

*ℓ*(

*v*

_{1}) and

*s*

_{2}∈

*ℓ*(

*v*

_{2}) with

*s*

_{1}=(

*p*

_{1},

*q*

_{1}) and

*s*

_{2}=(

*p*

_{2},

*q*

_{2}). The adjacency position of

*e*is

*a*= max{

*p*

_{1},

*q*

_{1}}= min{

*p*

_{2},

*q*

_{2}}. Then,

*ℓ*

^{ d u p }assigns numbers to edges in

*E*such that

where *a*_{1} is the adjacency position of *e*_{1}, and *a*_{2} is the adjacency position of *e*_{2}.

*G*(see Figure 5). Just like the alignment graph structure,

*G*provides no information about the orientation of segments represented in a vertex. We define the sparse labeling function

*ℓ*

^{ i n v }:

*E*→{+,−}×{+,−} for A-Bruijn graph edges

*E*. For each pair of adjacent segments

*s*

_{1}=(

*p*

_{1},

*q*

_{1}) and

*s*

_{2}=(

*p*

_{2},

*q*

_{2}) from the labels of two vertices

*s*

_{1}∈

*ℓ*(

*v*

_{1}) and

*s*

_{2}∈

*ℓ*(

*v*

_{2}), we label an edge

*e*=(

*v*

_{1},

*v*

_{2}) with

*ℓ*

^{ i n v }(

*e*) indicates the orientation of the segment in the source vertex of

*e*, and the second bit the orientation of the segment in the target vertex. It is not sufficient to solely label vertices of

*G*with one orientation bit per segment of the represented block. Figure 7 provides an example where this leads to ambiguity.

Below, we describe transformations between A-Bruijn graphs and alignment graphs. As stated above, the transformation of the graph *models* is trivial, but the example in Figure 6 proves that in some cases it is impossible to transform an A-Bruijn graph *structure* into an alignment graph structure. We describe the transformation with the help of the sparse labeling function *ℓ*^{
d
u
p
} to resolve ambiguity.

##### A-Bruijn graphs from alignment graphs.

To transform an alignment graph structure ${G}^{\prime}=({V}^{\prime},{E}_{B}^{\prime}\cup {E}_{A}^{\prime})$ into an A-Bruijn graph structure *G*=(*V*,*E*), we follow the description of A-Bruijn graphs in [35] and exploit a many-to-one mapping from alignment graph vertices to A-Bruijn graph vertices. The transformation is possible without additional information from a labeling function.

As a first step, compute all block edge connected components
of *G*^{′}. As described above, each component represents exactly one block, and each vertex *v*^{′}∈*V*^{′} is part of exactly one component. Now, add for every component $C\in \mathcal{C}$ a vertex to the set of A-Bruijn graph vertices *V*. We obtain a many-to-one mapping of alignment graph vertices to A-Bruijn graph vertices. We keep the mapping as a label *m*[ *v*^{′}]=*v* on each alignment graph vertex *v*^{′}∈*V*^{′}. The label indicates the A-Bruijn graph vertex *v* that represents the connected component containing *v*^{′}.

The remaining task is to transfer adjacency edges from the alignment graph to the A-Bruijn graph. Using the mapping, add an edge *e*=(*u*,*v*) to the set of A-Bruijn graph edges *E* for each edge *e*^{′}=(*u*^{′},*v*^{′}) from the set of alignment graph adjacency edges ${E}_{A}^{\prime}$, where *u*=*m*[ *u*^{′}] and *v*=*m*[ *v*^{′}].

#### A-Bruijn graphs to alignment graphs.

We describe the transformation of an A-Bruijn graph structure *G*=(*V*,*E*) into an alignment graph structure ${G}^{\prime}=({V}^{\prime},{E}_{A}^{\prime}\cup {E}_{B}^{\prime})$ given the labeling function *ℓ*^{
d
u
p
} for the edges of *G* in addition to *G*. In accordance with the transformation from *G*^{′} to *G*, we successively create a one-to-many mapping from A-Bruijn graph vertices to alignment graph vertices during the transformation. The mapping *m* labels each A-Bruijn graph vertex *v*∈*V* with a set of alignment graph vertices from *V*^{′}. At the beginning *m*[ *v*]={} for all *v*∈*V*. At the end, a label $m\left[v\right]=\{{v}_{1}^{\prime},\dots ,{v}_{\left|b\right|}^{\prime}\}$ indicates the set of alignment graph vertices $\{{v}_{1}^{\prime},\dots ,{v}_{\left|b\right|}^{\prime}\}$ that form the connected component for a block *b* represented by *v* in the A-Bruijn graph.

We transform the A-Bruijn graph by following each genome separately and assume that the edges are given in increasing order of labels: *ℓ*^{
d
u
p
}(*e*_{1})<*ℓ*^{
d
u
p
}(*e*_{2})<⋯<*ℓ*^{
d
u
p
}(*e*_{|E|}). Initially, add for each genome a new vertex *u*^{′} to the set of alignment graph vertices *V*^{′}. If the source vertex *u* of the A-Bruijn graph edge *e*_{1}=(*u*,*v*) is labeled with a non-empty set of vertices $m\left[\phantom{\rule{0.3em}{0ex}}u\right]=\{{u}_{1}^{\prime},\dots ,{u}_{k}^{\prime}\}$, add undirected edges between *u*^{′} and all vertices ${u}_{1}^{\prime},\dots ,{u}_{k}^{\prime}$ to the set of alignment graph block edges ${E}_{B}^{\prime}$. Next, add *u*^{′} to the set of vertices mapped to *u*. Repeat these three steps for the target vertex *v* of *e*_{1}: add a vertex *v*^{′}, add block edges, and add *v*^{′} to the mapping. In addition, add a directed edge from *u*^{′} to *v*^{′} to the set of alignment graph adjacency edges ${E}_{A}^{\prime}$.

Iterate over the A-Bruijn graph edges in increasing order of labels and repeatedly add for the target vertex a new vertex, add block edges, add the new vertex to the mapping, and add an adjacency edge from the previous to the new vertex. This way, the genomes are threaded through the A-Bruijn graph and the alignment graph structure *G* is successively built up.

#### Enredo graphs

In this section, let *G*=(*V*,*E*) be an Enredo graph structure and *M*_{
G
}=(*G*,*ℓ*) be an Enredo graph model. In an Enredo graph, the set of edges *E*=*E*_{
A
}∪*E*_{
B
} decomposes again into a set of directed adjacency edges *E*_{
A
} and a set of undirected block edges *E*_{
B
}. We define *ℓ* as a labeling function of the block edges *E*_{
B
}.

The block edges *E*_{
B
} of *G* represent blocks, and vertices *V* of *G* represent the ends of blocks. In contrast to alignment graphs, a single block edge represents an entire block. For every block $b\in {B}_{\mathcal{G}}$, there are two vertices in *V* connected by an undirected block edge *e*_{
b
}∈*E*_{
B
} (black edges in Figure 4). The function $\ell :{E}_{B}\to {B}_{\mathcal{G}}$ labels each block edge *e*_{
b
}∈*E*_{
B
} with the corresponding block $b\in {B}_{\mathcal{G}}$ such that *ℓ*(*e*_{
b
})=*b*. By choosing one of the two possible block representations as label, the two vertices that are connected by *e*_{
b
} are implicitly labeled as head and tail of the block. Note that they are not labeled as head or tail in *G*. Given the block labels, recovering ${B}_{\mathcal{G}}$ from *M*_{
G
} is again straightforward.

Directed adjacency edges *E*_{
A
} of *G* (colored edges in Figure 4) represent adjacencies. Given any pair of block edges *e*_{1}={*u*_{
t
},*u*_{
h
}} and *e*_{2}={*v*_{
t
},*v*_{
h
}} and their labels *ℓ*(*e*_{1})=*b*_{1} and *ℓ*(*e*_{2})=*b*_{2}, there is a directed edge *e*∈*E*_{
A
} from an endpoint of *e*_{1} to an endpoint of *e*_{2} for every two adjacent segments *s*_{1}=(*p*_{1},*q*_{1}) and *s*_{2}=(*p*_{2},*q*_{2}) with *s*_{1}∈*b*_{1} and *s*_{2}∈*b*_{2}. In contrast to alignment graphs and A-Bruijn graphs, the endpoints of adjacency edges in *G* indicate in relation to other adjacency edges the orientation of segments in a block. Given labels, one endpoint of each block edge is a head vertex and the other a tail vertex. If *p*_{1}<*q*_{1}, then the adjacency edge *e* starts at the head vertex *u*_{
h
}, and if *p*_{1}>*q*_{1}, *e* starts at the tail vertex *u*_{
t
}. If *p*_{2}<*q*_{2}, then *e* points to the tail vertex *v*_{
t
}, and if *p*_{2}>*q*_{2}, *e* points to the head vertex *v*_{
h
}. In other words, *e*=(*u*_{
h
},*v*_{
t
}) if *q*_{1}=*p*_{2}, *e*=(*u*_{
h
},*v*_{
h
}) if *q*_{1}=*q*_{2}, *e*=(*u*_{
t
},*v*_{
t
}) if *p*_{1}=*p*_{2}, and *e*=(*u*_{
t
},*v*_{
h
}) if *p*_{1}=*q*_{2}. Again, there may be several adjacency edges connecting the same two vertices. Thus, the Enredo graph is also a multi-graph.

Due to its two-vertex concept, the structure of an Enredo graph *G* reflects the relative orientation of blocks as opposed to the alignment graph structure and the A-Bruijn graph structure (see Figure 5). *G* is capable of displaying inversions. But just like A-Bruijn graphs, threading a genome with duplications through *G* can be ambiguous (see Figure 6). The path from threading a genome through *G* alternates between block and adjacency edges. Therefore, only multiple occurrences of a block in the same orientation create ambiguity in *G*.

*G*, we define the sparse labeling function ${\ell}^{\mathit{\text{dup}}}:{E}_{A}\to \mathbb{N}$ as a total ordering on the adjacency edges. As for A-Bruijn graphs, we can use the labeling function

*ℓ*to determine the adjacency position of an edge

*e*∈

*E*

_{ A }. The function

*ℓ*

^{ d u p }assigns again numbers to the edges

*E*

_{ A }such that

where *a*_{1} is the adjacency position of *e*_{1}, and *a*_{2} is the adjacency positions of *e*_{2}. As an example, we use again Figure 6 with labels 1 through 8: One of the edges from the head of A to the tail of B would be labeled with 1; for genome ABDABCEBC, the edge from the head of B to the tail of D would be labeled with 2, and for genome ABCEBDABC, the edge from the head of B to the tail of C would be labeled with 2; and so on.

We generalize the Enredo graph compared to its original definition [39] in some aspects. Enredo graphs originally consider blocks of size 1 as adjacencies: Instead of a block edge with two end vertices that are connected to the rest of the graph by two adjacency edges, the Enredo method only adds a single adjacency edge labeled with a segment. This requires another function *ℓ*_{
A
}:*E*_{
A
}→*S* that labels adjacency edges *E*_{
A
} with segments *S*. In addition, in the initial phase of the Enredo method segments on adjacency edges between the same two blocks are assumed to be homologous. Because of this assumption and to distinguish non-homologous multi-edges later on, the Enredo method prefers the multi-graph representation with multiplicity labels on one adjacency edge over multiple separate edges. We argue that all segments that are assumed to be homologous should be defined as blocks. Consequently, our description with blocks of size 1 is valid and even simplifies the exposition of the method.

Furthermore, the Enredo method only adds edges for adjacencies that are shorter than a predefined threshold. This results already in a partial segmentation of the genomes bearing several segments per genome in the graph. Parts of the genomes may not be represented. We add all adjacencies to the graph and leave it to later stages to modify the graph.

In the transformations below, we include the replacement of labeled adjacencies by blocks of size 1. The transformation from an Enredo graph structure to an A-Bruijn graph structure is possible without additional labels. The other direction, from A-Bruijn graphs to Enredo graphs, requires additional information about inversions as shown by the example in Figure 5.

##### Enredo graphs from A-Bruijn graphs

First, we describe the transformation of an A-Bruijn graph structure *G*^{′}=(*V*^{′},*E*^{′}) into an Enredo graph structure *G*=(*V*,*E*_{
B
}∪*E*_{
A
}) using the labeling function *ℓ*^{
i
n
v
}:*E*^{′}→{+,−}×{+,−}. Then, we describe the transformation of blocks of size 1 to labeled adjacency edges in the Enredo graph given full block information by the function *ℓ* for transferring labels.

To transform *G*^{′} into *G*, add for each A-Bruijn graph vertex *v*^{′}∈*V*^{′} a tail vertex *v*_{
t
} and a head vertex *v*_{
h
} to the set of Enredo graph vertices *V*. Additionally, add an undirected edge *e*_{
b
} between *v*_{
t
} and *v*_{
h
} to the set of Enredo graph block edges *E*_{
B
}. We obtain a one-to-one mapping of A-Bruijn graph vertices and Enredo graph block edges, which we keep as separate labels *m*:*V*^{′}→*E*_{
B
} on A-Bruijn graph vertices such that *m*[ *v*^{′}]=*e*_{
b
}.

Using the labeling function *ℓ*^{
i
n
v
} and the mapping *m*, we can unambiguously transfer adjacency edges to the Enredo graph. For each edge *e*^{′}=(*u*^{′},*v*^{′}) in the set of A-Bruijn graph edges *E*^{′} where *m*[ *u*^{′}]=*e*_{
u
} and *m*[ *v*^{′}]=*e*_{
v
}, add an edge *e*=(*u*_{
x
},*v*_{
y
}) to the set of Enredo graph adjacency edges *E*_{
A
} where *u*_{
x
} is an endpoint of *e*_{
u
} and *v*_{
y
} is an endpoint of *e*_{
v
}. The vertex *u*_{
x
} is the head vertex of *e*_{
u
} if the first bit in *ℓ*(*e*^{′}) is +, and otherwise the tail vertex. The vertex *v*_{
y
} is the tail vertex of *e*_{
u
} if the second bit in *ℓ*(*e*^{′}) is +, and otherwise the head vertex.

In another step, we can transform all block edges *e*_{
b
}={*v*_{
t
},*v*_{
h
}} representing blocks of size 1 into adjacency edges. Since the size of *ℓ*(*e*_{
b
}) is 1, the corresponding vertices *v*_{
t
} and *v*_{
h
} are incident to exactly one adjacency edge each, *e*_{1}=(*u*_{
x
},*v*_{
t
}) and *e*_{2}=(*v*_{
h
},*w*_{
y
}). Replace such sets of two vertices *v*_{
t
}, *v*_{
h
} and three edges *e*_{1}, *e*_{2}, *e*_{
b
} by a new adjacency edge *e*=(*u*_{
x
},*w*_{
y
}). Finally, transfer the label of the block edge *ℓ*(*e*_{
b
})={*s*} to the adjacency edge such that *ℓ*_{
A
}(*e*)=*s*.

##### Enredo graphs to A-Bruijn graphs

We start by describing how to recover block edges for blocks of size 1 from adjacency edges that are labeled with segments by *ℓ*_{
A
} in an Enredo graph structure *G*=(*V*,*E*_{
B
}∪*E*_{
A
}). Afterwards, we describe the transformation from *G* to an A-Bruijn graph structure *G*^{′}=(*V*^{′},*E*^{′}), which is possible without additional labels.

Replace each edge *e*=(*u*_{
x
},*v*_{
y
}) from the set of Enredo graph adjacency edges *E*_{
A
}, where *ℓ*_{
A
}(*e*)=*s*, by two vertices *v*_{
t
} and *v*_{
h
} and a block edge *e*_{
b
}=(*v*_{
t
},*v*_{
h
}), and set *ℓ*(*e*_{
b
})={*s*}. Further, add *e*_{1}=(*u*_{
x
},*v*_{
t
}) and *e*_{2}=(*v*_{
h
},*v*_{
y
}) to the set of Enredo graph adjacency edges *E*_{
A
}.

For the transformation to an A-Bruijn graph, add for each edge *e*_{
b
}=(*v*_{
h
},*v*_{
t
}) in the set of Enredo graph block edges *E*_{
B
}, a vertex *v*^{′} to the set of A-Bruijn graph vertices *V*^{′}. Again, we obtain a one-to-one mapping of Enredo graph block edges and A-Bruijn graph vertices, which we keep this time as labels *m*:*E*_{
B
}→*V*^{′} on Enredo graph block edges such that *m*[ *e*_{
b
}]=*v*^{′}. Finally, add for each edge *e*=(*u*_{
x
},*v*_{
y
}) in the set of Enredo graph adjacency edges *E*_{
A
} where *u*_{
x
} is incident to the block edge *e*_{
u
} and *v*_{
y
} is incident to the block edge *e*_{
v
}, an edge *e*^{′}=(*u*^{′},*v*^{′}) to the set of A-Bruijn graph vertices, where *m*[ *e*_{
u
}]=*u*^{′} and *m*[ *e*_{
v
}]=*v*^{′}. In this last step, we lose inversion information in the graph’s structure.

#### Cactus graphs

In this section, let *G*=(*V*,*E*) be a cactus graph structure and *M*_{
G
}=(*G*,*ℓ*) be a cactus graph model. Cactus graphs have only one type of edges. We define *ℓ* as a labeling function of the edges *E*. The cactus graph structure *G* stands out from the other graph structures by fulfilling well-defined structural properties: Every edge *e*∈*E* is part of at most one simple cycle, which makes *G* a cactus graph [41], and *G* has an Eulerian circuit [43]. A number of construction steps guarantee these properties.

Let *A* be the set of all adjacencies of segments. The vertices *V* of *G* partition *A* into a set of pairwisely disjoint subsets *Ω*: Each element *ν*∈*Ω* is a subset of *A*, *μ*∩*ν*=*∅* for any two sets *μ*,*ν*∈*Ω*, and $\bigcup _{\nu \in A}\nu =A$. For each subset *ν*∈*Ω*, there is a vertex in *V*. In addition, *G* has one distinct vertex, the *origin*, that represents the start and end of all genomes *ϕ*. In Figure 4, for example, the vertex *ϕ* represents the start and end, the vertex *α*∪*β* represents a subset of twelve adjacencies, the vertex *γ* represents a subset of eleven adjacencies, and the vertex *δ* represents a subset of seven adjacencies. In the vertex *δ*, for example, three of the adjacencies are from the red genome, two from the blue genome, and another two from the green genome as shown in the enlarged vertices. The subsets correspond to subgraphs of the Enredo graph (shaded in gray in Figure 4). All adjacencies at one end of a block are always part of the same subset. We describe the details on how to determine the subsets below in the transformation from Enredo graphs.

The edges *E* of *G* represent blocks just like block edges in Enredo graphs. For each block $b\in {B}_{\mathcal{G}}$, there is an undirected edge *e*={*u*,*v*} in the set of cactus graph edges *E* (black lines in Figure 4). The endpoint *u*∈*V* of *e* represents a subset of adjacencies *μ*∈*Ω* that contains all adjacencies at one end of *b*, and the other endpoint *v*∈*V* represents *ν*∈*Ω* that contains all adjacencies at the other end of *b*. It is possible that *u*=*v*. The function $\ell :E\to {B}_{\mathcal{G}}$ labels each block edge *e*∈*E* with the corresponding block $b\in {B}_{\mathcal{G}}$ such that *ℓ*(*e*)=*b*. With this labeling, recovering ${B}_{\mathcal{G}}$ from *M*_{
G
} is again straightforward.

The cactus graph has no directed edges as found in other graphs. Since vertices of *G* represent segment adjacencies in sets, the size of blocks and the number and precise set of adjacencies remain unclear in the structure. Recovering this information from *G* is impossible as the following examples from Figure 4 demonstrate: The cactus graph structure does not tell how many genomes traverse block F and whether block I and K are adjacent in one of the genomes or not.

Still, each genome corresponds to a (not necessarily simple) path through *G*. With the help of labels we can recover this path. The colored lines in the enlarged vertices in Figure 4 provide the equivalent information as colored adjacency edges in Enredo graphs and would resolve ambiguity for threading if no duplications were present. More information is necessary to resolve all ambiguity. We suggest ${\ell}^{\mathit{\text{adj}}}:E\to {2}^{\{+,-\}\times \mathbb{N}}$, where 2^{
X
} denotes the power set of a set *X*, to label the edges with lists of pairs of an orientation bit and a positive number. The lists have an entry for each segment of the blocks *b*=*ℓ*(*e*). The orientation bits are necessary to determine the relative orientation of segments within blocks that are represented by edges *e*=(*v*,*v*) (see blocks B, C, D, F, G, H, and J in Figure 4). The numbers impose a strict total ordering ≺ on all genome segments *s*_{1},*s*_{2}∈*S* where *s*_{1}≺*s*_{2} if *s*_{1} is left of *s*_{2}.

Cactus graphs are not as independently used as the other genome alignment graphs. The cactus method operates on two graphs, the cactus graph and another graph called the adjacency graph [40]. Interestingly, the latter has the same structure as an Enredo graph. We view the cactus graph, which enables the characterization and detection of new substructures, as a supergraph on top of the Enredo graph. The transformation of Enredo graph structures to cactus graph structures conforms with the construction of a cactus graph [22, 40] and does not require additional labels. The transformation back to Enredo graphs is ambiguous as the above mentioned examples from Figure 4 show. For this reason, our description of this transformation uses the sparse labeling *ℓ*^{
a
d
j
} in addition to the graph structure.

##### Cactus graphs from Enredo graphs

To transform an Enredo graph structure ${G}^{\prime}=({V}^{\prime},{E}_{B}^{\prime}\cup {E}_{A}^{\prime})$ into a cactus graph structure *G*=(*V*,*E*), we follow three steps described in [22, 40]. First, we transform the Enredo graph into a precursor cactus graph. The second and third steps modify the precursor to ensure the structural properties of cactus graphs. The second step guarantees that every edge is part of at most one simple cycle. After the third step, the graph is Eulerian. Throughout all steps, we make use of a many-to-one mapping *m*:*V*^{′}→*V* from Enredo graph vertices *V*^{′} to cactus graph vertices *V*, which labels each Enredo graph vertex *v*^{′}∈*V*^{′} with a cactus graph vertex *v*∈*V* such that *m*[ *v*^{′}]=*v*.

First, compute all *adjacency-edge connected components*${\mathcal{C}}_{A}$ in the Enredo graph structure *G*^{′}. Each component $C\in {\mathcal{C}}_{A}$ is a subset of the vertices *V*^{′}. For each $C\in {\mathcal{C}}_{A}$, add a vertex to the set of cactus graph vertices *V*. Assuming that the start and end of all genomes are connected, add only one origin vertex for all of them to *V*. We obtain the many-to-one mapping that indicates the cactus vertex representing the adjacency edge connected component of any Enredo graph vertex. Given this mapping, transfer the Enredo graph block edges *E*_{
B
} to the cactus graph: For each edge *e*^{′}={*u*^{′},*v*^{′}} in the set of Enredo graph block edges *E*_{
B
}, where *m*[ *u*^{′}]=*u* and *m*[ *v*^{′}]=*v*, add an edge *e*={*u*,*v*} to the set of cactus graph edges *E*. It is possible that *u*=*v* even if *u*^{′}≠*v*^{′}. This yields the precursor cactus graph in Figure 4.

In the second step, remove sets of vertices from *V* that are 3-edge-connected and add instead a single vertex *v* to *V* (vertices *α* and *β* in Figure 4). Correct the mapping *m* and redirect block edges that were incident to any vertex in the 3-edge connected component, to be incident to *v*.

Finally, replace connected components formed only by edges whose removal disconnect the graph (not present in Figure 4). Each such component is a tree with leaf and branching vertices *v*_{1},…,*v*_{
c
}. Remove *v*_{1},…,*v*_{
c
} and add instead a new vertex *v* to *V*. Just as before, correct the mapping *m* and redirect incident block edges to *v*.

##### Cactus graphs to Enredo graphs

In the transformation from a cactus graph structure *G*=(*V*,*E*) to an Enredo graph structure ${G}^{\prime}=({V}^{\prime},{E}_{B}^{\prime}\cup {E}_{A}^{\prime})$, we use the labels *ℓ*^{
a
d
j
} to separate the sets of adjacencies represented by cactus graph vertices *V* and to add edges ${E}_{A}^{\prime}$ that represent single adjacencies to the Enredo graph structure. In addition, we create a one-to-one edge mapping $m:E\to {E}_{B}^{\prime}$ that labels each cactus graph edge *e*∈*E* with an Enredo graph block edge ${e}_{b}^{\prime}\in {E}_{B}^{\prime}$ where ${e}_{b}^{\prime}=\{{u}^{\prime},{v}^{\prime}\}$. In this mapping, we store a direction of each Enredo graph block edge and distinguish the tail vertex *u*^{′} from the head vertex *v*^{′} such that *m*[ *e*]=(*u*^{′},*v*^{′}). The direction is not present in the Enredo graph structure *G*^{′}. The transformation proceeds by threading the genomes
through *G*.

Initially, identify among all cactus graph edges incident to the origin vertex *u*∈*V* the edge *e*_{0}={*u*,*v*} whose label contains the smallest number *n*_{0}∈*ℓ*^{
a
d
j
}(*e*_{0}) where *n*_{0}<*n* and *n*∈*ℓ*^{
a
d
j
}(*e*) with *e*={*u*,*x*}. Add two vertices *u*^{′} and *v*^{′} to the set of Enredo graph vertices *V*^{′} and an edge ${e}_{b}^{\prime}=\{{u}^{\prime},{v}^{\prime}\}$ to the set of Enredo graph block edges ${E}_{B}^{\prime}$. Update the mapping such that *m*[ *e*_{0}]=(*u*^{′},*v*^{′}). Keep a reference to *v*^{′} for the next step.

Among all edges incident to *v*, identify the next edge *e*_{1}=(*v*,*w*) whose label contains the next larger number *n*_{1}∈*ℓ*^{
a
d
j
}(*e*_{1}) such that *n*_{1}>*n*_{0} but *n*_{1}<*n* where *n*≠*n*_{0} and *n*∈*ℓ*^{
a
d
j
}(*e*) with *e*={*v*,*x*}. If the mapping for *e*_{1} is undefined, add two vertices *v*^{′′} and *w*^{′} to the set of Enredo graph vertices *V*^{′} and an edge ${e}_{b}^{\prime}=\{{v}^{\mathrm{\prime \prime}},{w}^{\prime}\}$ to the set of Enredo graph block edges ${E}_{B}^{\prime}$. Update the mapping such that *m*[ *e*_{1}]=(*v*^{′′},*w*^{′}). Further, add an edge ${e}_{a}^{\prime}=({v}^{\prime},{v}^{\mathrm{\prime \prime}})$ to the set of Enredo graph adjacency edges *E*_{
A
} and keep *w*^{′} for the next step. If the mapping for *e*_{1} is already defined with *m*[ *e*_{1}]=(*v*^{′′},*w*^{′}), only add an adjacency edge: If the orientation bit in *ℓ*^{
a
d
j
}(*e*_{1}) is +, add the edge ${e}_{a}^{\prime}=({v}^{\prime},{v}^{\mathrm{\prime \prime}})$ to the set of Enredo graph adjacency edges *E*_{
A
} and keep *w*^{′} for the next step. If the orientation bit is −, add an edge ${e}_{a}^{\prime}=({v}^{\prime},{w}^{\prime})$ and keep *v*^{′′} for the next step.

Next, repeat the same for incident edges of *w*. Proceed like this until reaching the end of all genomes to obtain the full Enredo graph structure *G*^{′}.

All in all, the need for labels shows that the four graphs markedly differ in the information represented in their structures. Complete duplication information (dup) is only present in alignment graph structures, and only the structure of Enredo graphs reveals inversion information (inv). A-Bruijn graphs are a compact and intuitive representation but lack both inversion and duplication information. Finally, cactus graph structures do not represent parts of the adjacency information (adj). Despite these structural differences, all graph models, which include labels, can be transformed into each other.

Based on these observations, some advantages or disadvantages of the graph structures become apparent. For example, for a genome aligner intended to reveal inversions, an Enredo graph structure appears to be more suitable, whereas a more general analysis of the genetic content of genomes will work well with the more compact A-Bruijn graph structure. Duplications are best visible in an alignment graph structure. The advantage and information provided by cactus graphs subdivides genomes into independent regions revealing specific and unique substructures as described in the following.

### Graph substructures

We collected substructures from graph-based genome alignment approaches and classify them here into four types: colinear paths, visiting blocks, short cycles, and cactus groups. Substructures are useful for deriving a meaningful genome segmentation or they indicate misalignment, i. e., the alignment of non-homologous segments. Furthermore, they pinpoint parts of genome alignments that can be improved through modification.

Some substructures have been described for several graph-based approaches, while others are unique to only one approach. We conjecture that it is possible to identify all substructures in all graph *models*. If the time complexity for detecting occurrences of the substructures was the same in all graphs models, they could be used interchangeably. Here, our aim is to analyze abilities of the graph *structures* to reveal potential misalignments without additional information from labels.

#### Colinear paths

We refer to the first type of substructures as *colinear paths*. Colinear paths are sets of blocks that appear in one or more genomes consecutively in the same orientation and without breakpoints in between. A sequence of blocks *b*_{1},…,*b*_{
k
} forms a colinear path if there is an adjacency but no breakpoint between *b*_{
i
} and *b*_{i+1} for all *i*=1,…,*k*−1. Consequently, all blocks along a colinear path have the same size and there are segments *s*_{1}∈*b*_{1} and *s*_{
k
}∈*b*_{
k
} with *s*_{1}=(*p*_{1},*q*_{1}) and *s*_{
k
}=(*p*_{
k
},*q*_{
k
}) such that *s*=(*p*_{1},*q*_{
k
}) is a consecutive genome segment that concatenates one segment from each block *b*_{1},…,*b*_{
k
}. We also consider a single block as a colinear path.

A colinear path is *maximal* if it cannot be further extended by other adjacent blocks, but is bounded by breakpoints. Note that alignment modifications often remove bounding breakpoints such that a colinear path can again be further extended. The set of maximal colinear paths of a genome alignment determines the final genome segmentation. Independent from the underlying graph structure, all graph-based genome alignment methods have the common aim to maximize colinear paths both in terms of size (number of genome segments) and length (total segment lengths).

In Enredo graphs, simple non-branching paths are colinear paths. Similarly, colinear paths appear as non-branching paths in the A-Bruijn graph structure, but here a non-branching path is not necessarily a colinear path. Along a non-branching path in A-Bruijn graphs, one or more blocks can be inverted in a subset of the genomes. The structure of A-Bruijn graphs provides no information about inversions (see Figure 5). Thus, to detect colinear paths in A-Bruijn graphs, information from labels is necessary. Only a single vertex is detectable as (not necessarily maximal) colinear path in the structure of A-Bruijn graphs. The same holds for the alignment graph structure: The detection of consecutive blocks is straightforward, but in order to avoid the inclusion of inverted blocks that break colinearity, additional information about inversions is necessary. And finally, colinear paths appear in the cactus graph structure as non-branching paths although non-branching paths are not necessarily colinear paths.

##### Visiting blocks

We name the second type of substructure *visiting block*, which conceptually is a special type of a maximal colinear path. A maximal colinear path {*b*_{1},…,*b*_{
k
}} is a visiting block if there is a block *b*_{0} adjacent to *b*_{1} and a block *b*_{k+1} adjacent to *b*_{
k
} with the following two symmetric conditions (without loss of generality, we assume that the tail of *b*_{0} is adjacent to the head of *b*_{1} and the tail of *b*_{
k
} is adjacent to the head of *b*_{k+1}): For all segments *s*=(*p*_{1},*q*_{
k
}) of the colinear path that are adjacent at position *p*_{1} to a segment *s*_{0}∈*b*_{0}, there is a segment *s*_{k+1}∈*b*_{k+1} adjacent to *s* at position *q*_{
k
}; and for all segments *s*=(*p*_{1},*q*_{
k
}) that are adjacent at position *q*_{
k
} to a segment *s*_{k+1}∈*b*_{k+1}, there is a segment *s*_{0}∈*b*_{0} adjacent to *s* at position *p*_{1}. The important property is that all segments from block *b*_{0} that are adjacent to segments of the colinear path, continue in the same block *b*_{k+1} at the other end of the colinear path and vice versa.

A visiting block arises from merging blocks from within a colinear path with other blocks. If the merged blocks are short, they often only have spurious similarity. Hence, they break colinearity at two positions without providing much evidence for a large structural change. This is a reason why genome aligners address visiting blocks and separate the otherwise colinear paths.

Visiting blocks have been described for A-Bruijn graphs as microblocks [38] and also for Enredo graphs both implicitly in the “joining” operation and explicitly as a first type of “aberrant homologies” [39]. Furthermore, we view another type of “aberrant homologies” from Enredo graphs as a special case of this substructure: retrotransposed pseudogenes that cause a series of successive visiting blocks.

##### Short cycles

Cycles in genome alignments are indicators for rearrangement. A change in one of two identical genomes often introduces a cycle in the corresponding genome alignment. In the same way, spurious similarity causes cycles and breaks colinearity. If there are many cycles, they often hide significant colinearity. For this reason, many genome aligners eliminate short cycles.

Specific types of cycles also play a role for colinear sequence alignment. For example, alignment graphs without mixed cycles are colinear alignments [33]. Thus, we can compute colinear alignments by eliminating mixed cycles from alignment graphs. Similarly, the partial order alignment (POA) program [44] uses directed acyclic graphs (DAGs) for alignment representation, essentially A-Bruijn graphs without directed cycles.

We define a genome alignment cycle as a sequence of blocks *b*_{1},…,*b*_{
k
} where block *b*_{
i
} is adjacent to block *b*_{i+1} for all *i*=1,…,*k*−1 and *b*_{
k
} is adjacent to *b*_{1}. Further, we require all sets of positions that define adjacencies between two blocks *b*_{
i
} and *b*_{i+1} along the cycle to be disjoint. Thereby we exclude pairs of adjacent blocks from the set of genome alignment cycles. A cycle is short if the total length of segments along the cycle is below a given length threshold.

In the following, we discuss two characteristics for discriminating between different types of cycles, the orientation of adjacencies and the number of maximal colinear paths. Next, we briefly address the special case of palindromes. In addition, we describe how simple cycles in cactus graphs are used as characteristic substructures although they differ from genome alignment cycles.

###### Orientation of adjacencies

A-Bruijn graphs represent adjacencies as directed edges. This allows classifying cycles into those that follow the direction of edges and those that ignore the direction of edges. Pevzner and colleagues refer to the two types of cycles as whirls and bulges [19, 35]. Whirls are directed, and bulges ignore the direction of edges. The graph-based genome aligner ABA addresses whirls and bulges in A-Bruijn graphs [19].

*one*genome [35], where the classification in whirls and bulges is unambiguous.

###### Number of maximal colinear paths

A genome alignment cycle is formed by complete maximal colinear paths and possibly single additional blocks. For example, the cycle in Figure 10 is formed by the maximal colinear path consisting of the single block *B* and two additional blocks *A* and *C*. *A* and *C* may be part of longer maximal colinear paths. In contrast to the orientation of adjacencies, the number of maximal colinear paths classifies the cycles unambiguously [38].

The A-Bruijn graph based approach DRIMM-Synteny [38] uses a classification of cycles into one-way, two-way, and composite cycles, which is similar but not equivalent to a classification according to the number of maximal colinear paths. DRIMM-Synteny focuses only on one-way and two-way cycles even though there can be cycles formed by more than two paths. The “annealing” operation in Enredo [39] places special emphasis on cycles formed by two maximal colinear paths after each of these paths has been joined to a single adjacency edge. In addition, Enredo addresses all other cycles as the third type of “aberrant homologies”.

###### Palindromes

###### Cactus chains

In cactus graphs, simple cycles are named *chains*[22]. The corresponding subgraphs of cactus chains in Enredo graphs, A-Bruijn graphs, and alignment graphs are not necessarily connected (see blocks *A*, *E*, *I*, *K* in Figure 4). But even though chains do not correspond to continuous segments of genomes, they represent conserved orders of blocks (e. g., blocks *A*, *E*, *I*, *K* in Figure 4 appear in this order in all genomes). Cactus chains are addressed by the Cactus method.

It is possible to identify the subset of blocks forming a cactus chain in the Enredo graph structure, for the simple reason that an Enredo graph can be transformed into a cactus graph. However, it appears impossible to characterize chains in Enredo graphs without computing e. g., 3-edge connected components. In the structure of alignment and A-Bruijn graphs, information about the orientation of adjacent blocks is missing for identifying cactus chains.

##### Cactus groups

Paten et al. refer to adjacency edge connected components, which are computed for constructing a cactus graph, as *groups*[22]. A cactus group is a set of adjacencies that forms an adjacency-edge connected component in the Enredo graph. All adjacencies of one group are represented by one vertex in the cactus graph structure, but a cactus graph vertex can represent several groups. Strictly speaking, cactus groups are visible in the structure of Enredo graphs but not in the structure of cactus graphs. Similarly, it is not possible to recognize groups in the alignment graph and A-Bruijn graph structures because this requires information about the orientation of adjacent blocks.

In summary, inversion and duplication information is necessary for the complete detection of all substructures. Visiting blocks require duplication information, and all other substructures require inversion information. Hence, none of the four graphs reveals all substructures solely by its structure.

This concludes our classification of substructures on the basis of a not necessarily exhaustive list of substructures. Identification of further substructures or an assessment of their relevance for the accuracy of genome alignments may possibly point towards another way of classifying them.

### Modifications

Graph-based genome aligners modify the genome alignments by eliminating substructures from the graphs. The aim is to reveal long conserved homologies, i. e., blocks of large size and length. As mentioned in the introduction, genome alignment comprises selection of local alignments and segmentation. Here, we describe modifications that eliminate substructures either by modifying the set of local alignments represented in blocks (“splitting blocks” and “merging parallel blocks”) or by determining breakpoint positions that will be part of the final segmentation (“merging consecutive blocks” and “cutting adjacencies”).

These four modifications derive from the mentioned graph-based genome alignment approaches, but they match the operations described for the approaches only in part. Some genome alignment approaches clearly separate block modification and segmentation, other approaches do both tasks together. Similarly, some approaches apply compound operations consisting of several of the modifications described here. Our intention is to provide small modification entities from which it is possible to assemble more complex operations.

We describe every modification on the set of blocks (not on the level of alignment components but on the level of segments). Furthermore, we mention effects of the modifications in the graph structures although they can be applied to a genome alignment independently from a graph structure. We explain how these modifications correspond to operations in the graph-based genome alignment approaches, especially if the correspondence is not obvious. For example, this is the case for DRIMM-Synteny [38], which solves the sequence modification problem (SMP) on A-Bruijn graphs. The method modifies the sequences and determines the segmentation on the modified sequences before transforming the sequences back. We transfer the effects directly to the original sequences and set of blocks, and refer to the modifications accordingly. The four modifications cover all operations described in the programs ABA, DRIMM-Synteny, Enredo, and Cactus.

#### Splitting blocks

The most prevalent modification is splitting a block by dividing its set of segments into subsets that form new smaller blocks. Formally, the modification replaces a block *b*={*s*_{1},…,*s*_{
n
}}, where *n*≥2 is the size of *b*, by two blocks *b*_{1}={*s*_{1},…,*s*_{
k
}} and *b*_{2}={*s*_{k+1},…,*s*_{
n
}}, 1≤*k*<*n*. The new blocks may have size 1, thus may consist of a single segment. Transferred to the original set of local alignments from which the blocks were formed, this modification corresponds to removing local alignments. In some cases, it is enough to remove a single pairwise local alignment to split a block into two blocks. In other cases, a particular subset of the local alignments needs to be removed simultaneously.

Graph-based genome aligners eliminate many substructures using this modification. By splitting blocks, we can clearly modify a graph so as to eliminate visiting blocks (see Figure 8), which is done in the programs DRIMM-Synteny and Enredo. While Enredo splits a block into two blocks of arbitrary size, DRIMM-Synteny splits single segments from a block, thus creating blocks of size 1. Additionally, this modification can eliminate small cycles, e. g., whirls in A-Bruijn graphs [35] and mixed cycles in alignment graphs. Further, the sequence modifications in DRIMM-Synteny for one-path cycles and palindromes result in the splitting of segments from blocks. Finally, the “melting” operation in the Cactus method splits all blocks along a cactus chain into blocks of size 1.

##### Merging parallel blocks

The opposite to block splitting is a modification that merges blocks by adding local alignments between segments of the blocks. To merge two blocks *b*_{1}={*s*_{1},…,*s*_{
k
}} and *b*_{2}={*s*_{k+1},…,*s*_{
n
}} of size *k* and size *n*−*k*, respectively, into a new block *b*={*s*_{1},…,*s*_{
n
}} of size *n*, it is sufficient to add a local alignment of two segments *s*_{
i
}∈*b*_{1} and *s*_{
j
}∈*b*_{2}. Such local alignments can be new or previously removed by splitting blocks. Note that merging of parallel blocks implicitly aligns all segments of the two blocks.

The effect on the graph structures is the reverse of block splitting. In the alignment graph structure, it corresponds to adding block edges. In the A-Bruijn graph structure two vertices are replaced by a single vertex. In the Enredo graph structure, two block edges with head and tail vertices are being replaced by a single block edge with one head and one tail vertex. In the cactus graph structure, merging of parallel blocks can lead to complex rearrangements just as splitting of blocks. The result is typically a longer chain or a new sub-cactus.

Graph-based genome alignment approaches usually merge blocks based on the structure of surrounding blocks. Two-way cycles and bulges in A-Bruijn graphs and Enredo graphs are substructures that suggest to merge parallel blocks [38, 39]. Furthermore, the genome segments within cactus groups are more likely to be homologous than others, hence, subject to merging [22]. Both in Enredo and in cactus graphs, the modification is termed “annealing”.

##### Merging consecutive blocks

The preceding two modifications often generate new or longer colinear paths. It is possible to replace the consecutive blocks of a colinear path by a new longer block that rules out the possibility of a breakpoint between the merged blocks. The modification replaces two adjacent blocks *b*_{1}={*s*_{1},…,*s*_{
n
}} and ${b}_{2}=\{{s}_{1}^{\prime},\dots ,{s}_{n}^{\prime}\}$ without breakpoint in between by a longer block *b* that is formed by the concatenation of all adjacent segments *s*_{
i
} and ${s}_{i}^{\prime}$ where *i*=1,…,*n*. Merging consecutive blocks does not directly affect the alignment of the genomes, but simplifies the graph structures and also genome segmentation.

The effects on the graphs are straightforward. In the alignment graph structure, a single vertex replaces each pair of vertices in two adjacent block edge connected components. In the A-Bruijn graph structure, one vertex replaces two consecutive vertices. In the Enredo graph structure, one block edge replaces a path consisting of a block edge, adjacency edge, and another block edge. And similarly in the cactus graph structure, one block edge replaces a path of a block edge, a vertex, and another block edge, thereby reducing the number of vertices in a chain.

Merging consecutive blocks is part of the “joining” operation in the Enredo method [39]. The other approaches do not apply this modification.

##### Cutting adjacencies

As opposed to merging consecutive blocks, the last modification fixes a breakpoint in the genome alignment by cutting genomes into several segments. For example, given a block *b*={*s*_{1},…*s*_{
n
}} with *s*_{
i
}=(*p*_{
i
},*q*_{
i
}) where *i*=1,…,*n* and with a breakpoint at the tail of *b*, the modification cuts the genomes at all positions *q*_{
i
}. The modification does not affect the set of blocks but rather the set of genomes. Thus, it is part of the genome segmentation process.

Cutting adjacencies corresponds to removing a single edge from an A-Bruijn graph structure, a single adjacency edge from an Enredo graph structure, or a set of adjacency edges from an alignment graph structure. Again, there are multiple possible effects in a cactus graph structure. In the simplest case, the cactus graph structure remains unchanged. In all graphs, the removal of edges can disconnect the graph structures, generating several components that correspond to disjoint sets of genome segments. Thus, it can become impossible to thread the genomes through the graphs without additional effort [35, 38].

Cutting adjacencies is used in various ways by genome alignment approaches. The ABA method cuts adjacencies for eliminating bulges from A-Bruijn graphs and the Enredo method for eliminating small cycles in general. In addition, the segmentation processes in A-Bruijn and Enredo graphs implicitly use this modification: In DRIMM-Synteny, segmentation is realized by coloring the graph. In Enredo, it is realized by excluding adjacencies shorter than a given length threshold. Genome segmentation in alignment graphs and cactus graphs has not been described explicitly.

## Discussion and conclusions

We compared four graph data structures and their usage for genome alignment. Our comparison identified that essential pieces of information about duplication and inversion are only present in the structures of some graphs. In addition, we examined substructures in the graph structures that are subject to elimination in various genome alignment approaches, and determined four classes of substructures. We found that information about duplications or information about inversions or even both are necessary for distinguishing any type of substructure in the graphs. Thus, it is indeed essential to keep additional information in labels of the vertices or edges, though the different graphs depend on the labels to a lesser or greater extent. Finally, we reduced the set of operations applied for eliminating substructures from the graphs to four elementary modifications. Overall, it became apparent that many ideas are shared by all graph-based approaches.

This framework describes the main procedure of graph-based genome alignment. Still, it has limitations and there are additional problems to be solved. One such problem addresses blocks and occurs before building a graph. If we do not break up the local colinear alignments into alignment components, blocks may in general partially overlap. It is possible to resolve overlapping blocks by trimming [45] or avoid overlaps by requiring local alignments to be sparse [39]. A good alternative, which is for example used by the genome aligner Mugsy [21], is to obtain a set of mutually disjoint blocks by refining segment matches [46]. A segment match refinement resolves overlaps through modest computation without losing any alignment information.

In addition, the generation of blocks (multiple alignments) from pairwise alignments may pose a problem. There are only few exceptions of genome aligners that avoid the problem by directly computing local multiple alignments [45, 47]. If we assume transitivity of the alignment relation, it is straightforward to go from local pairwise alignments to alignment components or to multiple ungapped alignments. In the case of gapped alignments however, pairwise alignments can have conflicting gap patterns. This complicates the task of combining them to a single block. Heuristic methods such as progressive alignment [7] or transitive alignment [9] carry out this task, but are time consuming. Having said that, a colinear realignment for each block carried out after finishing segmentation has proven to significantly improve alignment accuracy [45, 48]. This suggests the alternative to ignore gaps in blocks while improving the genome alignment on the level of blocks.

Further, we have not covered all aspects of the framework in this paper and left out details on the detection of substructures. For example, ABA and DRIMM-Synteny detect small cycles by efficiently computing a maximum spanning tree before heuristically inspecting the remaining edges that create cycles. Different detection methods clearly have an influence on the time complexity of an approach and, depending on their sensitivity, also on the accuracy of a genome aligner. Thus, a thorough analysis of detection methods is certainly interesting but beyond the scope of this work.

Similarly, we have not addressed algorithms for eliminating substructures. These algorithms determine the order in which modifications are applied. The elimination of one type of substructures can create other substructures, which again can create the first type of substructures upon elimination. For this reason, iterative elimination strategies are prevalent in graph-based genome aligners. End criteria for iteration are typically given as parameters of the method, e. g., a maximal length of cycles or an explicit number of iterations.

The parameters usually require customized values for every new input set of genomes. Usually, this inhibits broad usage of tools if automatic parameter selection is not offered. A genome aligner has to find a trade-off between size and length of blocks. Very similar genomes will have long blocks conserved across many genomes, whereas more diverged genomes show fewer long blocks and conservation across fewer genomes. Hence, a factor to consider for parameter selection is genome divergence in addition to genome lengths. Given the initial set of local alignments, automatic parameter selection seems possible. It will be necessary to carefully study the influence of all factors to be able to automate the selection, but consequently it will enable a larger community to benefit from graph-based genome aligners.

Finally, graph-based genome aligners, just as other genome aligners, have to decide between positional homology alignment [49] or alignment of all repeats. More precisely, they have to decide, for segments with multiple copies in several genomes, whether to align them in one or in multiple blocks. Not only do repeats lead to a quadratic explosion in the number of pairwise alignments, but they also hide larger regions of colinearity. For this reason, several genome aligners aim at aligning less and predict positional homology [17, 21, 45]. Graph-based genome aligners compute positional homology to a certain degree. They do not forbid duplications, but separate blocks into positional homologs when splitting blocks.

In conclusion, our framework demonstrates shared aspects of graph-based genome aligners. It contributes to developing a common view on graph-based genome alignment, an active field of research with currently at least two graph-based tools for genome alignment being actively developed [50, 51]. In the future, we might identify the steps that have the greatest influence on alignment accuracy. Already now, we believe that the framework provides assistance for the development of new and improved genome aligners.

## Declarations

### Acknowledgements

The authors thank Falk Hüffner for his comments on the manuscript and René Rahn for proofreading. KT and MH were supported by the DFG SPP1307 grants RE-1712/3-1 and RE-1712/3-2.

## Authors’ Affiliations

## References

- Zerbino DR, Paten B, Haussler D: Integrating genomes. Science. 2012, 336 (6078): 179-182. 10.1126/science.1216830.View ArticlePubMedGoogle Scholar
- Smith TF, Waterman MS: Identification of common molecular subsequences. J Mol Biol. 1981, 147: 195-197. 10.1016/0022-2836(81)90087-5.View ArticlePubMedGoogle Scholar
- Dewey CN: Whole-genome alignment. Methods Mol Biol. 2012, 855: 237-257. 10.1007/978-1-61779-582-4_8.View ArticlePubMedGoogle Scholar
- Kemena C, Notredame C: Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics. 2009, 25 (19): 2455-2465. 10.1093/bioinformatics/btp452.View ArticlePubMed CentralPubMedGoogle Scholar
- Blackburne BP, Whelan S: Class of multiple sequence alignment algorithm affects genomic analysis. Mol Biol Evol. 2012, 30 (3): 642-653.View ArticlePubMedGoogle Scholar
- Feuk L, Carson AR, Scherer SW: Structural variation in the human genome. Nat Rev Genet. 2006, 7 (2): 85-97.View ArticlePubMedGoogle Scholar
- Feng DF, Doolittle RF: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J Mol Evol. 1987, 25 (4): 351-360. 10.1007/BF02603120.View ArticlePubMedGoogle Scholar
- Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 1994, 22 (22): 4673-4680. 10.1093/nar/22.22.4673.View ArticlePubMed CentralPubMedGoogle Scholar
- Notredame C, Higgins DG, Heringa J: T-Coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol. 2000, 302: 205-217. 10.1006/jmbi.2000.4042.View ArticlePubMedGoogle Scholar
- Katoh K, Misawa K, Kuma K, Miyata T: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 2002, 30 (14): 3059-3066. 10.1093/nar/gkf436.View ArticlePubMed CentralPubMedGoogle Scholar
- Brudno M, Do CB, Cooper GM, Kim MF, Davydov E, Green ED, Sidow A, Batzoglou S, NISC Comparative Sequencing Program: LAGAN and Multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA. Genome Res. 2003, 13 (4): 721-731. 10.1101/gr.926603.View ArticlePubMed CentralPubMedGoogle Scholar
- Edgar RC: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 2004, 32 (5): 1792-1797. 10.1093/nar/gkh340.View ArticlePubMed CentralPubMedGoogle Scholar
- Do CB, Mahabhashyam MSP, Brudno M, Batzoglou S: ProbCons: probabilistic consistency-based multiple sequence alignment. Genome Res. 2005, 15 (2): 330-340. 10.1101/gr.2821705.View ArticlePubMed CentralPubMedGoogle Scholar
- Löytynoja A, Goldman N: An algorithm for progressive multiple alignment of sequences with insertions. Proc Natl Acad Sci USA. 2005, 102 (30): 10557-10562. 10.1073/pnas.0409137102.View ArticlePubMed CentralPubMedGoogle Scholar
- Rausch T, Emde AK, Weese D, Döring A, Notredame C, Reinert K: Segment-based multiple sequence alignment. Bioinformatics. 2008, 24 (16): i187-i192. 10.1093/bioinformatics/btn281.View ArticlePubMedGoogle Scholar
- Bradley RK, Roberts A, Smoot M, Juvekar S, Do J, Dewey C, Holmes I, Pachter L: Fast statistical alignment. PLoS Comput Biol. 2009, 5 (5): e1000392-10.1371/journal.pcbi.1000392.View ArticlePubMed CentralPubMedGoogle Scholar
- Blanchette M, Kent WJ, Riemer C, Elnitski L, Smit AFA, Roskin KM, Baertsch R, Rosenbloom K, Clawson H, Green ED, Haussler D, Miller W: Aligning multiple genomic sequences with the threaded blockset aligner. Genome Res. 2004, 14 (4): 708-715. 10.1101/gr.1933104.View ArticlePubMed CentralPubMedGoogle Scholar
- Darling ACE, Mau B, Blattner FR, Perna NT: Mauve: multiple alignment of conserved genomic sequence with rearrangements. Genome Res. 2004, 14 (7): 1394-1403. 10.1101/gr.2289704.View ArticlePubMed CentralPubMedGoogle Scholar
- Raphael B, Zhi D, Tang H, Pevzner P: A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Res. 2004, 14 (11): 2336-2346. 10.1101/gr.2657504.View ArticlePubMed CentralPubMedGoogle Scholar
- Dubchak I, Poliakov A, Kislyuk A, Brudno M: Multiple whole-genome alignments without a reference organism. Genome Res. 2009, 19 (4): 682-689. 10.1101/gr.081778.108.View ArticlePubMed CentralPubMedGoogle Scholar
- Angiuoli SV, Salzberg SL: Mugsy: fast multiple alignment of closely related whole genomes. Bioinformatics. 2011, 27 (3): 334-342. 10.1093/bioinformatics/btq665.View ArticlePubMed CentralPubMedGoogle Scholar
- Paten B, Earl D, Nguyen N, Diekhans M, Zerbino D, Haussler D: Cactus: algorithms for genome multiple sequence alignment. Genome Res. 2011, 21 (9): 1512-1528. 10.1101/gr.123356.111.View ArticlePubMed CentralPubMedGoogle Scholar
- El-Mabrouk N, Sankoff D: Analysis of gene order evolution beyond single-copy genes. Methods Mol Biol. 2012, 855: 397-429. 10.1007/978-1-61779-582-4_15.View ArticlePubMedGoogle Scholar
- Sankoff D, Blanchette M: The median problem for breakpoints in comparative genomics. Computing and Combinatorics, Volume 1276 of Lecture Notes in Computer Science. Edited by: Jiang T, Lee D. 1997, Heidelberg: Springer Berlin, 251-263.Google Scholar
- Kehr B, Reinert K, Darling AE: Hidden breakpoints in genome alignments. Algorithms in Bioinformatics, Volume 7534 of Lecture Notes in Computer Science. Edited by: Raphael B, Tang J. 2012, Berlin Heidelberg: Springer, 391-403.Google Scholar
- Hannenhalli S, Pevzner PA: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM. 1999, 46: 1-27. 10.1145/300515.300516.View ArticleGoogle Scholar
- Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005, 21 (16): 3340-3346. 10.1093/bioinformatics/bti535.View ArticlePubMedGoogle Scholar
- Bergeron A, Mixtacki J, Stoye J: A unifying view of genome rearrangements. Algorithms in Bioinformatics, Volume 4175 of Lecture Notes in Computer Science. Edited by: Bücher P, Moret BM. 2006, Berlin Heidelberg: Springer, 163-173.Google Scholar
- Alekseyev MA, Pevzner PA: Breakpoint graphs and ancestral genome reconstructions. Genome Res. 2009, 19 (5): 943-957. 10.1101/gr.082784.108.View ArticlePubMed CentralPubMedGoogle Scholar
- Bafna V, Pevzner PA:
*Genome rearrangements and sorting by reversals*. 1993,View ArticleGoogle Scholar - Kececioglu JD, Sankoff D: Efficient bounds for oriented chromosome inversion distance. Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, CPM ’94. 1994, Berlin Heidelberg: Springer, 307-325.View ArticleGoogle Scholar
- Kececioglu J: The maximum weight trace problem in multiple sequence alignment. Proceedings of the 4th Symposium on Combinatorial Pattern Matching (CPM), Volume 684 of Lecture Notes in Computer Science. 1993, Berlin Heidelberg: Springer, 106-119.Google Scholar
- Reinert K, Lenhof HP, Mutzel P, Mehlhorn K, Kececioglu JD: A branch-and-cut algorithm for multiple sequence alignment. Proceedings of the first annual international conference on Computational molecular biology. 1997, RECOMB ’97, New York, NY, USA: ACM, 241-250.Google Scholar
- Fostier J, Proost S, Dhoedt B, Saeys Y, Demeester P, de Peer YV, Vandepoele K: A greedy, graph-based algorithm for the alignment of multiple homologous gene lists. Bioinformatics. 2011, 27 (6): 749-756. 10.1093/bioinformatics/btr008.View ArticlePubMedGoogle Scholar
- Pevzner PA, Tang H, Tesler G: De novo repeat classification and fragment assembly. Genome Res. 2004, 14 (9): 1786-1796. 10.1101/gr.2395204.View ArticlePubMed CentralPubMedGoogle Scholar
- de Bruijn NG: A combinatorial problem. Proc Nederl Akad Wetensch. 1946, 49: 758-764.Google Scholar
- Compeau PEC, Pevzner PA, Tesler G: How to apply de Bruijn graphs to genome assembly. Nat Biotechnol. 2011, 29 (11): 987-991. 10.1038/nbt.2023.View ArticlePubMedGoogle Scholar
- Pham SK, Pevzner PA: DRIMM-Synteny: decomposing genomes into evolutionary conserved segments. Bioinformatics. 2010, 26 (20): 2509-2516. 10.1093/bioinformatics/btq465.View ArticlePubMedGoogle Scholar
- Paten B, Herrero J, Beal K, Fitzgerald S, Birney E: Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs. Genome Res. 2008, 18 (11): 1814-1828. 10.1101/gr.076554.108.View ArticlePubMed CentralPubMedGoogle Scholar
- Paten B, Diekhans M, Earl D, John JS, Ma J, Suh B, Haussler D: Cactus graphs for genome comparisons. J Comput Biol. 2011, 18 (3): 469-481. 10.1089/cmb.2010.0252.View ArticlePubMedGoogle Scholar
- Harary F, Uhlenbeck GE: On the number of husimi trees: I. Proc Natl Acad Sci USA. 1953, 39 (4): 315-322. 10.1073/pnas.39.4.315.View ArticlePubMed CentralPubMedGoogle Scholar
- Belal NA, Heath LS: A theoretical model for whole genome alignment. J Comput Biol. 2011, 18 (5): 705-728. 10.1089/cmb.2010.0101.View ArticlePubMedGoogle Scholar
- Cormen TH, Stein C, Rivest RL, Leiserson CE: Introduction to Algorithms. 2001, Cambridge, MA, USA: The MIT PressGoogle Scholar
- Lee C, Grasso C, Sharlow MF: Multiple sequence alignment using partial order graphs. Bioinformatics. 2002, 18 (3): 452-464. 10.1093/bioinformatics/18.3.452.View ArticlePubMedGoogle Scholar
- Darling AE, Mau B, Perna NT: progressiveMauve: multiple genome alignment with gene gain, loss and rearrangement. PLoS One. 2010, 5 (6): e11147-10.1371/journal.pone.0011147.View ArticlePubMed CentralPubMedGoogle Scholar
- Halpern AL, Huson DH, Reinert K: Segment match refinement and applications. Proceedings of the Second International Workshop on Algorithms in Bioinformatics, WABI ’02. 2002, Berlin Heidelberg: Springer, 126-139.View ArticleGoogle Scholar
- Höhl M, Kurtz S, Ohlebusch E: Efficient multiple genome alignment. Bioinformatics. 2002, 18 Suppl 1: S312-S320.View ArticlePubMedGoogle Scholar
- Gotoh O: Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J Mol Biol. 1996, 264 (4): 823-838. 10.1006/jmbi.1996.0679.View ArticlePubMedGoogle Scholar
- Dewey CN: Positional orthology: putting genomic evolutionary relationships into context. Brief Bioinform. 2011, 12 (5): 401-412. 10.1093/bib/bbr040.View ArticlePubMed CentralPubMedGoogle Scholar
- Hickey G, Paten B: Progressive Cactus. [https://github.com/glennhickey/progressiveCactus],
- Minkin I, Patel A, Kolmogorov M, Vyahhi N, Pham S: Sibelia: a scalable and comprehensive synteny block generation tool for closely related microbial genomes. Algorithms in Bioinformatics, Volume 8126 of Lecture Notes in Computer Science. Edited by: Darling A, Stoye J. 2013, Berlin Heidelberg: Springer, 215-229.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.