Skip to content

Advertisement

BMC Genomics

From 10am - 4pm GMT on Tuesday 20th June, BMC accounts will be unavailable due to scheduled maintenance. We apologise for any inconvenience caused.

Volume 18 Supplement 4

Selected articles from the Fifth IEEE International Conference on Computational Advances in Bio and Medical Sciences (ICCABS 2015): Genomics

Research
Open Access

Estimation of the true evolutionary distance under the fragile breakage model

BMC Genomics201718(Suppl 4):356

https://doi.org/10.1186/s12864-017-3733-3

©  The Author(s) 2017

Published: 24 May 2017

Abstract

Background

The ability to estimate the evolutionary distance between extant genomes plays a crucial role in many phylogenomic studies. Often such estimation is based on the parsimony assumption, implying that the distance between two genomes can be estimated as the rearrangement distance equal the minimal number of genome rearrangements required to transform one genome into the other. However, in reality the parsimony assumption may not always hold, emphasizing the need for estimation that does not rely on the rearrangement distance. The distance that accounts for the actual (rather than minimal) number of rearrangements between two genomes is often referred to as the true evolutionary distance. While there exists a method for the true evolutionary distance estimation, it however assumes that genomes can be broken by rearrangements equally likely at any position in the course of evolution. This assumption, known as the random breakage model, has recently been refuted in favor of the more rigorous fragile breakage model postulating that only certain “fragile” genomic regions are prone to rearrangements.

Results

We propose a new method for estimating the true evolutionary distance between two genomes under the fragile breakage model. We evaluate the proposed method on simulated genomes, which show its high accuracy. We further apply the proposed method for estimation of evolutionary distances within a set of five yeast genomes and a set of two fish genomes.

Conclusions

The true evolutionary distances between the five yeast genomes estimated with the proposed method reveals that some pairs of yeast genomes violate the parsimony assumption. The proposed method further demonstrates that the rearrangement distance between the two fish genomes underestimates their evolutionary distance by about 20%. These results demonstrate how drastically the two distances can differ and justify the use of true evolutionary distance in phylogenomic studies.

Keywords

Genome rearrangementsEvolutionary distanceChromosomal evolutionDCJFragile breakage modelRandom breakage model

Background

Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals (that flip segments of a chromosome), translocations (that exchange segments of two chromosomes), fusions (that merge two chromosomes into one), and fissions (that split a single chromosome into two). These four types of rearrangements can be modeled by Double-Cut-and-Join (DCJ) operations [1], which break a genome at two positions and glue the resulting fragments in a new order.

The ability to estimate the evolutionary distance between extant genomes plays a crucial role in many phylogenomic studies. Often such estimation is based on the parsimony assumption, implying that the distance between two genomes can be estimated as the rearrangement distance equal the minimal number of genome rearrangements required to transform one genome into the other. However, in reality the parsimony assumption may not always hold, emphasizing the need for estimation that does not rely on the (minimal) rearrangement distance. The evolutionary distance that accounts for the actual (rather than minimal) number of rearrangements between two genomes is often referred to as the true evolutionary distance.

While there exists a method for estimation of the true evolutionary distance [2], it however implicitly assumes that genomes can be broken by rearrangements equally likely at any position in the course of evolution. This assumption, known as the random breakage model (RBM) of chromosome evolution [3, 4], has been refuted in favor of the more rigorous fragile breakage model (FBM) [5] postulating that only certain “fragile” genomic regions are prone to rearrangements. The FBM is supported by many recent studies of various genomes (e.g., see references in [6]). The RBM can be viewed as an extremal case of the FBM, where every genomic region is fragile.

In the current study, we propose a new method for estimating the evolutionary distance between two genomes with high accuracy under the FBM. We assume that the given genomes are represented as sequences of the same blocks (synteny blocks or orthologous genes) and evolved from a common ancestral genome with a number of DCJs. Our method estimates the total number of DCJs on the evolutionary path between such genomes. The results of using our method on a simulated dataset show a high level of precision. We also analyze yeast genome data and show that some, but not all pairs of yeast genomes fall under the parsimony assumption.

The subtle difference between the RBM and FBM from the perspective of true evolutionary distance estimation is the (in)ability to count the number of fragile genomic regions. While breakpoints (block adjacencies present in one genome and absent in the other) definitely represent fragile regions, the shared block adjacencies are treated differently under the two models. Namely, under the RBM a shared block adjacency still represents a fragile region, which just happened to remain conserved across the two genomes by chance. Under the FBM, a shared block adjacency may or may not be fragile.

Methods

Breakpoint graphs and DCJs

We start our analysis with circular genomes (i.e., genomes with circular chromosomes) and address linear genomes later. We represent a genome with n blocks as a genome graph composed of n directed block edges encoding blocks and their strands, and n undirected adjacency edges encoding adjacencies between blocks.

Let P and Q be genomes on the same set of blocks. We assume that in their genome graphs, the adjacency edges of P are colored black (Fig. 1 a) and the adjacency edges of Q are colored red (Fig. 1 b). The breakpoint graph G(P,Q) is the superposition of the genome graphs of P and Q with the block edges removed (Fig. 1 c). The black and red adjacency edges in G(P,Q) form a collection of alternating black-red cycles.
Figure 1
Fig. 1

a Genome graph of unichromosomal genome P = (0, 1, 2,3,4, 5) with adjacency edges colored black. b Genome graph of unichromosomal genome Q=(0,−2,−1,3,−5,−4) with adjacency edges colored red. c The breakpoint graph G(P,Q) of genomes P and Q represents a collection of black-red cycles

We say that a black-red cycle is an ℓ-cycle if it contains ℓ black edges (and ℓ red edges) and let c ℓ (P,Q) be the number of ℓ-cycles in G(P,Q). We refer to 1-cycles as trivial 1 and to the other cycles as non-trivial. The vertices of non-trivial cycles are called breakpoints.

A DCJ in genome Q replaces any pair of red adjacency edges {x,y}, {u,v} with either a pair of edges {x,u}, {y,v} or a pair of edges {u,y}, {v,x}. We say that such a DCJ operates on the edges {x,y}, {u,v} and their endpoints x,y,u,v. A DCJ in genome Q transforming it into a genome Q ′ corresponds to a transformation of the breakpoint graph G(P,Q) into the breakpoint graph G(P,Q ′) (Fig. 2). Each DCJ in the breakpoint graph can merge two black-red cycles into one (if edges {x,y}, {u,v} belong to distinct cycles), split one cycle into two or keep the number of cycles intact (if edges {x,y}, {u,v} belong to the same cycle). The DCJ distance between genomes P and Q is the minimum number of DCJs required to transform Q into P. It can be evaluated as d(P,Q)=b(P,Q)−c(P,Q), where \(b(P,Q)=\sum _{\ell \geq 2} \ell \cdot c_{\ell }(P,Q)\) is half the number of breakpoints and \(c(P,Q)=\sum _{\ell \geq 2} c_{\ell }(P,Q)\) is the number of non-trivial cycles in the breakpoint graph G(P,Q) [1].
Figure 2
Fig. 2

A DCJ in genome Q replaces a pair of red edges in the breakpoint G(P,Q) with another pair of red edges forming matching on the same 4 vertices

Evolutionary model

To estimate the true evolutionary distance between genomes P and Q on the same set of blocks, we view the evolution between them as a discrete Markov process that transforms genome P into genome Q with a sequence of DCJs occurring independently. The process starts at genome X=P and ends at X=Q, and corresponds to a transformation of the breakpoint graphs starting at G(P,P) (formed by a collection of trivial cycles) and ending at G(P,Q). The number of DCJs k in this transformation represents the true evolutionary distance between genomes P and Q.

We remark that under the FBM, the number of trivial cycles (if any) in G(P,Q) is an obscure parameter, since they may correspond to solid (non-fragile) regions as well as to fragile regions that just happen to remain conserved (in both P and Q) by chance.2 Furthermore, there may exist such conserved fragile regions within the blocks forming P and Q and thus such regions cannot be observed in G(P,Q). To account for all these possibilities, we assume that P and Q are composed of a large unknown number n of solid regions interspersed with the same number of fragile regions, some of which remain conserved by chance. In other words, we assume that the given blocks of genomes P and Q are formed by (invisible) solid regions and conserved fragile regions. Let P n and Q n denote these representations of P and Q as sequences of the solid regions. We view genome Q n as obtained from P n with a sequence of k DCJs each operating on two randomly selected fragile regions (i.e., adjacencies between solid regions).

The crucial observation is that while we do not know the number n of solid regions, the breakpoint graphs G(P,Q) and G(P n ,Q n ) have the same cycle structure, except for trivial cycles. That is, we have c ℓ (P n ,Q n )=c ℓ (P,Q) for every ℓ≥2, implying, in particular, that b(P n ,Q n )=b(P,Q), c(P n ,Q n )=c(P,Q), and d(P n ,Q n )=d(P,Q). Indeed, if genomes P ′ and Q ′ are obtained from P and Q by replacing a single block a with two consecutive smaller blocks a 1,a 2, then G(P ′,Q ′) can be obtained from G(P,Q) by adding one trivial cycle (corresponding to the shared adjacency a 1,a 2). Since the genomes P n and Q n can be obtained from P and Q with a number of such operations, the breakpoint graphs G(P,Q) and G(P n ,Q n ) may differ only in the number of trivial cycles.3

In our evolutionary model, the following parameters are observable:

  • c ℓ =c ℓ (P n ,Q n )=c ℓ (P,Q) for any ℓ≥2, i.e., the number of ℓ-cycles in G(P,Q);

  • \(b=b(P_{n},Q_{n}) = b(P,Q) = \sum _{\ell \geq 2} \ell \cdot c_{\ell }\), the number of broken fragile regions between P and Q, which is also the number of synteny blocks between P and Q, or half of the total length of all non-trivial cycles in G(P,Q);

  • \(d = d(P_{n},Q_{n}) = d(P,Q) = b - \sum _{\ell \geq 2} c_{\ell }\), the DCJ distance between P and Q;

while the following parameters are hidden:

  • c 1=c 1(P n ,Q n ), the number of trivial cycles in G(P n ,Q n );

  • n=n(P)=n(Q), the number of fragile regions in each of genomes P and Q, half the total length of all cycles in G(P n ,Q n );

  • k=k(P,Q), the number of DCJs in the Markov process, the true evolutionary distance between P and Q.

Extension to linear genomes

To analyze linear genomes, we add one artificial adjacency between telomeres for each chromosome and consider the resulting circular genomes. Since the number of chromosomes is often negligible as compared to the number of fragile regions (for example, in the yeast genomes that we analyze in the Discussion section, the number of chromosomes ranges between 6 and 8, while the number of fragile regions is at least 710), these artificial edges do not significantly affect the estimation. We refer to [7] for a discussion of subtle differences in the analysis of circular and linear genomes.

Results

We propose a new method for estimating the evolutionary distance between two genomes with high accuracy under the FBM. A key component of our method is the analytical estimation of c ℓ for various ℓ≥2 in terms of k and n, which we describe in the Theoretical analysis subsection below. From this estimation, in the Estimation algorithm subsection we solve the inverse problem to find the true evolutionary distance k (which is our goal) and the number of fragile regions n (as a by-product). In our analysis, we consider only relatively small ℓ and assume that n and k are sufficiently large (see Theorem 1).

Theoretical analysis

Theorem 1

Let genome P n be a genome with n fragile regions and genome Q n be obtained from P n with k=⌊γ n/2⌋ random DCJs for some γ>0. Then, for any fixed ℓ, the proportion of edges that belong to ℓ-cycles in G(P n ,Q n ) is
$$\frac{\ell c_{\ell}}{n} = e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} +O_{p}\left(\frac{1}{\sqrt{n}}\right)as\ n \to \infty \,, $$
where \(O_{p}\left (\frac {1}{\sqrt {n}}\right)\) denotes a term stochastically bounded4.

To prove Theorem 1, we will need some lemmas.

Let us consider a sequence \(\mathcal {D}\) of k random DCJs transforming the graph G(P n ,P n ) into the graph G(P n ,Q n ). Each DCJ in \(\mathcal {D}\) either merges two cycles (merging DCJ), splits one cycle into two (splitting DCJ), or preserves the cycle structure (preserving DCJ). We call set of ℓ black edges proper for the transformation \(\mathcal {D}\) if in the breakpoint graph G(P n ,Q n ) these edges form an ℓ-cycle resulted entirely from ℓ−1 merging DCJs. We remark that each ℓ-cycle in G(P n ,Q n ) is a result of ℓ−1 merging DCJs (we denote the number of such cycles by \(\tilde {c}_{\ell }\)) or is formed with at least one splitting or preserving DCJ. The following lemmas provide an asymptotic for \(\tilde {c}_{\ell }\) and an upper bound for \(c_{\ell } - \tilde {c}_{\ell }\).

Lemma 1

The mean value of \(\tilde {c}_{\ell }\) has the following asymptotic:
$$\mathrm{E}\left(\tilde{c}_{\ell}\right) = \frac{n}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1). $$

Proof

Let us fix a set A of ℓ black edges and find the probability that A is proper for \(\mathcal {D}\). We remark that this probability does not depend on the content of A but only on its size |A|=ℓ, and denote it by \(\tilde {p}_{n,k,\ell }\). There are 2 ℓ−1(ℓ−1)! ways to arrange ℓ black edges into an ℓ-cycle, since there exist (ℓ−1)! circular permutations of length ℓ and 2 ℓ−1 ways to assign directions to their elements. For any ℓ-cycle, there are ℓ ℓ−2 ways to obtain it as a result of ℓ−1 DCJs [8].

We represent \(\mathcal {D}\) as the union \(\mathcal {S} \cup \mathcal {\bar {S}}\), where the subsequence \(\mathcal {S}\) contains ℓ−1 DCJs connecting edges from A into an ℓ-cycle, and the subsequence \(\mathcal {\bar {S}}\) contains the rest of the DCJs. Since \(|\mathcal {D}|=k\) and \(|\mathcal {S}|=\ell -1\), there are \(\binom {k}{\ell -1}\) ways to choose positions for elements of \(\mathcal {S}\) in \(\mathcal {D}\). The k−ℓ+1 DCJs from \(\mathcal {\bar {S}}\) operate on the n−ℓ red edges that are not incident to any black edge from A, and for each pair of red edges there are two possible ways to recombine them with a DCJ. This gives
$$2^{k-\ell+1}\binom{n-\ell}{2}^{k-\ell+1} $$
possible subsequences \(\mathcal {\bar {S}}\). So, there are
$$2^{\ell-1}(\ell-1)! \ell^{\ell-2} \binom{k}{\ell-1} 2^{k-\ell+1} \binom{n-\ell}{2}^{k-\ell+1} $$
transformations \(\mathcal {D}\) such that A is proper for \(\mathcal {D}\). The total number of k-step transformations is equal to \(2^{k} \binom {n}{2}^{k} \,.\) Then the probability \(\tilde {p}_{n,k,\ell }\) can be found as follows
$$ \tilde{p}_{n,k,\ell} = \frac{\ell^{\ell-2}(\ell-1)!\binom{k}{\ell-1}\binom{n-\ell}{2}^{k-\ell+1}}{\binom{n}{2}^{k}} \,. $$
(1)
Since there are \(\binom {n}{\ell }\) ways to choose the set A of black edges, the average number \(\mathrm {E}(\tilde {c}_{\ell })\) of ℓ-cycles obtained by only merging DCJs equals
$$ \begin{aligned} \binom{n}{\ell} \tilde{p}_{n,k,\ell} &= \ell^{\ell-2}(\ell-1)!\binom{n}{\ell}\binom{k}{\ell-1} \cdot\frac{\binom{n-\ell}{2}^{k-\ell+1}}{\binom{n}{2}^{k}} \\ &= \ell^{\ell-2}(\ell-1)! \, \frac{n^{\ell}}{\ell!}\cdot\frac{k^{\ell-1}}{(\ell-1)!}\frac{(n-\ell)^{2(k-\ell+1)}}{2^{k-\ell+1}}\\ &\quad\times\frac{2^{k}}{n^{2k}}+O(1) \\ &= \ell^{\ell-2} k^{\ell-1}\,\cdot \frac{n^{\ell}}{\ell!}\cdot \frac{2^{\ell-1}}{n^{2\ell - 2}} \left(1-\frac{\ell}{n}\right)^{2(k-\ell+1)}\\&\quad+O(1) \\ &= \left(\frac{2k\ell}{n}\right)^{\ell-1} \frac{n}{\ell}\cdot \frac{1}{\ell!}e^{-\gamma \ell}+O(1) \\ &= \frac{n}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1) \,. \end{aligned} $$
(2)

□

Lemma 2

The variance of \(\tilde {c}_{\ell }\) is bounded: \(\text {Var} \left (\tilde {c}_{\ell }\right) = O(n)\).

Proof

For a transformation \(\mathcal {D}\) and a set A of black edges, we define a random variable X A :
$$X_{A} = \left\{\begin{array}{ll} 1, & \text{if}\ A\ \text{is proper for}\ \mathcal{D},\\ 0, & \textrm{otherwise.} \end{array}\right. $$
By definition, \(\tilde {c}_{\ell } = \sum _{A} X_{A},\) where the sum is taken over all possible sets of ℓ black edges. The variance of \(\tilde {c}_{\ell }\) is equal to
$$\mathrm{E} \left(\tilde{c}_{\ell}^{2}\right) - \mathrm{E} \left(\tilde{c}_{\ell}\right)^{2} \,. $$
Since
$$\mathrm{E} \left(\tilde{c}_{\ell}^{2}\right) = \sum_{A} \sum_{B} \mathrm{E} \left(X_{A} X_{B}\right) \,, $$
we will find E(X A X B ) for each pair A,B of sets of ℓ black edges:
$$\mathrm{E} \left(X_{A} X_{B}\right) = \left\{\begin{array}{ll} \tilde{p}_{n,k,\ell}, & \textrm{if }A=B \,,\\ \tilde{p}_{n,k,\ell}\cdot\tilde{p}_{n-\ell,k-\ell+1,\ell}, & \textrm{if }A\cap B = \emptyset \,,\\ 0, & \textrm{otherwise,} \end{array}\right. $$
where \(\tilde {p}_{n,k,\ell }\) is defined by (1). This implies
$$\mathrm{E} \left(\tilde{c}_{\ell}^{2}\right) = \binom{n}{\ell} \tilde{p}_{n,k,\ell} +\binom{n}{\ell} \binom{n-\ell}{\ell} \tilde{p}_{n,k,\ell}\cdot \tilde{p}_{n-\ell,k-\ell+1,\ell} \,. $$
Finally, using (2), we obtain
$${\begin{aligned} \text{Var}\left(\tilde{c}_{\ell}\right) &= \binom{n}{\ell} \tilde{p}_{n,k,\ell} +\binom{n}{\ell} \binom{n-\ell}{\ell} \tilde{p}_{n,k,\ell}\cdot \tilde{p}_{n-\ell,k-\ell+1,\ell} - \mathrm{E} \left(\tilde{c}_{\ell}\right)^{2}\\ &=\binom{n}{\ell} \tilde{p}_{n,k,\ell}\left(1+\binom{n-\ell}{\ell}\tilde{p}_{n-\ell,k-\ell+1,\ell}-\binom{n}{\ell} \tilde{p}_{n,k,\ell}\right)\\ &=\left(\frac{n}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1)\right)\left(1+\frac{n-\ell}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!}\right.\\ &\left.\quad-\frac{n}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1)\right) \\ &= \left(\frac{n}{\ell} e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1)\right) \left(1- e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} + O(1)\right)\\ &= O(n). \end{aligned}} $$
□

For a positive integer M, we call a splitting DCJ M-splitting, if it splits some m-cycle into an i-cycle and an (m−i)-cycle for some i≤M. Similarly, we call a preserving DCJ M-preserving if it operates on an m-cycle for some m≤M.

Lemma 3

Let M be any positive integer. Then (i) the number of M-splitting DCJs in \(\mathcal {D}\) is stochastically dominated by a Poisson random variable with parameter γ M/2; (ii) the number of M-preserving DCJs in \(\mathcal {D}\) is stochastically dominated by a Poisson random variable with parameter γ M 2/4.

Proof

To prove (i), we notice that the probability that a DCJ from \(\mathcal {D}\) splits a fixed m-cycle into an i-cycle and an (m−i)-cycle is \(\frac {m}{n(n-1)}\) (if i≠m/2) or \(\frac {m}{2n(n-1)}\) (if i=m/2). The probability that a DCJ splits a cycle into an i-cycle with i≤M and another cycle can be bounded by
$$\sum_{i=1}^{M} \sum_{m>i} \frac{m}{n(n-1)}c_{m} \leq \frac{M}{n-1} \,. $$
This bound implies that a number of M-splitting DCJs in \(\mathcal {D}\) is stochastically dominated by the random variable Y that equals j with the probability:
$$ \binom{k}{j}\left(\frac{M}{n-1}\right)^{j} \left(1-\frac{M}{n-1}\right)^{k-j}\!= e^{-\gamma M/2} \frac{(\gamma M/2)^{j}}{j!} + o(1)\,. $$

Since \(e^{-\gamma M/2} \frac {(\gamma M/2)^{j}}{j!}\) represents the probability that a Poisson random variable with parameter γ M/2 is equal to j, the proof of (i) is completed.

To prove (ii), we notice that the probability that a DCJ from \(\mathcal {D}\) operates on two red edges from the fixed m-cycle and does not split this cycle equals \(\frac {m(m-1)}{2n(n-1)}\). Summing over all m≤M, we bound the probability that a fixed DCJ is M-preserving as
$$\sum_{m \leq M} \frac{m^{2}}{2n(n-1)}c_{m} \leq \frac{M^{2}}{2(n-1)} $$
and the proof is completed similarly to the proof of (i) above. □

Now we can prove Theorem 1.

Proof

Lemma 3 implies that \(c_{\ell } - \tilde {c}_{\ell }\), the number of ℓ-cycles obtained with at least one splitting or preserving DCJ, is of order O(1). Indeed, each such ℓ-cycle uniquely determines the last splitting or preserving DCJ that participates in the formation of this cycle (i.e., operates on some of the cycle vertices). Clearly, this last splitting (resp. preserving) DCJ is ℓ-splitting (resp. ℓ-preserving). Since such last DCJ correspond to at most two cycles, it follows that the number \(c_{\ell } - \tilde {c}_{\ell }\) does not exceed twice the number of ℓ-splitting and ℓ-preserving DCJs. By Lemma 3, the number of ℓ-splitting and ℓ-preserving DCJs is bounded (stochastically dominated by a Poisson random variable), we have \(c_{\ell } - \tilde {c}_{\ell } = O(1)\).

Since by Lemmas 1 and 2, the number \(\tilde {c}_{\ell }\) has the mean value \(\frac {n}{\ell } e^{-\gamma \ell }\frac {(\gamma \ell)^{\ell -1}}{\ell !} + O(1)\) and the standard deviation of order \(O(\sqrt {n})\). The fraction of edges in ℓ-cycles is \(\frac {\ell c_{\ell }}{n}\). Applying Chebyshev’s inequality we obtain:
$$\frac{\ell c_{\ell}}{n} = e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!} +O_{p}\left(\frac{1}{\sqrt{n}}\right)\,, $$
which completes the proof. □
We remark that for γ<1, the sequence
$$p_{\ell} = e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!},\qquad \ell=1,2,\dots $$
defines a probability mass function, which characterizes a Borel distribution [9]. So, if γ<1, for a randomly chosen edge, the length of the cycle that contains it follows a Borel distribution with parameter γ. Moreover, the results of Erdös and Rényi [10] imply that
$$1-\sum_{\ell=1}^{\infty}{e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell\cdot\ell!}} = \frac{\gamma}{2} \,, $$
which can also be seen empirically in Fig. 3. It follows that for γ<1, d=k(1+o(1)) and the DCJ distance closely approximates the true distance. While d=k corresponds to the parsimony assumption, we say that the process is in the parsimony phase as soon as γ<1.
Figure 3
Fig. 3

Empirical and analytical curves for the fraction \(\frac {d}{n}\) as a function of γ

From Theorem 1, we have

Corollary 1

$$\frac{b}{n} = 1 - e^{-\gamma} +o_{p}(1) \,. $$

Proof

Indeed, b=n−c 1 and \(\frac {c_{1}}{n} = e^{-\gamma }+o_{p}\,(1)\,\). □

Corollary 2

$$\frac{d}{n} = 1-\sum_{\ell=1}^{\infty} \frac{p_{\ell}}{\ell} +o_{p}(1) \,. $$

Proof

By definition,
$$d = b - \sum_{\ell=2}^{\infty} c_{\ell} = n - \sum_{\ell=1}^{\infty} c_{\ell} \,. $$
For any fixed M, the number of m-cycles, where m>M, is bounded by \(\frac {n}{M}\). By Theorem 1, for any fixed ℓ, we have \(\frac {c_{\ell }}{n} = \frac {p_{\ell }}{\ell }+\frac {\xi _{\ell }}{\sqrt {n}}\), where ξ ℓ is some random variable with E(ξ ℓ )=0 and Var(ξ ℓ )<1. Hence, for any fixed M we have:
$$\frac{1}{n}\sum_{\ell=1}^{\infty} c_{\ell} = \frac{1}{n}\sum_{\ell=1}^{M} c_{\ell} + \frac{1}{n}\sum_{\ell=M+1}^{\infty} c_{\ell} \leq \sum_{\ell=1}^{M}\left(\frac{p_{\ell}}{\ell}+\frac{\xi_{\ell}}{\sqrt{n}}\right)+\frac{1}{M} \,. $$
Let \(\eta = \frac {1}{M}\sum _{\ell =1}^{M} \xi _{\ell }\), then
$$\frac{1}{n}\sum_{\ell=1}^{\infty} c_{\ell} \leq \sum_{\ell=1}^{M}\frac{p_{\ell}}{\ell}+\frac{M\eta}{\sqrt{n}}+\frac{1}{M} \,. $$
From the definition of η it follows that the random variable η has the mean value E(η)=0 and the variance Var(η)<1. Let
$$r(m) = \sum_{\ell=m+1}^{\infty}\frac{p_{\ell}}{\ell} \,, $$
so that \(r(0) = \sum _{\ell =1}^{\infty } \frac {p_{\ell }}{\ell }\). Then
$$\frac{1}{n}\sum_{\ell=1}^{\infty} c_{\ell} - r(0) \leq \frac{1}{M} - r(M) +\frac{M\eta}{\sqrt{n}} \,. $$
The lower bound is obvious
$$\frac{1}{n}\sum_{\ell=1}^{\infty} c_{\ell} - r(0) \geq - r(M)+\frac{M\eta}{\sqrt{n}} \,. $$
Since the series \(\sum _{\ell =1}^{\infty }\frac {p_{\ell }}{\ell }\) converges, for each ε>0 one can choose M and then choose n in such a way that
$$-\varepsilon \leq \frac{1}{n}\sum_{\ell=1}^{\infty} c_{\ell} - r(0) \leq \varepsilon(1+\eta) \,. $$
□
The estimations given in Corollaries 1 and 2 are very precise, as shown in Figs. 4 and 3. All the simulations are performed for n=1000 (see Discussion ).
Figure 4
Fig. 4

Empirical and analytical curves for the fraction \(\frac {b}{n}\) as a function of γ

Estimation algorithm

From Corollaries 1 and 2, we obtain the following approximation for the ratio \(\frac {d}{b}\):
$$ \frac{d}{b} \approx \frac{1-\sum_{\ell=1}^{\infty}{e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell\cdot\ell!}}}{1 - e^{-\gamma}} \,, $$
(3)
and then estimate γ with the bisection method. The plot of \(\frac {d}{b}\) as a function of γ is shown in Fig. 5. As one can see, this function is increasing, and each value of \(\frac {d}{b}\) in the interval [0.5,1] uniquely determines the value of γ. In particular, γ=1 corresponds to \(\frac {d}{b} \approx 0.79\). That is, if \(\frac {d}{b}<0.79\), then the process is in the parsimony phase and the true distance k is accurately approximated by the DCJ distance d.
Figure 5
Fig. 5

The ratio \(\frac {d}{b}\) as a function of γ

Our simulations demonstrate that this estimation method is robust for γ<2. For larger values of γ, the estimator is too sensitive to small random deviations.

Alternatively, the value of γ can be approximated by \(\frac {b}{\sum _{\ell =2}^{m} \ell c_{\ell }}\) for some m. In our simulations, the best results were observed for m=6. Again, the function
$$\begin{array}{*{20}l} f_{m}(\gamma) = \frac{1 - e^{-\gamma}}{\sum_{\ell=2}^{m}e^{-\gamma\ell}\frac{(\gamma\ell)^{\ell-1}}{\ell!}} \end{array} $$
(4)
is increasing (Fig. 6). The applicability limits for this estimator depend on the value of n. Namely, if \(\sum _{\ell =2}^{m} \ell c_{\ell }\) is close to zero, then the estimator becomes sensitive to small deviations. In our simulations with n=1000 (see Discussion ), the estimator is very precise for values γ<2.5 with the relative error below 10% in 95% of observations.
Figure 6
Fig. 6

The plot of function f 6(γ) defined in (4)

Once we obtain an estimated value γ e for γ, it is easy to estimate the values of n and k as follows:
$$ n_{e} = \frac{b}{1-e^{-\gamma_{e}}}\quad\text{and}\quad k_{e} = \frac{\gamma_{e} \cdot n_{e}}2. $$
(5)

We report a value of k e as our estimation for the true evolutionary distance.

Discussion

We evaluated the proposed method on simulated genomes, and further applied it for estimation of the evolutionary distances within a set of five yeast genomes and a set of two fish genomes.

Simulated genomes

We performed a simulation with a fixed number of blocks n=1000 and various values of γ. In each simulation, we started with a genome P on n blocks and applied a number of DCJs, until we reached the upper value of γ (in our case this upper value is 2.5). We denote the resulting genome by Q and estimate γ, n, and k from the genomes P and Q. First we estimate γ by solving the approximate equation
$$\begin{array}{*{20}l} &\frac{b}{2c_{2} +3c_{3} +4c_{4} +5c_{5} +6c_{6}} \approx f_{6}(\gamma) \,. \end{array} $$
(6)

Since the function in the r.h.s. is continuous and increasing, a unique solution exists for any value of the l.h.s. From the estimated value γ e , we compute n e and k e as in (5).

The result of this procedure is shown in Fig. 7 with a box-plot diagram of relative error \(\frac {k_{e}-k}{k}\) of our estimation for each γ∈[0.6,2.5] with a step 0.1. As one can see, the relative error increases with the increase of γ, but even for large values of γ, the median of the relative error is small (e.g., for γ=2.5 the median of the relative error is only 0.0075); and for all γ, the interquartile range is less than 0.1.
Figure 7
Fig. 7

The dependency of distribution of the relative error \(\frac {k_{e}-k}{k}\) on γ

Instead of having 6 terms in the denominator of (6), one can take a smaller number m≥2. While the behavior of the sum with a larger m is more stable generally, our simulations showed very close results for all m between 2 and 10.

Instead of (6), we also used the approximate Eq. (3), which involves only two observable parameters: the DCJ distance d and half the number of breakpoints b. While the resulting estimation is quite similar to the previous one, it is more accurate when γ<1.6 and less accurate γ>2.

Yeast genomes

We analyzed a set of five yeast genomes: A. gossypii, K. lactis, K. thermotolerans, S. kluyveri, and Z. rouxii, represented as sequences of the same 710 synteny blocks [11]. For each pair of genomes, we circularized their chromosomes, constructed the breakpoint graph, and independently estimated the true evolutionary distance between them. The results in Table 1 demonstrate that some but not all pairs of yeast genomes fall under the parsimony phase.
Table 1

For each pair of yeast genomes, x : y gives the estimated true evolutionary distance x and the rearrangement distance y

 

K. lactis

K. thermotolerans

S. kluyveri

Z. rouxii

A. gossypii

375 : 359

260 : 249

228 : 217

336 : 319

K. lactis

 

280 : 272

253 : 240

352 : 344

K. thermotolerans

  

75 : 75

198 : 198

S. kluyveri

   

162 : 162

Fish genomes

We also analyzed two fish genomes: Tetraodon nigroviridis [12] and Gasterosteus aculeatus [13] represented as sequences of the same 6132 genes. Our estimation for the true evolutionary distance between these genomes shows that they do not fall under the parsimony phase: their rearrangement distance equals 3705, while the true evolutionary distance is about 4500.

Conclusions

In the current study, we address the problem of estimating the true evolutionary distance between two genomes under the fragile breakage model. Similarly to our previous study on estimation of the proportion of evolutionary transpositions [14], we model evolution as a sequence of random DCJs and track how these random DCJs change the cycle structure of the breakpoint graph. We show that, while the number of DCJs is less than half the number of fragile regions in the genome, the parsimony assumption holds, and in this case we prove that lengths of alternating cycles are distributed according to a Borel distribution. In this sense our process in the parsimony phase is closely related to the evolution of a random Erdös–Rényi graph [10] in the subcritical regime. A similar process was also analyzed by Berestycki and Durrett [15]. They studied the cycle structure of a permutation obtained from the identity permutation with a sequence of random algebraic transpositions. Our results are consistent with their findings.

We provide estimators for the true evolutionary distance, which show high accuracy on simulated genomes. Our analysis of five yeast genomes shows that some but not all genome pairs fall under the parsimony phase. We also analyzed two fish genomes and revealed that the rearrangement distance between them underestimate the true evolutionary distance by about 20%. This data show how drastically the two distances can differ and emphasize the importance of using the evolutionary (rather than rearrangement) distance in comparative genomics. In contrast to the method of Lin and Moret [2], our method does not rely on the number of common gene adjacencies across two given genomes. Since some genes can form conserved clusters [16], treating all gene adjacencies as fragile regions can lead to a huge bias in the estimation. Our estimator is based only on breakpoints (but not on conserved adjacencies) across two genomes, and so it avoids this issue.

We further remark that our method is based on accurate estimation of the ratio \(\frac {d}{b}\). At the same time, in comparative genomics studies the ratio \(\frac {2d}{b}\) is known as the breakpoint reuse rate [5, 17], representing the average number of breakpoint “uses” by rearrangements in the course of evolution between two genomes. Our parsimony phase condition can therefore be restated as the breakpoint reuse rate being below 1.58. We argue however that the conventional definition of the breakpoint reuse rate does not accurately capture its meaning, in the same way how the rearrangement distance does not quite capture the meaning of evolutionary distance. This inspires a notion of the true breakpoint reuse rate defined as \(\frac {2k}{b}\) (i.e., with the true evolutionary instead of rearrangement distance in the numerator), which can be easily estimated with our method.

In further development of our method, we plan to address the even more accurate turnover fragile breakage model [6], where the set of fragile regions changes with time. We believe this model can better explain the cycle structure of the breakpoint graphs of real genomes (for a recent discussion of associated combinatorial aspects, see [18]).

Endnotes

1 In the breakpoint graph constructed on synteny blocks of two genomes, there are no trivial cycles since no adjacency is shared by both genomes. However, the breakpoint graph constructed on orthologous genes or multi-genome synteny blocks may contain trivial cycles.

2 In contrast, the method of Lin and Moret [2] considers only the latter option, which corresponds to the RBM.

3 In contrast to c 1(P n ,Q n ), the value of c 1(P,Q) is rather arbitrary and thus is ignored in our model.

4 We remind that a sequence of random variables {X n } is stochastically bounded by a deterministic sequence {a n }, denoted X n =O p (a n ), if for all ε>0, there exists C such that for all n, Pr{|X n /a n |>C}<ε. Similarly, X n =o p (a n ) if for all C>0, \({\lim }_{n\to \infty } \text {Pr}\{\left |X_{n}/a_{n}\right | > C\} =0\).

Declarations

Acknowledgements

A short abstract of the present work appeared in the proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences (ICCABS 2015).

Funding

The work is supported by the National Science Foundation under the grant No. IIS-1462107, which has also funded the publication costs.

Availability of data and materials

The data is available upon request.

Authors’ contributions

Both authors wrote the manuscript, designed the experiments, and analyzed the data. NA also run the experiments and prepared the illustrations. All authors read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Consent for publication

Not applicable.

Ethics approval and consent to participate

Not applicable.

About this supplement

This article has been published as part of BMC Genomics Volume 18 Supplement 4, 2017: Selected articles from the Fifth IEEE International Conference on Computational Advances in Bio and Medical Sciences (ICCABS 2015): Genomics. The full contents of the supplement are available online at https://bmcgenomics.biomedcentral.com/articles/supplements/volume-18-supplement-4.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.

Authors’ Affiliations

(1)
Computational Biology Institute at the George Washington University, Ashburn, USA

References

  1. Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005; 21(16):3340–346. doi:10.1093/bioinformatics/bti535.View ArticlePubMedGoogle Scholar
  2. Lin Y, Moret BME. Estimating true evolutionary distances under the DCJ model. Bioinformatics. 2008; 24(13):114–22. doi:10.1093/bioinformatics/btn148.View ArticleGoogle Scholar
  3. Ohno S. Evolution by Gene Duplication. New York, NY: Springer; 1970.View ArticleGoogle Scholar
  4. Nadeau JH, Taylor BA. Lengths of Chromosomal Segments Conserved since Divergence of Man and Mouse. Proc Nat Acad Sci. 1984; 81(3):814–18. doi:10.1073/pnas.81.3.814.View ArticlePubMedPubMed CentralGoogle Scholar
  5. Pevzner PA, Tesler G. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc Nat Acad Sci. 2003; 100:7672–677. doi:10.1073/pnas.1330369100.View ArticlePubMedPubMed CentralGoogle Scholar
  6. Alekseyev MA, Pevzner PA. Comparative Genomics Reveals Birth and Death of Fragile Regions in Mammalian Evolution. Genome Biol. 2010; 11(11):117. doi:10.1186/gb-2010-11-11-r117.View ArticleGoogle Scholar
  7. Alekseyev MA. Multi-break rearrangements and breakpoint re-uses: from circular to linear genomes. J Comput Biol. 2008; 15(8):1117–131. doi:10.1089/cmb.2008.0080.View ArticlePubMedGoogle Scholar
  8. Ouangraoua A, Bergeron A. Combinatorial structure of genome rearrangements scenarios. J Comput Biol. 2010; 17(9):1129–144. doi:10.1089/cmb.2010.0126.View ArticlePubMedGoogle Scholar
  9. Tanner J. A derivation of the Borel distribution. Biometrika. 1961; 48(1/2):222–24.View ArticleGoogle Scholar
  10. Erdös P, Rényi A. On the evolution of random graphs. Publ Math Inst Hung Acad Sci. 1960; 5:17–61.Google Scholar
  11. Tannier E. Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods. In: Ciccarelli FD, Miklós I, editors. Proceedings of the 7th Annual Research in Computational Molecular Biology Satellite Workshop on Comparative Genomics (RECOMB-CG). Lecture Notes in Computer Science. Berlin Heidelberg: Springer: 2009. p. 1–12. doi:10.1007/978-3-642-04744-2_1.Google Scholar
  12. Jaillon O, Aury JM, Brunet F, Petit JL, Stange-Thomann N, Mauceli E, Bouneau L, Fischer C, Ozouf-Costaz C, Bernot A, et al.Genome duplication in the teleost fish tetraodon nigroviridis reveals the early vertebrate proto-karyotype. Nature. 2004; 431(7011):946–57. doi:10.1038/nature03025.View ArticlePubMedGoogle Scholar
  13. Jones FC, Grabherr MG, Chan YF, Russell P, Mauceli E, Johnson J, Swofford R, Pirun M, Zody MC, White S, et al.The genomic basis of adaptive evolution in threespine sticklebacks. Nature. 2012; 484(7392):55–61. doi:10.1038/nature10944.View ArticlePubMedPubMed CentralGoogle Scholar
  14. Alexeev N, Aidagulov R, Alekseyev MA. A computational method for the rate estimation of evolutionary transpositions. In: Ortuño F, Rojas I, editors. Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO). Lecture Notes in Computer Science. Switzerland: Springer: 2015. p. 471–80. doi:10.1007/978-3-319-16483-0_46.Google Scholar
  15. Berestycki N, Durrett R. A phase transition in the random transposition random walk. Probab Theory Relat Fields. 2006; 136(2):203–33. doi:10.1007/s00440-005-0479-7.View ArticleGoogle Scholar
  16. Spring-Pearson SM, Stone JK, Doyle A, Allender CJ, Okinaka RT, Mayo M, Broomall SM, Hill JM, Karavis MA, Hubbard KS, et al.Pangenome analysis of burkholderia pseudomallei: Genome evolution preserves gene order despite high recombination rates. PloS One. 2015; 10(10):0140274. doi:10.1371/journal.pone.0140274.View ArticleGoogle Scholar
  17. Attie O, Darling AE, Yancopoulos S. The rise and fall of breakpoint reuse depending on genome resolution. BMC Bioinformatics. 2011; 12(Suppl 9):1. doi:10.1186/1471-2105-12-S9-S1.View ArticleGoogle Scholar
  18. Alexeev N, Pologova A, Alekseyev MA. Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs. J Comput Biol. 2017; 24(2):93–105. doi:10.1089/cmb.2016.0190.View ArticlePubMedGoogle Scholar

Copyright

© The Author(s) 2017

Advertisement

BMC Genomics

ISSN: 1471-2164

Contact us