Volume 13 Supplement 10
Selected articles from the 7th International Symposium on Bioinformatics Research and Applications (ISBRA'11)
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence
 Ruchi Chaudhary^{1},
 J Gordon Burleigh^{2} and
 Oliver Eulenstein^{1}Email author
https://doi.org/10.1186/1471210513S10S11
© Chaudhary et al. licensee BioMed Central Ltd. 2012
Published: 25 June 2012
Abstract
Background
Gene tree  species tree reconciliation problems infer the patterns and processes of gene evolution within a species tree. Gene tree parsimony approaches seek the evolutionary scenario that implies the fewest gene duplications, duplications and losses, or deep coalescence (incomplete lineage sorting) events needed to reconcile a gene tree and a species tree. While a gene tree parsimony approach can be informative about genome evolution and phylogenetics, error in gene trees can profoundly bias the results.
Results
We introduce efficient algorithms that rapidly search local Subtree Prune and Regraft (SPR) or Tree Bisection and Reconnection (TBR) neighborhoods of a given gene tree to identify a topology that implies the fewest duplications, duplication and losses, or deep coalescence events. These algorithms improve on the current solutions by a factor of n for searching SPR neighborhoods and n^{2} for searching TBR neighborhoods, where n is the number of taxa in the given gene tree. They provide a fast error correction protocol for ameliorating the effects of gene tree error by allowing small rearrangements in the topology to improve the reconciliation cost. We also demonstrate a simple protocol to use the gene rearrangement algorithm to improve gene tree parsimony phylogenetic analyses.
Conclusions
The new gene tree rearrangement algorithms provide a fast method to address gene tree error. They do not make assumptions about the underlying processes of genome evolution, and they are amenable to analyses of largescale genomic data sets. These algorithms are also easily incorporated into gene tree parsimony phylogenetic analyses, potentially producing more credible estimates of reconciliation cost.
Introduction
The availability of largescale genomic data from a wide variety of taxa has revealed much incongruence between gene trees and the phylogeny of the species in which the genes evolve. This incongruence may be caused by evolutionary processes such as gene duplication and loss, deep coalescence, or lateral gene transfer. The variation in gene tree topologies can be used to infer the processes of genome evolution. Gene tree  species tree (GTST) reconciliation methods seek to map the history of gene trees into the context of species evolution and thus potentially link processes of gene evolution to phenotypic changes and diversification. Yet these methods can be confounded by error in the gene trees, which also may cause incongruence between the gene and species topologies. We introduce efficient algorithms to correct gene tree topologies based on the gene duplication, duplication and loss, or deep coalescence cost models. The algorithms work by identifying the small rearrangements in the gene trees that reduce the reconciliation cost. They are extremely fast and thus amenable to analyses of enormous genomic data sets.
Perhaps the most commonly used and computationally feasible approach to GTST reconciliation is gene tree parsimony, which seeks to infer the fewest evolutionary events (e.g., duplication, loss, coalescence, or lateral gene transfer) needed to reconcile a gene tree and species tree topology [1]. This approach also can be extended to infer species phylogenies, finding the species tree that implies the fewest evolutionary events implied by the gene trees (e.g., [2–4]). However, the gene trees often are estimated using heuristic methods from short sequence alignments, and consequently, there is often much error in the estimated gene tree topologies. Error in the gene trees creates more GTST incongruence and can radically affect GTST reconciliation analyses, implying far more duplications, duplications and losses, or deep coalescence events than actually exist. For example, Rasmussen and Kellis [5] estimated that error in gene tree reconstruction can lead to 23 fold overestimates of gene duplications and losses. Gene tree error also can erroneously imply large numbers of duplications near the root of the species tree [6, 7], and it can mislead gene tree parsimony phylogenetic analyses (e.g., [8–10]).
Several approaches have been proposed to address gene tree error in GTST reconciliation. First, questionable nodes in a gene tree or nodes with low support may be collapsed prior to gene tree reconciliation, and the resulting nonbinary gene trees may be reconciled with species trees [11–13]. Similarly, GTST reconciliations can use a distribution of gene tree topologies, such as bootstrap gene trees, rather than a single gene tree estimate [6, 14, 15]. Both of these approaches may help account for stochastic error and uncertainty in gene tree topologies, but they do not explicitly confront gene tree error. Methods also exist to simultaneously infer the gene tree topology and the gene tree reconciliation with a known species tree [5, 16]. While these sophisticated statistical approaches appear very promising, they are computationally intensive, and it is unclear if they will be tractable for largescale analyses. Another, perhaps a more computationally feasible, approach is to allow a limited number of local rearrangements in the gene tree topology if they reduced the reconciliation cost [17, 18].
Previously [17, 18] described a method to allow NNIbranch swaps on selected branches of a gene tree to reduce the reconciliation cost. Following [17, 18], we address gene tree error in the reconciliation process by assuming that the correct gene tree can be found in a particular neighborhood of the given gene tree. We describe this approach for the gene duplication, duplication and loss, and deep coalescence models, which identify the fewest respective events implied from a given gene tree and given species tree. This neighborhood consists of all trees that are within one edit operation of the gene tree. While [17, 18] use Nearest Neighbor Interchange (NNI) edit operations to define the neighborhood, we use the standard tree edit operations SPR [19, 20] and TBR [19], which significantly extend upon the search space of the NNI neighborhood. The SPR and TBR local search problems find a tree in the SPR and TBR neighborhood of a given gene tree, respectively, that has the smallest reconciliation cost when reconciled with a given species tree. Using the algorithm from Zhang [21] the best known (naïve) runtimes are O(n^{3}) for the SPR local search problem and O(n^{4}) for the TBR local search problem, where n is the number of taxa in the given gene tree. These runtimes typically are prohibitively long for the computation of larger GTST reconciliations. We improve on these solutions by a factor of n for the SPR local search problem and a factor of n^{2} for the TBR local search problem. This makes the local search under the TBR edit operation as efficient as under the SPR edit operation, and it provides a highspeed gene tree errorcorrection protocol that is computationally feasible for largescale genomic data sets.
We also evaluated the performance of our algorithms using the implementation of SPR based local search algorithms. Note, that the SPR neighborhood is properly contained in the TBR neighborhood for any given tree. Thus the performance of the SPR based program provides a conservative estimate of the performance of the TBR based program. We test our programs on a collection of 106 yeast gene trees, some of which contain hundreds of leaves, and we demonstrate how it can be easily incorporated into largescale gene tree parsimony phylogenetic analyses.
Basic notation and preliminaries
Throughout this paper, the term tree refers to a rooted full binary (phylogenetic) tree.
Let T be a tree. The leaf set of T is denoted by Le(T). The set of all vertices of T is denoted by V(T) and the set of all edges by E(T). The root of T is denoted by Ro(T). The set of internal vertices of T is I(T):= V(T)\Le(T).
Given a vertex v ∈ V(T), we denote the parent of v by Pa_{ T }(v). Let u := Pa_{ T }(v). The edge that connects v with u is written as (u, v). The first element in the pair is always the parent of the second element. The set of all children of v is denoted by Ch_{ T }(v) and the children are called siblings. For w ∈ Ch_{ T }(v), the sibling of w is denoted by Sb_{ T }(w).
We define ≤_{ T } to be the partial order on V(T) where x≤_{ T } y if y is a vertex on the path between Ro(T) to x, and write x <_{ T } y if x ≤ _{ T } y and x ≠ y. The least common ancestor of a nonempty subset L ⊆ V(T), denoted as LCA_{ T }(L), is the unique smallest upper bound of L under ≤_{ T }. Given x, y ∈ V(T), d_{ T }(x, y) denotes the number of edges on the unique path between x and y in T.
Given U ⊆ V(T), we denote by T(U) the unique rooted subtree of T that spans U with the minimum number of vertices. Furthermore, the restriction of T to U, denoted by T_{U}, is the rooted tree that is obtained from T(U) by suppressing all nonroot vertices of degree two. The subtree of T rooted at u ∈ V(T), denoted by T_{ u }, is defined to be T_{U}, for U:= {v ∈ Le(T): v ≤_{ T } u}. Two trees T_{1} and T_{2} are called isomorphic if there exists a bijection between the vertex sets of T_{1} and T_{2} which maps a vertex u_{1} of T_{1} to vertex u_{2} of T_{2} if the subtree rooted at u_{1} in T_{1} has the same leaf set as the subtree rooted at u_{2} in T_{2}. If an isomorphism exists between T_{1} and T_{2}, we write T_{1} ≃ T_{2}.
Given function f : A → B, we denote by f(A') where A' ⊆ A a set of images of each element in A' under f.
The reconciliation cost models
A species tree is a tree that depicts the branching pattern representing the divergence of a set of species, whereas a gene tree is a tree that depicts the evolutionary history among the sequences encoding one gene (or gene family) for a given set of species. We assume that each leaf of the gene tree is labeled with the species from which that gene was sampled. Let G be a gene tree and S a species tree. In order to compare G with S, we require a mapping from each gene g ∈ V(G) to the most recent species in S that could have contained g.
Definition 1 (Mapping). The leafmapping ℒ_{ G,S } : Le(G) → Le(S) is a surjection that maps each leaf g∈ Le(G) to that unique leaf s ∈ Le(S) which has the same label as g. The extension ℳ_{ G,S } : V(G) → V(S) is the mapping defined by ℳ_{ G,S }(g):= LCA(ℒ_{ G,S }(Le(G_{ g }))). For convenience, we write ℳ(g) instead of ℳ_{ G,S }(g) when G and S are clear from the context.
Definition 2 (Comparability). Given trees G and S, we say that G is comparable to S if a leafmapping ℒ_{ G,S }(g) is well defined.
Throughout this paper we use the following terminology: G is a gene tree that is comparable to the species tree S through a leafmapping ℒ_{ G,S }, and n is the number of taxa present in both input trees.
Now we define different reconciliation costs from G to S for a given mapping ℳ_{ G,S } that extends ℒ_{ G,S }. The reconciliation cost are based on the models of gene duplication [22, 23], duplicationloss [21], and deep coalescence [21].
Definition 3 (Duplication cost).

The duplication cost from g ∈ V(G) to S, ${\mathcal{C}}_{D}\left(G,S,g\right):=\left\{\begin{array}{c}1,\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}if\mathcal{M}\left(g\right)\in \mathcal{M}\left(Ch\left(g\right)\right);\\ 0,\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}otherwise.\end{array}\right.$

The duplication cost from G to S, ${\mathcal{C}}_{D}\left(G\mathsf{\text{,}}\phantom{\rule{0.3em}{0ex}}S\right):={\sum}_{g\in I\left(G\right)}{\mathcal{C}}_{D}\left(G,S,g\right)$.
Definition 4 (Duplicationloss cost).

The loss cost from g ∈ V(G) to S,${\mathcal{C}}_{L}\left(G,S,g\right):=\left\{\begin{array}{cc}\hfill 0,\hfill & \hfill if\forall h\in Ch\left(g\right):\mathcal{M}\left(g\right)=\mathcal{M}\left(h\right);\hfill \\ \hfill {\sum}_{h\in Ch\left(g\right)}{d}_{S}\left(\mathcal{M}\left(g\right),\mathcal{M}\left(h\right)\right)1,\hfill & \hfill otherwise.\hfill \end{array}\right.$

The duplicationloss cost from G to S,${\mathcal{C}}_{DL}\left(G,S\right):={\sum}_{{{}_{g}}_{\in I\left(G\right)}}\left({\mathcal{C}}_{D}\left(G,S,g\right)+{\mathcal{C}}_{L}\left(G,S,g\right)\right)$.
Definition 5 (Deep coalescence cost).

The number of lineages from g ∈ V(G) to h ∈ Ch(g) in S,${\mathcal{C}}_{DC}\left(G,\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right):={\sum}_{h\in Ch\left(g\right)}{d}_{S}\left(\mathcal{M}\left(g\right),\phantom{\rule{2.77695pt}{0ex}}\mathcal{M}\left(h\right)\right).$

The deep coalescence cost from G to S, ${\mathcal{C}}_{DC}\left(G,S\right):={\sum}_{{{}_{g}}_{\in I\left(G\right)}}{\mathcal{C}}_{DC}\left(G,S,g\right)\leftE\left(S\right)\right$.
The errorcorrection problems
Here we give definitions for tree rearrangement operations TBR [19] and SPR [19, 20], and then formulate the ErrorCorrection problems that were motivated in the introduction.
Definition 6 (Tree Bisection and Reconnection (TBR)). Let T be a tree. For this definition, we regard the planted tree Pl(T) as the tree obtained from adding the root edge{r, Ro(T)} to E(T), where r ∉ V(T).
 1.
If x ≠ Ro(X) then suppress Ro(X) and create a new root by subdividing edge (Pa(x), x).
 2.
Subdivide edges (Pa(y), y) by introducing a new vertex y'.
 3.
Reconnect components X and Y by adding edge f = (y', Ro(x).
 4.
Suppress the vertex u, and rename vertex y' as u.
 5.
Contract the root edge.
 1.
TBR_{ G }(v, x) := ∪ _{ y∈Y } TBR_{ G }(v, x, y)
 2.
TBR_{ G }(v) := ∪_{ x∈X } TBR_{ G }(v, x)
 3.
TBR_{ G } := ∪_{(u, v)∈E(G)}TBR_{ G }(v)
We define the following neighborhoods for the SPR operation:
1. SPR_{ G }(v) := ∪_{ y∈Y } SPR_{ G }(v, y)
2. SPR_{ G } := ∪_{(u, v)∈E(G)}SPR_{ G }(v)
We now state the SPR based errorcorrection problems for duplication (D), duplicationloss (DL), and deep coalescence (DC). Let Γ ∈ {D, DL, DC}.
Problem 1 (SPR based errorcorrection for Γ (SECΓ))
Instance: A gene tree G and a species tree S.
Find: A gene tree G* ∈ SPR_{ G } such that ${\mathcal{C}}_{\Gamma}\left({G}^{*},S\right)=\underset{{G}^{\prime}\in SP{R}_{G}}{\text{min}}{\mathcal{C}}_{\Gamma}\left({G}^{\prime},S\right)$.
The TBR based errorcorrection for Γ (TECΓ) problems are defined analogously to the SPR based errorcorrection for Γ (SECΓ) problems.
Solving the SECΓ problems
In this section we study the SPR based errorcorrection problems, for duplication (D), duplicationloss (DL), and deep coalescence (DC), in more detail. Our efficient solution for these problems are based on solving restricted versions of these problems efficiently. For each Γ ∈ {D, DL, DC} we first define a restricted version of the SECΓ problem, which we call the restricted SPR based errorcorrection for the Γ (RSECΓ) problem.
Problem 2 (Restricted SPR based errorcorrection for (RSECΓ))
Instance: A gene tree G, a species tree S, and v ∈ V(G).
Find: A gene tree G* ∈ SPR_{ G }(v) such that ${\mathcal{C}}_{\Gamma}\left({G}^{*},S\right)=\underset{{G}^{\prime}\in SP{R}_{G}\left(v\right)}{\text{min}}{\mathcal{C}}_{\Gamma}\left({G}^{\prime},S\right)$.
Observation 1. Let Γ ∈ {D, DL, DC}. Given a gene tree G and a species tree S, the SEC Γ problem can be solved as follows: (i) solve the RSEC Γ problem for every v ∈ V(G) where v ≠ Ro(G), (ii) under all solutions found return a minimum scoring gene tree G*.
Naïvely, the RSECΓ problem can be solved in Θ(n^{2}) time by computing the cost ${\mathcal{C}}_{\Gamma}\left({\mathsf{\text{G}}}^{\prime},\mathsf{\text{S}}\right)$ for each G' ∈ SPR_{ G }(v). The cost for a given gene and species tree can be computed in Θ(n) time [21]. We introduce a novel algorithm for the RSECΓ problem that improves by a factor of n on the naïve solution. This speedup is achieved by semiordering the trees in SPR_{ G }(v), for each v ∈ V(G), such that the scoredifference of any two consecutive trees in this order can be computed in constant time.
Ordering the trees in SPR_{ G }(v)
Consider a graph on trees in SPR_{ G }(v), in which every two adjacent trees are one NNI [19] operation apart. We show that such a graph is a rooted full binary tree, after providing necessary definitions.
Definition 8 (Nearest Neighbor Interchange (NNI)). We define the NNI operation as a special case of the SPR operation. Let e ∈ E(T) where e := (u, v), and X and Y be the connected components that are obtained by removing edge e from T such that v ∈ X and u ∈ Y. We define NNI_{ T } (v) to be SPR_{ T } (v, y) for y:= Pa(u), and say that NNI_{ T } (v) is obtained from T by performing nearest neighbor interchange (NNI) operation that prunes subtree T_{ v } and regrafts it above the parent of v's parent. (See Figure 2(b).)
Definition 9 (NNI distance). Let the NNIdistance, denoted as d_{ NNI }(T_{1,} T_{2}), between two trees T_{1} and T_{2} over n taxa be the minimum number of NNI operations required to transform T_{1} into T_{2}.
Definition 10 (NNIadjacency graph). The NNIadjacency graph, denoted as $\mathcal{X}=\left(V,E\right)$, is the graph where V = SPR_{ G }(v) and {T_{1,} T_{2}} ∈ E if d_{ NNI }(T_{1,} T_{2}) = 1.
Lemma 1. $\mathcal{X}$is a tree.
Proof. We prove it by showing that there exists a unique path between every two vertices in $\mathcal{X}$. Let G', G'' ∈ V($\mathcal{X}$), thus G', G'' ∈ SPR_{ G }(v). Let G':= SPR_{ G }(v, x_{1}) and G'':= SPR_{ G }(v, x_{2}). We use induction on d_{ G }(x_{1}, x_{2}). Let d_{ G }(x_{1}, x_{2}) = 1 and assume without loss of generality that x_{2} = Pa_{ G }(x_{1}). Thus, G'' = NNI_{ G'' } (Sb(x_{1})). So the hypothesis holds for d_{ G }(x_{1}, x_{2}) = 1. Assume now that the hypothesis is true for d_{ G }(x_{1}, x_{2}) ≤ k and suppose d_{ G }(x_{1}, x_{2}) = k + 1. Since G is a tree, there must be a unique path between x_{1} and x_{2}; let y be a vertex on this path. Let d_{ G }(y, x_{1}) = 1, and G^{ n } := SPR_{ G }(v, y). If y = Pa_{ G }(x_{1}), then G^{ n } = NNI_{ G' }(v); otherwise G^{ n } = NNI_{ G' }(Sb(y)). Since d_{ G }(y, x_{2}) = k, thus (by induction hypothesis) the hypothesis is valid for d_{ G }(x_{1}, x_{2}) = k + 1. □
Theorem 1. $\mathcal{X}$is a rooted full binary tree.
Proof. In view of Lemma 1, it suffices to show that except a unique vertex of degree 2 all other vertices in $\mathcal{X}$ are of degree 1 or 3. Let G' ∈ V($\mathcal{X}$), thus G' = SPR_{ G }(v, y) for some y ∈ V(G). There are three cases:
Case 1: y is a root. Let y_{1} ∈ Ch_{ G }(y). Let G^{1} := SPR_{ G }(v, y_{1}), thus ${G}^{\prime}=\mathsf{\text{NN}}{\mathsf{\text{I}}}_{{\mathsf{\text{G}}}^{\mathsf{\text{1}}}}\left(v\right)$). Hence {G^{1}, G'} ∈ E($\mathcal{X}$). Since Ch_{ G }(y) = 2, G' must be a degree 2 vertex in $\mathcal{X}$.
Case 2: y is a leaf. Let y_{1} = Pa_{ G }(y). Let G^{1} := SPR_{ G }(v, y_{1}), thus G^{1} = NNI_{ G' }(v). Hence {G^{1}, G'} ∈ E($\mathcal{X}$), and consequently, G' is a degree 1 vertex in $\mathcal{X}$.
Case 3: y is an internal vertex. Let y_{1} = Pa_{ G }(y) and y_{2} ∈ Ch_{ G }(y). Let G^{1} := SPR_{ G }(v, y_{1}), thus G^{1} = NNI_{ G' }(v). Let G^{2} := SPR_{ G }(v, y_{2}), thus G' = NNI_{ G }^{ 2 }(v). Since y has one parent and two children in G, thus G' is a degree 3 vertex in $\mathcal{X}$.
This completes the proof.
The score difference of consecutive trees in $\mathcal{X}$
To solve the RSECΓ problems we traverse tree $\mathcal{X}$. Two adjacent trees in V($\mathcal{X}$) are one NNI operation apart. We show that ${\mathcal{C}}_{\Gamma}$ score of a tree can be computed in constant time from the LCA computation of its adjacent tree.
Let e := (G', G'') be an edge in $\mathcal{X}$. Let x := Pa(v), y := Sb(v), and z, z' ∈ Ch(y) in G' (see Figure 2(b)). Without loss of generality, let G'':= NNI_{ G' }(z). (Observe, G'' is similar to ${G}_{r}^{{}^{\prime}}$ of Figure 2(b).)
Lemma 2. ℳ_{ G'',S }(y) = ℳ_{ G',S }(x).
Proof. From NNI operation, v, z' ∈ Ch_{ G'' }(x) and z, x ∈ Ch_{ G'' }(y). Also, ${G}_{z}^{{}^{\prime}}\simeq {G}_{z}^{{}^{\u2033}},\phantom{\rule{2.77695pt}{0ex}}{G}_{{z}^{\prime}}^{{}^{\prime}}\simeq {G}_{{z}^{\prime}}^{{}^{\u2033}},{G}_{v}^{{}^{\prime}}\simeq {G}_{v}^{{}^{\u2033}}$, so $Le\left({\mathsf{\text{G}}}_{y}^{{}^{\u2033}}\right)=Le\left({\mathsf{\text{G}}}_{x}^{{}^{\prime}}\right)$. Thus, ${{\mathcal{M}}_{{G}^{\prime}}}_{,S}\left(x\right)=\mathsf{\text{LCA}}\left({\mathcal{L}}_{{G}^{\prime},S}\left(Le\left({G}_{x}^{{}^{\prime}}\right)\right)\right)=\mathsf{\text{LCA}}\left({\mathcal{L}}_{{G}^{\u2033},S}\left(Le\left({G}_{y}^{{}^{\u2033}}\right)\right)\right)={{\mathcal{M}}_{{G}^{\u2033}}}_{,S}\left(y\right)$. □
Lemma 3. ℳ_{ G'',S }(w) = ℳ_{ G',S }(w), for all w ∈ V(G')\{x, y}.
Proof. For $g\in V\left({G}_{v}^{{}^{\prime}}\right)\cup \left({G}_{z}^{{}^{\prime}}\right)\cup \left({G}_{{z}^{\prime}}^{{}^{\prime}}\right)$, since ${G}_{g}^{{}^{\prime}}\simeq {G}_{g}^{{}^{\u2033}}$, therefore ℳ_{ G',S }(g) = ℳ_{ G'',S }(g). Also, except for subtree ${G}_{x}^{{}^{\prime}}$, the rest of the tree remains the same in ${G}_{x}^{{}^{\u2033}}$. Thus by Lemma 2, ℳ_{ G',S }(Pa_{ G' } (x)) = ℳ_{ G'',S }(Pa_{ G'' }(y)). Inductively, ℳ_{ G',S }(g) = ℳ_{ G'',S }(g), for all g ∈ V(G')\V(G'_{ x }). □
Lemma 4. ℳ_{ G'' },_{ S }(x) = LCA(ℳ_{ G',S }(v), ℳ_{ G', S }(z')).
Proof. From Lemma 3, ℳ_{ G'',S }(v) = ℳ_{ G',S }(v) and ℳ_{ G'',S }(z') = ℳ_{ G',S }(z'). Thus, ℳ_{ G'',S }(x) = LCA(ℳ_{ G'',S }(v),ℳ_{ G'',S }(z')) = LCA(ℳ_{ G',S }(v),ℳ_{ G',S }(z')). □
Lemma 5. ${\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,g\right)={\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,g\right)$, for all g ∈ V(G'')\{x, y} and Γ ∈ {D, DL, DC}.
Proof. The gene duplication and loss status of a vertex, and the number of lineages from a vertex to its children in G' can change in G'' if its mapping or mapping of any of its children changes in ℳ_{ G'',S }. From Lemma 3, and also, since ℳ_{ G'' },_{ S }(w) = ℳ_{ G',S }(w), for w ∈ Ch(Pa_{ G' }(x)), must have ${\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,P{a}_{{G}^{\prime}}\left(x\right)\right)={\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,P{a}_{{G}^{\prime}}\left(x\right)\right)$. Thus the Lemma follows. □
Let e := (G', G'') ∈ E($\mathcal{X}$) and Γ ∈ {D, DL, DC}. We define $\Gamma e:={\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},S\right)$ with respect to the given species tree S. Observe that this score can be negative too. We study how Γ_{ e } can be computed efficiently for each edge e in $\mathcal{X}$.
Theorem 2. ${\Gamma}_{e}=\sum _{g\in \left\{x,y\right\}}\left({\mathcal{C}}_{\Gamma}\left({G}^{\u2033},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right)\right)$.
Proof .$\begin{array}{c}{\Gamma}_{e}={\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},S\right)=\sum _{g\in V\left({G}^{\u2033}\right)}\left({\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,g\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,g\right)\right)=\sum _{g\in V\left({G}^{\u2033}\right)\backslash \left\{x,y\right\}}({\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,g\right)\\ {\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,g\right))+\sum _{g\in \left\{x,y\right\}}\left({\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,g\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,g\right)\right)=\sum _{g\in \left\{x,y\right\}}\left({\mathcal{C}}_{\Gamma}\left({G}^{\u2033},S,g\right){\mathcal{C}}_{\Gamma}\left({G}^{\prime},S,g\right)\right).\end{array}$
□
Definition 11. Let $\overline{G}:=SP{R}_{G}\left(v,Ro\left(G\right)\right)$, and let P_{ G' } be a path from $\overline{G}$to G^{'} in $\mathcal{X}$. For G^{'}, we define the scoredifference ${\Gamma}_{\overline{G},G\prime}$as ${\Gamma}_{\overline{G},G\prime}:=\sum _{e\in E\left({P}_{G\prime}\right)}{\Gamma}_{e}$.
Theorem 3. For given S, G, and v ∈ V(G), the tree G' ∈ V($\mathcal{X}$) is the output of a RSECΓ problem iff ${\Gamma}_{\overline{G},{G}^{\prime}}=mi{n}_{G\u201d\in V\left(\mathcal{X}\right)\phantom{\rule{0.3em}{0ex}}}{\Gamma}_{\overline{G},G\u201d}$.
Proof. Let ${\Gamma}_{\overline{G},{G}^{\prime}}=mi{n}_{{G}^{\u2033}\in V\left(\mathcal{X}\right)\phantom{\rule{0.3em}{0ex}}}{\Gamma}_{\overline{G},{G}^{\u2033}}$. We prove that G' is the output of RSECΓ problem. Since ${{\Gamma}_{\u1e20,G}}_{{}^{\prime}}=\sum _{e\in E\left({{P}_{G}}_{{}^{\prime}}\right)}{\Gamma}_{e}=\Gamma \left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S\right)\Gamma \left(\u1e20,\phantom{\rule{2.77695pt}{0ex}}S\right)$, thus G' gives the minimum normalized ${\mathcal{C}}_{\Gamma}$ score over all trees in V($\mathcal{X}$). Hence, G' must be the output of the RSECΓ problem. The other direction follows similarly. □
The algorithm
We describe a general algorithm, called AlgoRSECΓ, to solve the RSECΓ problem for each Γ ∈ {D, DL, DC}. Initially AlgoRSECΓ computes (i) the root vertex of the NNIadjacency graph $\mathcal{X}$, which we call $\overline{G}$, by regrafting the subtree G_{ v } above the root of G, (ii) the LCA mapping from $\overline{G}$ to S, and (iii) the Γ score from $\overline{G}$ to S. Then recursively AlgoRSECΓ computes the LCA mapping and Γ score for every vertex G' in $\mathcal{X}$ when the LCA mapping and Γ score of its parent vertex in $\mathcal{X}$ is known. Algorithm 1 details AlgoRSECΓ.
Algorithm 1  AlgoRSECΓ
Input: A gene tree G, a species tree S, and v ∈ V(G)
Output: A tree G* ∈ SPR_{ G }(v) such that ${\mathcal{C}}_{\Gamma}\left({G}^{*},\phantom{\rule{2.77695pt}{0ex}}S\right)={\text{min}}_{{G}^{\prime}\in SP{R}_{G}\left(v\right)}{\mathcal{C}}_{\Gamma}\left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S\right)$
01. Compute $\overline{G}$ by pruning G _{ v } and regrafting at Ro(G)
02. Compute LCA mapping ${\mathcal{M}}_{\u1e20,S}$
03. Call ${\mathcal{C}}_{\mathsf{\text{G}}}\left(\overline{G},S\right)=AlgoCompScore\left(\overline{G},S,{\mathcal{M}}_{\overline{G},S}\right)$
04. Set $BestTree=\overline{G}$, BestScore = 0
05. Set ${G}^{\prime}=\u1e20$, ${\mathcal{M}}_{{G}^{\prime},S}={\mathcal{M}}_{\u1e20,S}$, ${\mathcal{C}}_{\Gamma}\left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S\right)={\mathcal{C}}_{\Gamma}\left(\u1e20,\phantom{\rule{2.77695pt}{0ex}}S\right)$, ${{\Gamma}_{\u1e20,G}}_{\prime}=0$
06. For each $k\ne Ro\left({\u1e20}_{Sb\left(v\right)}\right)$in preorder traversal of ${\u1e20}_{Sb\left(v\right)}$, do
07. If not backtracking, then
08. Set x = Pa_{ G' }(v), y = Sb_{ G }'(v)
09. Set G'' = NNI_{ G' }(Sb_{ G' }(k))
10. Set ℳ_{ G''.S } = ℳ_{ G',S }, ℳG'',_{ S }(y) = ℳ_{ G',S }(x)
11. ℳ_{ G'',S }(x) = LCA(ℳ_{ G',S }(k),ℳ_{ G',S }(v))
12. Call ${\Gamma}_{\left\{{G}^{\prime},G\u201d\right\}}={\sum}_{h\in \left\{x,y\right\}}AlgoGScore\left(G\u201d,\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}{\mathcal{M}}_{G\u201d,S},\phantom{\rule{2.77695pt}{0ex}}h\right)AlgoGScore\left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}{\mathcal{M}}_{{G}^{\prime},S},\phantom{\rule{2.77695pt}{0ex}}h\right)$
13. ${\Gamma}_{\u1e20,G\u201d}={{\Gamma}_{\u1e20,}}_{{G}^{\prime}}+{\Gamma}_{\left\{{G}^{\prime},G\u201d\right\}}$
14. If${\Gamma}_{\u1e20,G\u201d}<BestScore$, then
15. Set BestTree = G'', $BestScore={\Gamma}_{\u1e20,G\u201d}$
16.Else,
17. Set $x=P{{a}_{G}}_{{}^{\prime}}\left(v\right),y=P{{a}_{G}}_{{}^{\prime}}\left(x\right)$
18. Set G'' = NNI_{ G' }(v)
19. Set ${\mathcal{M}}_{{G}^{\u2033},S}={\mathcal{M}}_{{G}^{\prime},S},{\mathcal{M}}_{{G}^{\u2033},S}\left(x\right)={\mathcal{M}}_{G\prime ,S}\left(y\right)$
20. Set ${\mathcal{M}}_{{G}^{\u2033},S}(y)=LCA\left({\mathcal{M}}_{{G}^{\prime},S}\left(S{b}_{{G}^{\prime}}(x)\right),{\mathcal{M}}_{{G}^{\prime},S}(k)\right)$
21. Call ${\Gamma}_{\left\{{G}^{\u2033},{G}^{\prime}\right\}}={\sum}_{h\in \left\{x,y\right\}}AlgoG\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}Score\left({G}^{\prime},S,{\mathcal{M}}_{{G}^{\prime},S},h\right)Algo\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}G\phantom{\rule{0.3em}{0ex}}\phantom{\rule{0.3em}{0ex}}Score\left({G}^{\u2033},S,{\mathcal{M}}_{{G}^{\u2033},S},h\right)$
22. Set ${\Gamma}_{\u1e20,{G}^{\u2033}}={\Gamma}_{\u1e20,{G}^{\prime}}\phantom{\rule{2.77695pt}{0ex}}{\Gamma}_{\left({G}^{\u2033},{G}^{\prime}\right)}$
23. Set ${G}^{\prime}={G}^{\u2033},{\mathcal{M}}_{{G}^{\prime},S}={\mathcal{M}}_{{G}^{\u2033},S},{\Gamma}_{\u1e20,{G}^{\prime}}={\Gamma}_{\u1e20,{G}^{\u2033}}$
24. Return BestTree
Algorithm 2  AlgoCompScore
Input: A gene tree G, a species tree S, and LCA mapping ℳ_{ G,S }
Output:${\mathcal{C}}_{\Gamma}$(G,S)
01. score = 0
02. For each g ∈ I(G) in preorder traversal of G, do
03. $Callscore=score+AlgoGScore\left(G,S,{{\mathcal{M}}_{G}}_{,S},g\right)$
04. If Γis DC, then
05. score = score  I(S)
06. Return score
Algorithm 3  AlgoGScore
Input: A gene tree G, a species tree S, LCA mapping ℳ_{ G }_{,S}, and g ∈ I(G)
Output:${\mathcal{C}}_{\Gamma}$(G, S, g)
01. If Γ is D, then
02. If ℳ(g) ∈ ℳ(Ch(g)), then
03. Return 1
04. ElseIf Γis DL, then
05 $ls={\sum}_{h\in Ch\left(g\right)}dp\left(\mathcal{M}\left(h\right)\right)dp\left(\mathcal{M}\left(g\right)\right)1$
06. If ℳ(g) ∈ ℳ(Ch(g)), then
07. Return ls + 1
08. Else
09. Return ls
10. Else // Γ is DC
11 Return${\sum}_{h\in Ch\left(g\right)}dp\left(\mathcal{M}\left(h\right)\right)dp\left(\mathcal{M}\left(g\right)\right)$
Lemma 6. The RSEC Γ problem is correctly solved by AlgoRSEC Γ.
Proof. Lemma 15 and Theorem 13 directly imply that in order to prove the correctness of algorithm AlgoRSECΓ, it is sufficient to prove that it correctly returns G' of minimum ${\Gamma}_{\u1e20,G\prime}$ among all G' ∈ V($\mathcal{X}$). We will show that algorithm AlgoRSEC accounts each G' ∈ V($\mathcal{X}$), correctly computes ${\Gamma}_{\u1e20,G\prime}$ for Γ ∈ {D, DL, DC}, and returns the right G' as output.
From Definition 10, V($\mathcal{X}$) = SPR_{ G }(v). In AlgoRSECΓ, step 1 prunes subtree G_{ v } and regrafts it above the root of G to create $\overline{G}$. Step 5 sets G' to $\overline{G}$. The forloop in step 6 traverses subtree ${\u1e20}_{Sb\left(v\right)}$ in preorder. For each traversed vertex $k\ne Ro\left({\u1e20}_{Sb\left(v\right)}\right)$, step 9 builds the tree G'':= SPR_{ G }(v, k) by applying NNI operation on the last build G''. Each forloop iteration sets G' to the last build G'' in step 23. $\overline{G}$ and G''s constitute all the trees in SPR_{ G }(v).
For $\overline{G}$, step 2 computes the LCA mapping and step 5 sets ${\Gamma}_{\u1e20,{G}^{\prime}}$ to zero. Following Lemma 24 and Theorem 2, step 10 and 11 update the LCA of G'' and step 12 computes ${\Gamma}_{\left\{{G}^{\prime},{G}^{\u2033}\right\}}$ by calling algorithm AlgoGScore. Depending on Γ ∈ {D, DL, DC}, there are three cases:
Case 1: Γ is D. AlgoGScore returns 1, if the vertex g ∈ V(G'') maps to the same vertex in S as any of its children maps to, otherwise 0.
Case 2: Γ is DL. AlgoGScore computes losses by applying the formula of Definition 4. Further, it adds 1 if there is a duplication.
Case 3: Γ is DC. AlgoGScore, returns the number of lineages from g to each of its children h ∈ Ch(g) in S. For each h ∈ Ch(g), depth of ℳ(g) is subtracted from depth of ℳ(h) to count number of edges between ℳ(g) and ℳ(h).
In AlgoRSECΓ, step 13 computes ${\Gamma}_{\overline{G},{G}^{\u2033}}$ by adding ${\Gamma}_{\overline{G,}{G}^{\prime}}$ and ${\Gamma}_{\left\{{G}^{\prime},{G}^{\u2033}\right\}}$. When backtracking, steps 1722 are executed to restore the right G' to compute the next unique G'' ∈ Ch$\mathcal{X}$(G). This ensures that the correct ${\Gamma}_{\u1e20,{G}^{\prime}}$ is computed for each G' ∈ V($\mathcal{X}$).
In AlgoRSECΓ, step 4 sets $\overline{G}$ as the BestTree and ${\Gamma}_{\u1e20,\overline{G}}\phantom{\rule{0.3em}{0ex}}\mathsf{\text{=}}\phantom{\rule{0.3em}{0ex}}\mathsf{\text{0}}$ as BestScore. Every time a new G'' ∈ Ch$\mathcal{X}$(G) is encountered, step 14 compares ${{\Gamma}_{\u1e20,}}_{{G}^{\u2033}}$ with BestScore, and updates BestTree with G'' of the minimum ${{\Gamma}_{\u1e20,}}_{{G}^{\u2033}}$. After the forloop, step 24 returns the BestTree. □
Lemma 7. The RSECΓ and SEC Γ problems can be solved in Θ(n) and Θ(n^{2}) time, respectively.
Proof. We will prove that the algorithm AlgoRSECΓsolves the restricted SPR based errorcorrection problems for each Γ ∈ {D, DL, DC} in Θ(n) time. In AlgoRSECΓ, step 1 takes constant time. Step 2 precomputes LCA values for species tree in O(n) time [24], and so, finds LCA mapping from $\overline{G}$ to S in O(n) time in bottomup manner. Step 3 computes the duplication, duplicationloss or deep coalescence score of $\overline{G}$ and S by calling AlgoCompScore. In AlgoCompScore, step 1 and step 2 runs for O(1) and O(n) time, respectively. Step 3 calls AlgoGScore in each iteration of forloop. AlgoGScore runs for O(1) time for Γ ∈ {D, DL, DC}.
When Γ is DC, steps 4 and 5 are further executed in AlgoCompScore for constant time. Thus in AlgoRSECΓ, step 3 runs for O(n) time. Further, steps 4 and 5 take constant time. The loop of step 6 runs for Θ(n) time. If condition of step 7 is true, steps 810 executes in constant time. With precomputed LCA values from step 2, step 11 executes in constant time. AlgoGScore runs for constant time for Γ ∈ {D, DL, DC}, and lets step 12 to execute in constant time. Further, steps 1315 execute for constant time too. If the condition in step 7 is false, then steps 1722 execute in constant time, similarly. Finally, step 23 runs for constant time, and hence, the RSECΓ problem can be solved in Θ(n) time. From Observation 1, AlgoRSECΓ is called Θ(n) time to solve SECΓ problem. Thus, the SECΓ problem can be solved in Θ(n^{2}) time. □
Solving the TECΓ problems
In this section we study the TBR based errorcorrection problems, for duplication (D), duplicationloss (DL), and deep coalescence (DC). More precisely, we extend our solution for the SECΓ problems to solve the TECΓ problems. A TBR operation can be viewed as an SPR operation, except that the pruned subtree can be rerooted before it is regrafted. Our speedup for the SECΓ problems is achieved by observing that the scores Γof any rerooted pruned subtree and its remaining pruned tree are independent of each other. We define the RTECΓ problems for the TECΓ problems, as we defined the RSECΓ problems for the SECΓ problems. We will show that the RTECΓ problems can be solved by solving two smaller problems separately and combining their solutions.
Definition 12. Let T be a tree and x ∈ V(T). RR(T, x) is defined to be the tree T , if x = Ro(T) or x ∈ Ch(Ro(T)). Otherwise, RR(T, x) is the tree obtained by suppressing Ro(T), and subdividing the edge (Pa(x), x) by the new root node.
Lemma 8. Given a tuple 〈G, S, v〉, and G'':= TBR_{ G }(v, x, y), for x ∈ V(G_{ v }), y ∈ V(G)\V(G_{ v }). Then, ${\mathcal{C}}_{\Gamma}({G}^{\prime}\prime ,S){\le}_{{G}^{\prime}\in TB{R}_{G}(v)}{\mathcal{C}}_{\Gamma}({G}^{\prime},S)iff{\mathcal{C}}_{\Gamma}(RR({G}_{v},x),S){\le}_{{x}^{\prime}\in V({G}_{v}}{}_{)}{\mathcal{C}}_{\Gamma}(RR({G}_{v},{x}^{\prime}),S)$and ${\mathcal{C}}_{\Gamma}({{G}^{\prime}}^{\prime},S){\le}_{{G}^{\prime}\in TB{R}_{G}(v}{{}_{,}}_{x)}{\mathcal{C}}_{\Gamma}({G}^{\prime},S)$.
Proof. (⇒) Let G^{1} := TBR_{ G }(v, x_{1,} y), for x_{1} ∈ V(G_{ v }), and x_{1} ≠ x. Now observe that, $\forall g\in V\left(G\right)\backslash V\left({G}_{v}\right),\phantom{\rule{2.77695pt}{0ex}}{\mathcal{C}}_{\Gamma}\left({G}^{\u2033},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right)={\mathcal{C}}_{\Gamma}\left({G}^{1},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right)$ Also, let G^{2} := TBR_{ G }(v, x, y_{1}), for y_{1} ∈ V(G)\V(G_{ v }), and y_{1} ≠ y. Observe that, $\forall g\in V\left({G}_{v}\right),\phantom{\rule{2.77695pt}{0ex}}{\mathcal{C}}_{\Gamma}\left({G}^{\u2033},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right)={C}_{\Gamma}\left({G}^{2},\phantom{\rule{2.77695pt}{0ex}}S,\phantom{\rule{2.77695pt}{0ex}}g\right)$. Thus, if G'' gives the minimum duplication, duplicationloss, or deep coalescence score among all trees in TBR_{ G }(v), then the score contribution of vertices in V(G_{ v }) and V(G)\V(G_{ v }) is independent. Now looking at vertices of G, the best score is achieved when G_{ v } is rooted at x, i.e. ${\mathcal{C}}_{\Gamma}\left(RR\left({G}_{v},\phantom{\rule{2.77695pt}{0ex}}x\right),\phantom{\rule{2.77695pt}{0ex}}S\right){\le}_{{x}^{\prime}\in V\left({G}_{v}\right)}{\mathcal{C}}_{\Gamma}\left(RR\left({G}_{v},\phantom{\rule{2.77695pt}{0ex}}{x}^{\prime}\right),\phantom{\rule{2.77695pt}{0ex}}S\right)$; also the best score is achieved when RR(G_{v,} x) is regrafted at y, i.e., ${\mathcal{C}}_{\Gamma}\left({G}^{\u2033},\phantom{\rule{2.77695pt}{0ex}}S\right){\le}_{{G}^{\prime}\in \mathsf{\text{TB}}{\mathsf{\text{R}}}_{G}\left(v,x\right)}{\mathcal{C}}_{\Gamma}\left({G}^{\prime},\phantom{\rule{2.77695pt}{0ex}}S\right).\phantom{\rule{0.3em}{0ex}}\left(\Leftarrow \right)$. This follows similarly. □
Lemma 8 implies that a tree in TBR_{ G }(v) with the minimum duplication, duplicationloss, or deep coalescence cost can be obtained by optimizing the rooting for the pruned subtree, and the regraft location, separately. A best rooting for the pruned subtree is linear time computable [17, 25], and the solution to the RSEC problem identifies a best regraft location in Θ(n) time. This allows to obtain a tree in TBR_{ G }(v) with the minimum duplication, duplicationloss, or deep coalescence cost by evaluating only Θ(n) trees. Thus the RTECΓ problem can be solved in Θ(n) time. The TECΓ problem can be solved by calling the solution of RTECΓ problem Θ(n) times, and Theorem 4 follows.
Theorem 4. The TEC Γ problem can be solved in Θ(n^{2}) time.
Experimental results
Error correction based on deep coalescence model
Reconciliation Cost  Original  PostCorrection 

0  45  77 
1  32  15 
2  6  8 
3  9  5 
4  8  0 
>4  6  1 
Error correction based on duplication and loss model
Reconciliation Cost  Original  PostCorrection 

0  45  77 
15  32  15 
610  15  13 
1115  8  0 
1620  5  1 
>20  1  0 
We also implemented a protocol to use the gene rearrangement algorithm to correct for gene tree error in gene tree parsimony phylogenetic analyses. We first took a collection of input gene trees and performed a SPR species tree search using Duptree [30], which seeks the species tree with the minimum gene duplication cost. We used the duplication only cost (instead of duplications and losses) because when there is no complete sampling of all existing genes, the loss estimates may be inflated by missing sequences. After finding the locally optimal species tree, we used our SPR gene tree rearrangement algorithm to find gene tree topologies with a lower duplication cost. We then performed another SPR species tree search using Duptree, starting from the locally optimal species tree and using the new gene tree topologies. This search strategy is similar to rerooting protocol in Duptree, which checks for better gene tree roots after a SPR species tree search [30, 31]. We tested this protocol on data set of 6,084 genes (with a combined 81,525 leaves) from 14 seed plant taxa. This is the same data set used by [31], except that all gene tree clades containing sequences from a single species were collapsed to a single leaf. Our original SPR tree search found a species tree with 23,500 duplications. The SPR tree search after the gene tree rearrangements identified the same species tree, but the new gene trees had a reconciliation cost of only 18,213. This tree search protocol took just under 4 hours on a Mac Powerbook with a 2 GHz Intel Core 2 Duo processor and 2 GB memory.
Conclusion
GTST reconciliation provides a powerful approach to study the patterns and processes of gene and genome evolution. Yet it can be thwarted by the error that is an inherent part of gene tree inference. Any reliable method for GTST reconciliation must account for gene tree error; however, any useful method also must be computationally tractable for largescale genomic data. We introduce fast and effective algorithms to correct error in the gene trees. These algorithms, based on SPR and TBR rearrangements, greatly extend upon the range of possible errors in the gene tree from existing algorithms [17, 18], while remaining fast enough to use on data sets with thousands of genes. These algorithms can correct trees based on a broad variety of evolutionary factors that can cause conflict between gene trees and species trees, including gene duplication, duplications and losses, and deep coalescence.
Our analysis on 106 yeast gene trees demonstrates that even a single SPR correction on the gene trees can radically improve upon the reconciliation cost. Our results in the yeast analysis are very similar to the 23 fold improvement in implied duplications and losses reported from the parametric gene tree estimation and reconciliation method of Rasmussen and Kellis [5]. However, in contrast, to this computationally complex method, the gene tree rearrangement algorithm is extremely fast, does not require assumption about the rates of duplication and loss, and is also amenable to corrections based on deep coalescence and duplications as well as duplications and losses. We do not claim that the gene correction algorithms produce a more accurate reconciliation than these parametric methods. However, they do present an extremely fast and flexible alternative.
We also demonstrated that this error correction protocol could easily be incorporated into a gene tree parsimony phylogenetic analysis. Previous studies have emphasized that gene tree parsimony is sensitive to the topology of the input trees. For example, the species tree may differ whether the gene trees are made using parsimony or maximum likelihood [8, 10]. In our study, although the gene tree rearrangement did not affect the species tree inference, it did greatly reduce the gene duplication reconciliation cost.
While the results of the experiments are promising, they also suggest several directions for future research. First, further investigation is needed to characterize the effects of error on gene tree topologies. For example, it seems likely that gene tree errors may extend beyond a single SPR or TBR neighborhood. Yet, if we allow unlimited rearrangements, the gene trees will simply converge on the species tree topology. One simple improvement may be to weight the possible gene tree rearrangements based on support for different clades in the gene tree. Thus, wellsupported clades may be rarely or never be subject to rearrangement, while poorly supported clades may be subject to extensive rearrangements. Finally, these approaches implicitly assume that all differences between gene trees and species trees are due to either coalescence, duplications, or duplications and losses. Future work will seek to combine these objectives and also address lateral transfer.
Author's contributions
RC was responsible for algorithm design and program implementation, and wrote major parts of the paper. JGB performed the experimental evaluation and the analysis of the results, and contributed to the writing of the paper. OE supervised the project, contributed to the algorithmic design and writing of the paper.
All authors read and approved the final manuscript.
Declarations
Acknowledgements
The authors thank André Wehe for his generous support with the implementation. This work was conducted in parts with support from the Gene Tree Reconciliation Working Group at NIMBioS through NSF award EF0832858, with additional support from the University of Tennessee. R.C. and O.E. were supported in parts by NSF awards #0830012 and #10117189.
This article has been published as part of BMC Bioinformatics Volume 13 Supplement 10, 2012: "Selected articles from the 7th International Symposium on Bioinformatics Research and Applications (ISBRA'11)". The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements/13/S10.
Authors’ Affiliations
References
 Maddison WP: Gene Trees in Species Trees. Systematic Biology. 1997, 46: 523536. 10.1093/sysbio/46.3.523.View ArticleGoogle Scholar
 Goodman M, Czelusniak J, Moore GW, RomeroHerrera AE, Matsuda G: Fitting the gene lineage into its species lineage. A parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology. 1979, 28: 132163. 10.2307/2412519.View ArticleGoogle Scholar
 Guigó R, Muchnik I, Smith TF: Reconstruction of Ancient Molecular Phylogeny. Molecular Phylogenetics and Evolution. 1996, 6 (2): 189213. 10.1006/mpev.1996.0071.View ArticlePubMedGoogle Scholar
 Slowinski JB, Knight A, Rooney AP: Inferring Species Trees from Gene Trees: A Phylogenetic Analysis of the Elapidae (Serpentes) Based on the Amino Acid Sequences of Venom Proteins. Molecular Phylogenetics and Evolution. 1997, 8: 349362. 10.1006/mpev.1997.0434.View ArticlePubMedGoogle Scholar
 Rasmussen MD, Kellis M: A Bayesian approach for fast and accurate gene tree reconstruction. Molecular Biology and Evolution. 2011, 28: 273290. 10.1093/molbev/msq189.PubMed CentralView ArticlePubMedGoogle Scholar
 Burleigh JG, Bansal MS, Wehe A, Eulenstein O: Locating LargeScale Gene Duplication Events through Reconciled Trees: Implications for Identifying Ancient Polyploidy Events in Plants. Journal of Computational Biology. 2009, 16: 10711083. 10.1089/cmb.2009.0139.View ArticlePubMedGoogle Scholar
 Hahn MW: Bias in phylogenetic tree reconciliation methods: implications for vertebrate genome evolution. Genome Biology. 2007, 8: R14110.1186/gb200787r141.PubMed CentralView ArticlePubMedGoogle Scholar
 Burleigh JG, Bansal MS, Eulenstein O, Hartmann S, Wehe A, Vision TJ: Genomescale phylogenetics: inferring the plant tree of life from 18,896 discordant gene trees. Systematic Biology. 2011, 60 (2): 117125. 10.1093/sysbio/syq072.PubMed CentralView ArticlePubMedGoogle Scholar
 Huang H, Knowles LL: What Is the Danger of the Anomaly Zone for Empirical Phylogenetics?. Systematic Biology. 2009, 58: 527536. 10.1093/sysbio/syp047.View ArticlePubMedGoogle Scholar
 Sanderson MJ, McMahon MM: Inferring angiosperm phylogeny from EST data with widespread gene duplication. BMC Evolutionary Biology. 2007, 7 (suppl 1:S3):Google Scholar
 BerglundSonnhammer A, Steffansson P, Betts MJ, Liberles DA: Optimal Gene Trees from Sequences and Species Trees Using a Soft Interpretation of Parsimony. Journal of Molecular Evolution. 2006, 63: 240250. 10.1007/s0023900500961.View ArticlePubMedGoogle Scholar
 Vernot B, Stolzer M, Goldman A, Durand D: Reconciliation with nonbinary species trees. Computational Systems Bioinformatics. 2007, 53: 441452.View ArticleGoogle Scholar
 Yu Y, Warnow T, Nakhleh L: Algorithms for MDCBased Multilocus Phylogeny Inference. RECOMB, Volume 6577 of Lecture Notes in Computer Science. Edited by: Bafna V, Sahinalp SC. 2011, Springer, 531545.Google Scholar
 Cotton JA, Page RDM: Going nuclear: gene family evolution and vertebrate phylogeny reconciled. P Roy Soc Lond B Biol. 2002, 269: 15551561. 10.1098/rspb.2002.2074.View ArticleGoogle Scholar
 Joly S, Bruneau A: Measuring Branch Support in Species Trees Obtained by Gene Tree Parsimony. Systematic Biology. 2009, 58: 100113. 10.1093/sysbio/syp013.View ArticlePubMedGoogle Scholar
 Arvestad L, Berglund A, Lagergren J, Sennblad B: Gene tree reconstruction and orthology analysis based on an integrated model for duplications and sequence evolution. RECOMB. 2004, 326335.View ArticleGoogle Scholar
 Chen K, Durand D, FarachColton M: Notung: a program for dating gene duplications and optimizing gene family trees. Journal of Computational Biology. 2000, 7: 429447. 10.1089/106652700750050871.View ArticlePubMedGoogle Scholar
 Durand D, Halldórsson BV, Vernot B: A Hybrid MicroMacroevolutionary Approach to Gene Tree Reconstruction. Journal of Computational Biology. 2006, 13 (2): 320335. 10.1089/cmb.2006.13.320.View ArticlePubMedGoogle Scholar
 Allen BL, Steel M: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics. 2001, 5: 113. 10.1007/s0002600180068.View ArticleGoogle Scholar
 Bordewich M, Semple C: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics. 2004, 8: 409423.View ArticleGoogle Scholar
 Zhang L: On a MirkinMuchnikSmith Conjecture for Comparing Molecular Phylogenies. Journal of Computational Biology. 1997, 4 (2): 177187. 10.1089/cmb.1997.4.177.View ArticlePubMedGoogle Scholar
 Page RDM: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology. 1994, 43: 5877.Google Scholar
 Eulenstein O: Predictions of geneduplications and their phylogenetic development. PhD thesis. University of Bonn, Germany 1998. [GMD Research Series No. 20/1998, ISSN: 14352699]Google Scholar
 Bender MA, FarachColton M: The LCA Problem Revisited. LATIN. 2000, 8894.Google Scholar
 Górecki P, Tiuryn J: Inferring phylogeny from whole genomes. ECCB (Supplement of Bioinformatics). 2006, 116122.Google Scholar
 Rokas A, Williams BL, King N, Carroll SB: Genomescale approaches to resolving incongruence in molecular phylogenies. Nature. 2003, 425 (6960): 798804. 10.1038/nature02053.View ArticlePubMedGoogle Scholar
 Than C, Nakhleh L: Species tree inference by minimizing deep coalescences. PLoS Comput Biol. 2009, 5 (9): e100050110.1371/journal.pcbi.1000501.PubMed CentralView ArticlePubMedGoogle Scholar
 Bansal MS, Burleigh JG, Eulenstein O: Efficient genomescale phylogenetic analysis under the duplicationloss and deep coalescence cost models. BMC Bioinformatics. 2010, 11 (Suppl 1): S4210.1186/1471210511S1S42.PubMed CentralView ArticlePubMedGoogle Scholar
 Stamatakis A: RAxMLVIHPC: maximum likelihoodbased phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics. 2006, 22 (21): 26882690. 10.1093/bioinformatics/btl446.View ArticlePubMedGoogle Scholar
 Wehe A, Bansal MS, Burleigh JG, Eulenstein O: DupTree: a program for largescale phylogenetic analyses using gene tree parsimony. Bioinformatics. 2008, 24 (13):Google Scholar
 Chang W, Burleigh JG, FernándezBaca D, Eulenstein O: An ILP solution for the gene duplication problem. BMC Bioinformatics. 2011, 12 (Suppl 1): S1410.1186/1471210512S1S14.PubMed CentralView ArticlePubMedGoogle 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.