 Research
 Open Access
 Published:
ProCARs: Progressive Reconstruction of Ancestral Gene Orders
BMC Genomicsvolume 16, Article number: S6 (2015)
Abstract
Background
In the context of ancestral gene order reconstruction from extant genomes, there exist two main computational approaches: rearrangementbased, and homologybased methods. The rearrangementbased methods consist in minimizing a total rearrangement distance on the branches of a species tree. The homologybased methods consist in the detection of a set of potential ancestral contiguity features, followed by the assembling of these features into Contiguous Ancestral Regions (CARs).
Results
In this paper, we present a new homologybased method that uses a progressive approach for both the detection and the assembling of ancestral contiguity features into CARs. The method is based on detecting a set of potential ancestral adjacencies iteratively using the current set of CARs at each step, and constructing CARs progressively using a 2phase assembling method.
Conclusion
We show the usefulness of the method through a reconstruction of the boreoeutherian ancestral gene order, and a comparison with three other homologybased methods: AnGeS, InferCARs and GapAdj. The program, written in Python, and the dataset used in this paper are available at http://bioinfo.lifl.fr/procars/.
Background
The small phylogeny problem consists in reconstructing the ancestral gene orders at the internal nodes of a species tree, given the gene orders of the extant genomes at the leaves of the tree. There exist two main computational approaches for the reconstruction of ancestral gene orders from extant gene orders: rearrangementbased methods, and homologybased methods.
The rearrangementbased methods require a rearrangement model, and consist in finding a rearrangement scenario that minimizes the total rearrangement distance on the branches of the species tree [1–3]. The homologybased methods consist in finding the ancestral gene orders associated with the internal nodes of the species tree, such that the total amount of homoplasy phenomenon observed in the species tree is minimized [4–9]. Homoplasy is a phenomenon by which two genomes in different lineages acquire independently a same feature that is not shared and derived from a common ancestor. For the inference of the ancestral gene order at a tagged internal node, the homologybased methods are usually composed of two steps. The first step consists in detecting a set of potential ancestral contiguity features, by comparison of pairs of extant genomes whose path goes through the ancestor in the species tree. The second step is an assembling phase that requires to compute an accurate conservation score for each potential ancestral feature, based on the species tree. Using these scores, some heuristic algorithms are then used to resolve the conflicts between the ancestral features in order to assemble them into Contiguous Ancestral Regions (CARs). A CAR of an ancestral genome is an ordered sequence of oriented blocks (genes, or synteny blocks) that potentially appear consecutively in this ancestral genome.
In the absence of tangible evolution model, the homologybased methods have the convenience to reconstruct CARs that contain only reliable features inferred from a conservation signal observed in the extant genomes. However, the ancestral genomes reconstructed using homologybased methods are often not completely assembled, as some rearrangement or contentmodifying events might have caused the loss of some ancestral contiguity features in the extant genomes. Thus, the homologybased methods proposed in the literature usually enlarge the condition of contiguity in order to detect more potential ancestral contiguity features, adjacencies between two blocks [5, 6, 9], maximum common intervals of blocks [4, 10, 7], gapped adjacencies [11]. Hence, these different types of contiguity features can be classified according to the tightness of their definition of contiguity. The homologybased methods should then account for this classification when assembling different types of contiguity features. This approach was used in [11] where a method, GapAdj, was presented for iteratively detecting gapped adjacencies. GapAdj uses a progressively relaxed definition of contiguity allowing an increasing number of gaps between ancestral contiguous synteny blocks in extant genomes, and iteratively assembling these gapped adjacencies using a heuristic Traveling Salesman algorithm (TSP). The TSP is applied on a graph whose vertices are synteny blocks, and edges are potential ancestral adjacencies between these blocks.
Here, we follow the same idea, and we present an homologybased method that is based on iteratively detecting and assembling ancestral adjacencies, while allowing some microrearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of nonduplicated blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new nonconflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes. The first originality of the method comes from the usage of the progressively assembled CARs for the detection of ancestral contiguity features allowing microrearrangements. The second originality comes from the assembling method at each iterative step that consists in adding the contiguity features gradually giving priority to the features that minimize the homoplasy phenomenon, rather than relying on a heuristic algorithm for discarding falsepositive features. We discuss the usefulness of the method through a comparison with three other homologybased methods (AnGeS [12], InferCARs [5] and GapAdj [11]) on the same real dataset of amniote genomes for the reconstruction of the boreoeutherian genome.
Preliminaries: genomes, species tree, conserved adjacencies
For the reconstruction of ancestral genomes from extant ones, genomes are represented by identifying homologous conserved segments along their DNA sequences, called synteny blocks. These blocks can be relatively small, or very large fragments of chromosomes. The order and orientation of the blocks, and their distribution on chromosomes may vary in different genomes. A signed block is a block preceded by a sign + or − representing its orientation. By convention, a signed block +a is simply written a. Here we assume that all genomes contain the same set of nonduplicated blocks and consist of several circular or linear chromosomes composed of signed blocks.
For example, consider the five genomes represented at the leaves of the tree in Figure 1. The bullets at the extremities of the chromosomes represent the telomeres of linear chromosomes. Genomes A and B consist of one linear chromosome each, and genomes C, D, and E consist of two linear chromosomes each.
A Contiguous Ancestral Region (CAR) is defined as a potential chromosome of an ancestral genome.
A segment in a genome is an ordered set of signed blocks that appear consecutively in the genome. The length of a segment is the number of blocks composing this segment. In the above example, {b c d e} is a segment of length 4 in the genome A.
Two segments of two different genomes are called syntenic segments if they contain the same set of blocks. For example, the segments {h −g − f d} of genome D and {−d f g h} of genome E are syntenic.
An adjacency in a genome is an ordered pair of two consecutive signed blocks. For example, in the above genomes, (a b) is an adjacency of genomes A, B, C, and E, and (a −b) is an adjacency of genome B. Since a whole chromosome or a segment can always be flipped, we have (x y) = (−y −x). For example, (g −h) = (h −g) is an adjacency shared by genomes B, C, and D.
A species tree on a set of k genomes is a rooted tree with k leaves, where each genome is associated with a single leaf of the tree, and the internal nodes of the tree represent ancestral genomes. For example, Figure 1 shows a species tree on genomes A, B, C, D, and E.
Here, for the reconstruction of ancestral gene orders, we consider an ancestral node of the species tree that has exactly two children resulting from a speciation (blackcolored node in Figure 1). The species partition defined by an ancestral node is the partition of the extant species into three sets: two ingroup sets I_{1} and I_{2} corresponding to the two lineages descending from the ancestor, and one outgroup set O containing all other extant genomes.
A conserved adjacency at an ancestral node of the species tree is an adjacency shared by at least two genomes belonging to at least two different sets of the species partition defined by the ancestral node. Such two genomes are linked by a path that goes through the ancestral node. For example, in Figure 1, (a b) is a conserved adjacency of the blackcolored ancestral node because it is shared by genomes C and E whose path goes through the ancestor. The adjacency (c −e) is also a conserved adjacency of this ancestor because of its presence in genomes D and E.
A conserved adjacency at an ancestral node is considered as a potential adjacency of this ancestor. Homologybased methods for the reconstruction of ancestral gene orders usually consist in, first, detecting all the conserved adjacencies at the ancestral node, and next, assembling these conserved adjacencies into CARs. The difficulty in this assembling phase comes from the conflicts that may exist between some conserved adjacencies. Two adjacencies are called conflicting adjacencies when they involve a same block extremity, and thus they cannot be both present in the same ancestral genome. For example, in Figure 1, the conserved adjacencies (g h) and (g −h) of the blackcolored node are conflicting as they both involve the right extremity of block g. Two adjacencies that are not conflicting are called compatible. A set of adjacencies is said nonconflicting (NC) if all pairs of adjacencies in the set are compatible.
Here, we distinguish two types of conserved adjacency regarding their presence or absence in the three sets of species defined by the considered ancestral node: the two ingroup sets I_{1} and I_{2}, and the outgroup set O. A fullyconserved adjacency is a conserved adjacency that is present in at least one genome of each of the three sets of species. A partlyconserved adjacency is any other conserved adjacency. For example, in Figure 1, (f g) is a fullyconserved adjacency of the blackcolored ancestral node, while all other conserved adjacencies are partlyconserved adjacencies.
The homoplasy cost of an adjacency at a given ancestral node A counts the number of branches linked to this ancestor on which the adjacency would have been gained (right before the ancestor) or lost (after the ancestor) if it was present in the ancestor. It is defined as follows: it is either 0 if the adjacency is fullyconserved at A, or 1 if it is partlyconserved at A, or 2 if it is present in only one of the sets I_{1}, I_{2} and O, or 3 if it is present in none of these sets. Note that if an adjacency has an homoplasy cost of 2 or 3 at the ancestral node A, then the adjacency is not conserved at this node. For example, in Figure 1, the adjacency (f g) has a cost 0, the adjacency (a b) a cost 1, the adjacency (a −b) a cost 2, while the adjacency (a c) has a cost 3.
Method
The homologybased problem considered in this paper for the reconstruction of ancestral gene orders can be stated as follows:
Problem. Given a species tree on a set of extant genomes, each composed of the same set of blocks, and given an ancestral node in this species tree, find a set of CARs at the ancestral node, with a maximum number of adjacencies, that minimizes the total homoplasy cost.
Compared to other homologybased methods for the reconstruction of ancestral gene orders, the progressive method presented in the following consists in adding adjacencies progressively, as opposed to discarding false adjacencies in a single assembling step.
A global description of the progressive method steps is presented in the following, and the refined descriptions are presented next.
Inputs and start
The input of the method is a phylogeny with a tagged ancestral node whose block order is to be reconstructed, and a set of n orthologous blocks that are used to describe the block orders of the genomes at the leaves of the tree. The initialization of the method consists in starting with an initial set of n CARs, each composed of a single block.
Overall idea
The core of the method relies on iteratively computing new block adjacencies in order to concatenate CARs progressively (see Figure 2 that shows the diagram of the method steps). At each step, a set of potential adjacencies is first detected, then the method selects a subset of nonconflicting adjacencies that are added to the current CARs. The following three steps are used iteratively in order to collect the ancestral adjacencies: Step a) consists in detecting the conserved adjacencies and the homoplasy costs of these adjacencies are used to classify and select a subset of nonconflicting adjacencies to be added in current CARs; Step b) consists in resolving conflicts between adjacencies and selecting a subset of nonconflicting adjacencies to be added in current CARs; Step c) consists in detecting some adjacencies not conserved at the ancestral node, but supported by putative genome rearrangement events. In the next paragraphs, we briefly give an overview of each of these steps.
a) Adding nonconflicting conserved adjacencies
This step comes after the initialization phase, or after a step a), or b) or c) that ended up with a nonempty set of added adjacencies. The step begins with the detection of the conserved adjacencies between the current CARs at the ancestral node. Next, the nonconflicting fullyconserved adjacencies are selected in a first phase. Then, the nonconflicting partlyconserved adjacencies that are compatible with all fullyconserved adjacencies are added in a second phase. The set of all conserved adjacencies added in the CARs in this step is denoted by NC. It constitutes a nonconflicting set of adjacencies. The conserved adjacencies not added in this step are stored in a set C and tagged as conflicting adjacencies for a next step b).
b) Resolving conflicts between adjacencies
This step comes after a step a) that ended up with an empty set NC, and a nonempty set C. It considers the set C of adjacencies tagged as conflicting in this last step a). A cost, different from the homoplasy cost, is computed for each of these adjacencies, and a nonconflicting subset C_{ m } of C that has a maximum size and minimizes the sum of the adjacencies costs is computed. This subset of adjacencies is added in the CARs, and the remaining adjacencies of the set C−C_{ m } are discarded permanently.
c) Detecting DCJreliable adjacencies
This step comes after a step a) that ended up with an empty set NC, and an empty set C. It consists in finding new potential adjacencies that are not conserved at the ancestral node (i.e. neither partlyconserved nor fullyconserved). Each of these new potential adjacencies is supported by the presence of an adjacency in the current set of CARs, and two adjacencies in an extant genome G, such that those three adjacencies completed by the new potential adjacency induce a single genome rearrangement event, specifically DoubleCutandJoin (DCJ) events, between the ancestral genome and the genome G. A maximum size nonconflicting subset of the new potential adjacencies is added in the CARs, and the remaining adjacencies are discarded permanently.
We now give the detailed descriptions of Step a), b) and c).
Step a): Detection of nonconflicting conserved adjacencies
In this section, we first explain how the conserved adjacencies are defined. Next, we describe how a subset of nonconflicting adjacencies is selected by giving priority to the fullyconserved adjacencies.
Detection of the conserved adjacencies
We begin by stating the definition of a CAR adjacency in an extant genome at a leaf of the species tree, given the set of CARs in the current step of the method.
Let us recall that a CAR is an oriented sequence of signed blocks. We denote by x the block corresponding to a signed block x in a CAR. A signed CAR is a CAR possibly preceded by − indicating its reverse orientation. For example, if car_x = {a −b c}, then car_x = {−c b − a}.
Let car_a and car_b be two signed CARs in the current set of CARs with car_a = {a_{1} a_{2} ... a_{ n }} and car_b = {b_{1} b_{2} ... b_{ m }}.
The ordered pair (car_a car_b) is a CAR adjacency in an extant genome G if there exists a pair of segments S_{ a } and S_{ b } consecutive in genome G such that the segment S_{ a } (resp. S_{ b }) contains only blocks from car_a (resp. car_b), and satisfies the following constraints:
1. i.) S_{ a } is either the segment {a_{ n }}, else ii) a segment of length n_{ a } > 1 ending with the block a_{ n }, else iii) a segment syntenic to a segment of car_a containing the block a_{ n },
2. i) S_{ b } is either the segment {b_{1}}, else ii) a segment of length n_{ b } > 1 starting with the block b_{1}, else iii) a segment syntenic to a segment of car_b containing the block b_{1}.
As for the blocks, the CAR adjacency (car_a car_b) is equivalent to (−car_b  car_a).
For example, consider the following three CARs composed of ten blocks:
car_1 = • a b c • ;
car_2 = • d e f g • ;
car_3 = • h i j •.
The genome G = • b c −d f • ; • e −g i j a −h • has three CAR adjacencies: (car_1 car_2), (car_2 −car_3), and (car_3 car_1). The pair (car_1 car_2) is a CAR adjacency because of segment S_{1} = {c} and S_{2} = {−d f } that are consecutive in the genome G, and such that S_{1} satisfies the constraint 1.i) and S_{2} satisfies the constraint 2.ii). The CAR adjacency (car_2  car_3) is supported by the segments S_{2} = {e −g} satisfying 1.ii) and S_{3} = {i j} = {−j −i} satisfying 2.iii). The CAR adjacency (car_3 car_1) is supported by the segments S_{3} = {j} satisfying 1.i) and S_{1} = {a} satisfying 2.i).
The block adjacency corresponding to the CAR adjacency (car_a car_b) with car_a = {a_{1} a_{2} ... a_{ n }} and car_b = {b_{1} b_{2} ... b_{ m }} is the adjacency (a_{ n } b_{1}).
In the previous example, the block adjacencies corresponding to (car_1 car_2), (car_2  car_3) and (car_3 car_1) are respectively (c d), (g −j), and (j a).
Proposition 1 Let car_a = {a_{1} a_{2} ... a_{ n }} be a signed CAR in the current set of CARs. An extant genome G has at most two CAR adjacencies of the form (car_a car_x).
Proof Let us suppose that an extant genome G has more than two CAR adjacencies of the form (car_a car_x). Say (car_a car_x), (car_a car_y), and (car_a car_z) are three of them. These CAR adjacencies would be supported by 1) three pairs of consecutive segments on G, $\left({S}_{{a}_{1}},{S}_{x}\right),\left({S}_{{a}_{2}},{S}_{y}\right),\left({S}_{{a}_{3}},{S}_{z}\right)$, such that 2) ${S}_{{a}_{1}},{S}_{{a}_{2}},{S}_{{a}_{3}}$ contain the block a_{ n }, and 3) S_{ x }, S_{ y } , S_{ z } are nonintersecting segments since they belong to three different CARs. It is impossible to find an ordering of the six segments on G such that the constraints 1), 2) and 3) are all satisfied simultaneously. Thus, the genome G contains at most two CAR adjacencies of the form (car_a car_x). □
Remark 1 The definitions of fully or partly conserved adjacencies are naturally extended to CAR adjacencies as follows: a conserved CAR adjacency at an ancestral node of the species tree is a CAR adjacency shared by at least two extant genomes that belong to at least two different sets of the species partition defined by the ancestral node. A fullyconserved CAR adjacency is a conserved CAR adjacency belonging to at least one genome of each of the three sets of the species partition defined by the ancestral node. A partlyconserved CAR adjacency is any other conserved CAR adjacency. The homoplasy cost associated to a CAR adjacency is a natural extension of the definition given for the block adjacencies.
Classification and selection of the conserved adjacencies
The overall idea of this phase is to select conserved adjacencies while giving priority to the fullyconserved adjacencies, and to the adjacencies that have the less conflicts with other adjacencies.
Let S be the set of block adjacencies corresponding to the conserved CAR adjacencies at the ancestral node. In the sequel, the abbreviations FS, PS, NC, C stand for Fully, Partly, NonConflicting, and Conflicting conserved adjacencies respectively. Figure 3 shows the organization of the sets of adjacencies that are considered in this phase.
Let FS and PS be the subsets of S that contain respectively the fullyconserved adjacencies and the partlyconserved adjacencies. Thus, S = FS ∪ PS and FS ∩ PS = ∅.
First, we consider the fullyconserved adjacencies. Let FS_NC be the subset of FS that contains the adjacencies that are compatible with all other adjacencies in FS. The corresponding set of conflicting adjacencies is FS_C = FS  FS_NC. The fullyconserved nonconflicting adjacencies contained in the set FS_NC are automatically retained to be added in the CARs. Thus, (*) in the following, any adjacency that is in conflict with some adjacencies of FS_NC will be discarded permanently.
Next, we consider the partlyconserved adjacencies. Let PS_D be the subset of PS containing adjacencies that are in conflict with some adjacencies of FS_NC, and PS_R be the set of the remaining adjacencies in PS. Thus, PS_R = PS  PS_D. The adjacencies of PS_D are discarded permanently, as explained previously in (*).
Let PS_NC be the subset of PS_R that contains the adjacencies that are compatible with all other adjacencies in PS_R. The corresponding set of conflicting adjacencies is PS_C = PS_R  PS_NC.
Finally, since the priority is given to fullyconserved adjacencies, we want to retain only the adjacencies of PS_NC that are not in conflict with the adjacencies of the set FS. Let PS_NC^{2} be the subset of PS_NC that contains the adjacencies that are compatible with all the adjacencies in FS. The partlyconserved nonconflicting adjacencies contained in the set PS_NC^{2} are also retained automatically to be added in the CARs.
It follows that the set of retained adjacencies NC = FS_NC ∪ PS_NC^{2} is a set of nonconflicting adjacencies.
This step a) of the method adds the set of adjacencies NC to the current CARs of the ancestral genome, and updates the current set of conflicting adjacencies to the set C = S  PS_D − NC. By construction, each adjacency contained in the set C is in conflict with at least one other adjacency of C, and compatible with all the adjacencies contained in the set NC.
The step a) can be recalled several times consecutively as far as the set NC of added adjacencies is not empty. We now state a proposition ensuring that the current set of conflicting adjacencies C misses no previously found conflicting adjacency (a b) such that the signed block a is the end of a signed CAR, and the signed block b is the start of a signed CAR in the current set of CARs.
Proposition 2 Let (a b) be an adjacency corresponding to a conserved CAR adjacency found in a previous step a) of the method. The adjacency (a b) is either present in the current set of CARs, or is in conflict with an adjacency present in the current set of CARs, or is also found in the current step a) i.e (a b) ∈ S.
Proof Say that, in a previous step a), the adjacency (a b) was supported by the detection of a conserved CAR adjacency (car_a_{1} car_b_{1}) present in a subset G of the extant genomes.
1) If there exist in the current set of CARs, a signed CAR car_a_{2} ending with the signed block a, and a signed CAR car_b_{2} starting with the signed block b, then the CAR adjacency (car_a_{2} car_b_{2}) is also found in the same set $\phantom{\rule{0.25em}{0ex}}\mathcal{G}$ of extant genomes. Thus, the adjacency (a b) is also found in the current step.
2) Otherwise, either there exists an adjacency of the form (a c) or (c b) in the current set of CARs in conflict with the adjacency (a b), or the adjacency (a b) is present in the current set of CARs. □
Step b): Resolution of conflicts between adjacencies
This step considers a conflicting set C of adjacencies obtained at the end of a previous step a), and computes a nonconflicting subset of the set C to be added in the current set of CARs.
Definition of the cost of adjacencies
We begin by stating the definition of the cost of an adjacency in this step. The mutation cost of a labeling of the nodes of a species tree on a given alphabet is the number of edges in the tree having two different labels at their extremities [13, 14]. Here, the cost of an adjacency (a b) ∈ C is the minimum mutation cost of a labeling of the nodes of the species tree on a binary alphabet {0, 1} such that (i) the ancestral node is labeled with 1, (ii) the extant species nodes, where (a b) corresponds to a CAR adjacency, are labeled with 1, and (iii) the other extant species nodes are labeled with 0.
In other terms, an adjacency has two possible states in a genome: present (1) or absent (0). The cost of an adjacency (a b) is the minimum number of changes of state necessary to explain the evolutionary history of the adjacency along the species tree, with the adjacency being present at the ancestral node.
For example, the costs of the two conflicting conserved adjacencies (g h) and (g −h) shown in Figure 1 are 3 and 2 respectively. Figure 4 shows two minimum mutation cost labelings of the nodes of the species tree corresponding to both adjacencies.
Computation of the nonconflicting subset of adjacencies
The cost of a set of adjacencies is the sum of the costs of the adjacencies composing this set.
Let m be the maximum size of a nonconflicting subset of the conflicting set C of adjacencies. This step b) finds a nonconflicting subset C_{ m } of C of size m and minimum cost. The set of adjacencies C_{ m } is added to the current CARs of the ancestral genome, and the remaining adjacencies in the set C − C_{ m } are discarded permanently.
Remark 2 Note that the adjacencies of the set C − C_{ m } discarded in this step will never be detected again, since these adjacencies are in conflict with the adjacencies of the set C_{ m } added in the current step.
Step c): Detection of DCJreliable adjacencies
This step considers the current set of CARs, and computes new potential adjacencies not conserved, but supported by putative ancestral rearrangement events.
A DoubleCutandJoin (DCJ) rearrangement event on a genome consists in the cut of two adjacencies of the genome in order to glue the four exposed extremities in a different way. For example, a DCJ event on the genome A = (• a b c d •) that cuts the adjacencies (a b) and (c d) to obtain the adjacencies (a −c) and (−b d) produces the genome B = (• a −c −b d •).
We now give the definition of potential ancestral adjacencies that can be inferred from putative genome rearrangements inspired from the definitions of reliable adjacencies in [15, 16].
Here, we add the constraint that the signal of the reliable adjacency must be conserved on a path of the species tree that goes through the ancestor.
Let car_a and car_b be two signed CARs in the current set of CARs with car_a = {a_{1} a_{2} ... a_{ n }} and car_b = {b_{1} b_{2} ... b_{ m }}. The adjacency (a_{ n } b_{1}) is a DCJreliable adjacency of the ancestral node if there exists an adjacency (x y) in the current set of CARs such that the adjacencies (x b_{1}) and (a_{ n } y) are present in an extant genome G_{1}, and (car_a car_b) is a CAR adjacency in an extant genome G_{2} such that the genomes G_{1} and G_{2} belong to two different sets of the species partition defined by the ancestral node.
The potential presence of the adjacency (a_{ n } b_{1}) in the ancestral genome induces a DCJ event that has cut the adjacencies (a_{ n } b_{1}) and (x y) in the ancestral genome to produce the adjacencies (x b_{1}) and (a_{ n } y) in the extant genome G_{1}.
An example is given in Section Results and discussion.
In this step of the method, a maximum size nonconflicting subset of the DCJreliable adjacencies is added in the CARs, and the remaining DCJreliable adjacencies are discarded permanently.
Remark 3 Note that the homoplasy cost of a DCJ reliable adjacency is always 2.
Results and discussion
We used ProCARs to compute a set of CARs for the boreoeutherian ancestral genome using the block orders of twelve amniote genomes, and we compared the result with the ancestors reconstructed by three other homologybased methods: AnGeS [12], InferCARs [5] and GapAdj [11].
Orthology blocks and phylogeny
We chose twelve genomes completely assembled and present in a Pecan [17] multiple alignment of 20 amniote genomes available in the release 73 of the Ensembl Compara database [18]. The phylogenetic tree was directly infered from the classifications of the species obtained from the National Center for Biotechnology Information Taxonomy database [19] (see Additional File 1). We constructed a set of synteny blocks using the multiple alignments as seeds. We used the block construction method described in [20], keeping only the seeds that had an occurrence in each of the twelve genomes, removing the seeds that spanned less than 100Kb, and joining seeds collinear in all genomes. This resulted in a set of 12 genomes composed of 689 blocks for species Homo sapiens (GRCh37), Pan troglodytes (CHIMP2.1.4), Pongo abelii (PPYG2), Macaca mulatta (MMUL 1), Mus musculus (GRCm38), Rattus norvegicus (Rnor 5.0), Equus caballus (EquCab2), Canis familiaris (CanFam3.1), Bos taurus (UMD3.1), Monodelphis domestica (BROADO5), Gallus gallus (Galgal4) and Taeniopygia guttata (taeGut3.2.4).
Reconstruction of the boreoeutherian ancestor
ProCARs ran in 5 steps and finally returned 25 CARs with a number of blocks per CAR ranging from 2 to 68 (Table 1). The total number of adjacencies computed for the boreoeutherian ancestor is 664 compared to the 666, 669, 659 adjacencies present in respectively Homo sapiens, Mus musculus and Bos taurus.
The numbers of blocks per CAR are detailed in Table 2. The human chromosomal syntenies are 15, 321, 48, 819, 1222, 1415 and 1619. In [21], the boreoeutherian ancestor has two more human chromosomal syntenies 716 and 101222, and all other syntenies were also found by ProCARs.
Comparison with other methods
All the methods (ProCARs, AnGeS [12], InferCARs [5] and GapAdj [11]) take as input a phylogeny with a tagged ancestral node in this phylogeny, and a set of blocks with the arrangement of the blocks in each extant genome of the phylogeny. AnGeS [12] first builds a set of potential ancestral features (adjacencies, and sets of contiguous blocks) by comparing pairs of species whose path goes through the tagged ancestral node. Then, an arrangement of the blocks that corresponds to a subset of these adjacencies is built in order to satisfy the consecutive ones property. This assembling phase requires the length of the branches of the phylogenetic tree. InferCARs [5] is based on an adaptation of the Fitch parsimony method for adjacencies. Potential neighbors of blocks are modeled through graphs at each node of the phylogenetic tree. Conflicts between potential neighboring relations are resolved using a weight function which requires the length of the branches of the phylogenetic tree. GapAdj [11] works iteratively, detecting new adjacencies at each step by allowing more and more gaps within adjacencies until the maximum number of gaps MAX_{ α } is reached. At each step, the assembling of the extended CARs is done using a TSP algorithm, and a threshold τ is required to discard the less reliable adjacencies.
As GapAdj is the only method with parameters (MAX_{ α } and τ ), we ran GapAdj on 500 sets of parameters for MAX_{ α } ranging from 1 to 10, and τ ranging from 0.50 to 0.99. We then selected the reconstruction that had the minimal breakpoint distance to the ancestor reconstructed by ProCARs. The breakpoint distance between two genomes is the number of blocks extremities whose neighbors are not conserved in both genomes. Among the 500 sets of parameters tested, the closest result is obtained when τ equals 0.79 and MAX_{ α } equals 3, giving a breakpoint distance of 32.5 between this reconstruction and the ancestor reconstructed by ProCARs. That corresponds to 4.7% of the block extremities having different neighbors in both reconstructions. Note that the reconstruction selected for GapAdj is also the closest to the ancestors reconstructed by InferCARs and AnGeS.
Figure 5 gives the breakpoint distances between all pairwise comparisons. This shows that GapAdj is the method which gives the most different result, while AnGeS is the method which finds the closest result to ProCARs. The distribution of the number of blocks involved in each CAR is roughly the same (Figure 6).
We then computed the list of adjacencies shared by all the methods and the adjacencies that are specific to a subset of the methods, as shown in Figure 7. The number of adjacencies shared by all the methods is 635. The method which infers the highest number of specific adjacencies is GapAdj (15 adjacencies), as suggested by the breakpoint distances shown in Figure 5. All adjacencies found by AnGeS are also found by ProCARs, as confirmed by the small breakpoint distance between the two methods. Finally, it is noteworthy that there is no adjacency shared by the three methods AnGeS, InferCARs and GapAdj that is not found by ProCARs.
Justification of ProCARs specific adjacencies
Adjacency (50 − 545) is found at iteration 4 of ProCARs. In the other methods, the block 50 is alone in a singleblock CAR. This adjacency was detected thanks to a step c) of ProCARs method. It is then a DCJreliable adjacency detected as follows: at iteration 3, adjacency (535 536) was found, block 50 is at the end of CAR 2, and block 545 is at the end of CAR 20. In Bos taurus, the CAR adjacency (2 − 20) is conserved. In Mus musculus, block adcencies (545 536) and (50 − 535) are present. Hence, as the path from Bos taurus to Mus musculus goes through the ancestor, a potential DCJ rearrangement on adjacencies (50 − 545) and (535 536) in the ancestor could explain the adjacencies found in Mus musculus: (545 536) and (50 − 535). Moreover, this adjacency (50 − 545) found by ProCARs is the one supporting the human chromosomal synteny 15 that was also reported in [21] using a cytogenetic method, but not found by any of the other methods (see Table 3).
Adjacency (616 618) is found at iteration 2. It is then a conserved adjacency detected as follows: at iteration 1, block 616 is alone in a CAR, and block −618 is at the end of a CAR. This adjacency (616 618) is present, on the one hand, in Mus musculus and Rattus norvegicus (ingroup I_{2}) and on the other hand in Equus caballus and Bos taurus (ingroup I_{1}). Hence, it is a partlyconserved adjacency and, as it is not in conflict with any other conserved adjacency, ProCARs joined 616 and 618 at iteration 2. In InferCARs and AnGeS, 616 is alone in a CAR while 618 is also at the begining of a CAR. Therefore, CARs found by InferCARs and AnGeS are not in conflict with the adjacency (616 618) that ProCARs added, but no signal was found by those methods to infer this adjacency. In GapAdj, 618 is alone in a CAR while 616 is in a CAR containing (−299 616 617). However, (616 617) is only present in species in the ingroup I_{2} (Homo sapiens, Pan troglodytes, Pongo abelii and Macaca mulatta). Therefore it is not a conserved adjacency, and that is why ProCARs preferred the partlyconserved adjacency (616 618).
Justification of adjacencies not found by ProCARs
AnGeS contains no specific adjacency and thus ProCARs found all adjacencies detected by AnGeS. There are 2 adjacencies found by both GapAdj and InferCARs but not by ProCARs.
For adjacency (67 68), InferCARs inferred a unique CAR which is the concatenation of CARs 3 and 4 of ProCARs involving respectively blocks 67 and 68. GapAdj also inferred this concatenation of the two ProCARs CARs, except a segment of the CAR involving block 68 in ProCARs which is in a separated CAR. The (67 68) adjacency is only present in Homo sapiens, Pan troglodytes, Pongo abelii and Macaca mulatta (ingroup I_{2}) and hence cannot be a partlyconserved adjacency. It is not a DCJreliable adjacency either.
Concerning the adjacency (−657 658), ProCARs has adjacencies (−657 − 659 − 658) in CAR 24 while InferCARs (resp. GapAdj) created adjacencies (−657 658 659) in CAR 28 (resp. 27). The adjacency (−657 658) is present only in Mus musculus and Rattus norvegicus (ingroup I_{2}) and is hence not a conserved adjacency. It is not a DCJreliable adjacency either, otherwise this adjacency would have been detected during iteration 4.
Human chromosomal syntenies
Human syntenies found by other methods are: for AnGeS: 321, 48, 819, 1222, 1415, 1619; for InferCARs: 321, 48 and 1222; for GapAdj: 248, 321, 79, 5618, 819, 1011, 1222 and 1619. A comparison between the four methods is given in Table 3 and a karyotype of the ancestral genomes in Additional File 2. We can notice that ProCARs returns the closest result to the ancestor reconstructed in [21] using a cytogenetic method.
Conclusions
InferCARs is the first method using an adaptation of the Fitch algorithm to infer ancestral gene orders based on homology instead of rearrangements. AnGeS makes use of common intervals to be able to account for microrearrangements. GapAdj brings the iterative approach allowing to build CARs step by step. With ProCARs, we propose a new methodology which combines the different approaches found in other methods, using a model based on adjacencies only.
ProCARs has the advantage to be a parameterfree method, without the requirement of branch lengths for the phylogenetic tree. ProCARs is based on a single definition of contiguity, the CAR adjacency, that allows some microrearrangements under a very simple model. However, since ProCARs considers only genomes containing the same set of nonduplicated blocks, it does not allow to reconstruct ancestors in the context of duplication or loss events.
In order to select the adjacencies at each step of ProCARs, the adjacencies are classified according to an homoplasy cost instead of using a heuristic assembly algorithm. ProCARs gives priority to discarding conflicting adjacencies rather than necessarily adding new adjacencies at each step.
The final result of ProCARs is a set of completely resolved CARs, for which the arrangements of all the blocks are given.
As for other homologybased methods, ProCARs is not suitable in the case of convergent evolution. ProCARs is also a greedy algorithm which could be seen as a disadvantage because adjacencies are added permanently at each step. However, this greediness is balanced by the fact that ProCARs works iteratively and adds only reliable nonconflicting adjacencies at each step.
Availability of supporting data
ProCARs is written in Python and is available at http://bioinfo.lifl.fr/procars. The dataset used in section
Results and discussion is also available from this web page.
Abbreviations
 TSP:

Traveling Salesman Problem
 CAR:

Contiguous Ancestral Region
 NC:

NonConflicting adjacencies
 C:

Conflicting adjacencies
 FS:

Fullyconserved adjacencies
 PS:

Partlyconserved adjacencies
 R:

Retained adjacencies
 D:

Discarded adjacencies.
References
 1.
Bourque G, Pevzner PA: Genomescale evolution: reconstructing gene orders in the ancestral species. Genome Research. 2002, 12 (1): 2636.
 2.
Sankoff D, Blanchette M: Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology. 1998, 5: 555570. 10.1089/cmb.1998.5.555.
 3.
Zheng C, Sankoff D: On the pathgroups approach to rapid small phylogeny. BMC Bioinformatics. 2011, 12: 410.1186/14712105124.
 4.
Bergeron A, Blanchette M, Chateau A, Chauve C: Reconstructing ancestral gene orders using conserved intervals. Lecture Notes in Computer Science. 2004, 3240: 1425. 10.1007/9783540302193_2.
 5.
Ma J, Zhang L, Suh BB, Rany BJ, Burhans RC, Kent WJ, Blanchette M, Haussler D, Miller W: Reconstructing contiguous regions of an ancestral genome. Genome Research. 2006, 16: 15571565. 10.1101/gr.5383506.
 6.
Bhutkar A, Gelbart WM, Smith TF: Inferring genomescale rearrangement phylogeny and ancestral gene order: a Drosophilia case study. Genome Biology. 2007, 8: 23610.1186/gb2007811r236.
 7.
Chauve C, Tannier E: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Computational Biology. 2008, 4: 100023410.1371/journal.pcbi.1000234.
 8.
Muffato M, Louis A, Poisnel CE, Crollius HR: Genomicus: a database and a browser to study gene synteny in modern and ancestral genomes. Bioinformatics. 2010, 26: 11191121. 10.1093/bioinformatics/btq079.
 9.
Yang K, Heath LS, Setubal JC: Regen: Ancestral genome reconstruction for bacteria. Genes. 2012, 3 (3): 423443.
 10.
Adam Z, Turmel M, Lemieux C, Sankoff D: Common intervals and symmetric difference in a modelfree phylogenomics, with an application to streptophyte evolution. Journal of Computational Biology. 2007, 14: 436445. 10.1089/cmb.2007.A005.
 11.
Gagnon Y, Blanchette M, ElMabrouk N: A flexible ancestral genome reconstruction method based on gapped adjacencies. BMC Bioinformatics. 2012, 13 (S19): 4
 12.
Jones BR, Rajaraman A, Tannier E, Chauve C: Anges: reconstructing ancestral genomes maps. Bioinformatics. 2012, 28 (18): 23882390. 10.1093/bioinformatics/bts457.
 13.
Fitch W: Towards defining the course of evolution: Minimum change for a specified tree topology. Systematic Zoology. 1971, 20: 406416. 10.2307/2412116.
 14.
Sankoff D: Minimal mutation trees of sequences. SIAM Journal of Applied Mathematics. 1975, 28: 3542. 10.1137/0128004.
 15.
Zhao H, Bourque G: Recovering genome rearrangements in the mammalian phylogeny. Genome Research. 2009, 19: 934942. 10.1101/gr.086009.108.
 16.
Chauve C, Gavranovic H, Ouangraoua A, Tannier E: Yeast ancestral genome reconstructions: the possibilities of computational methods II. Journal of Computational Biology. 2010, 17: 10971112. 10.1089/cmb.2010.0092.
 17.
Paten B, Herrero J, Beal K, Fitzgerald S, Birney E: Enredo and pecan: genomewide mammalian consistencybased multiple alignment with paralogs. Genome Research. 2008, 18: 18141828. 10.1101/gr.076554.108.
 18.
Kersey PJ, Lawson D, Birney E, Derwent PS, Haimel M, Herrero J, Keenan S, Kerhornou A, Koscielny G, Kähäri A, Kinsella RJ, Kulesha E, Maheswari U, Megy K, Nuhn M, Proctor G, Staines D, Valentin F, Vilella AJ, Yates A: Ensembl genomes: Extending ensembl across the taxonomic space. Nucleic Acids Research. 2010, 38 (1): 563569.
 19.
Federhen S: The ncbi taxonomy database. Nucleic Acids Research. 2012, 40 (D1): 136143. 10.1093/nar/gkr1178.
 20.
Ouangraoua A, Tannier E, Chauve C: Reconstructing the architecture of the ancestral amniote genome. Bioinformatics. 2011, 27 (19): 26642671. 10.1093/bioinformatics/btr461.
 21.
Kemkemer C, Kohn M, Cooper DN, Froenicke L, Hameister H, KehrerSawatzki H: Gene synteny comparison between different vertebrates provide new insights into breakage and fusion events during mammalian karyotype evolution. BMC Evolutionary Biology. 2009, 9: 8410.1186/14712148984.
Acknowledgements
AP's engineer position is supported by a Région NordPasdeCalais funding (Projets Emergents). The participation of AP and AO to the conference ISCBLA in October 2014 was funded by Inria and Université de Sherbrooke. Inria provided the funding for publication of the article.
This article has been published as part of BMC Genomics Volume 16 Supplement 5, 2015: Proceedings of the 10th International Conference of the Brazilian Association for Bioinformatics and Computational Biology (XMeeting 2014). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcgenomics/supplements/16/S5.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
AP wrote the program and its documentation, ran the experiments, and presented the results at the conference ISCBLA'14. AP, JSV, SB and AO analyzed and interpreted the data. JSV wrote the results section. AO conceived the study and its design, wrote a prototype of the program, and drafted the manuscript. AP, JSV and SB critically revised the manuscript. All authors read and approved the final manuscript.
Electronic supplementary material
Rights and permissions
About this article
Published
DOI
Keywords
 Ancestral gene orders reconstruction
 Small phylogeny problem
 Boreoeutherian ancestor