Dependence of paracentric inversion rate on tract length
- Thomas L York^{1}Email author,
- Rick Durrett^{2} and
- Rasmus Nielsen^{1, 3}
DOI: 10.1186/1471-2105-8-115
© York et al; licensee BioMed Central Ltd. 2007
Received: 18 January 2007
Accepted: 03 April 2007
Published: 03 April 2007
Abstract
Background
We develop a Bayesian method based on MCMC for estimating the relative rates of pericentric and paracentric inversions from marker data from two species. The method also allows estimation of the distribution of inversion tract lengths.
Results
We apply the method to data from Drosophila melanogaster and D. yakuba. We find that pericentric inversions occur at a much lower rate compared to paracentric inversions. The average paracentric inversion tract length is approx. 4.8 Mb with small inversions being more frequent than large inversions.
If the two breakpoints defining a paracentric inversion tract are uniformly and independently distributed over chromosome arms there will be more short tract-length inversions than long; we find an even greater preponderance of short tract lengths than this would predict. Thus there appears to be a correlation between the positions of breakpoints which favors shorter tract lengths.
Conclusion
The method developed in this paper provides the first statistical estimator for estimating the distribution of inversion tract lengths from marker data. Application of this method for a number of data sets may help elucidate the relationship between the length of an inversion and the chance that it will get accepted.
Background
Reconstructing the history of inversions and/or translocations separating two chromosomes or genomes is a classical problem in computational biology dating back as far as early work by the pioneers of genetic research from the 1930's (eg. [1]). In many applications, this problem has been treated as a problem of finding the minimum number of events required in the evolutionary history of the two genomes. The computational problem involved is known as sorting by reversal (e.g. [2–4]). An alternative approach is to estimate the number of events using statistical estimators that take into account that more inversions (and translocations) may have occurred than the minimum possible number. Larget et al. [5] and York et al. [6] have developed Bayesian methods based on Markov Chain Monte Carlo (MCMC) for estimating the history of inversions separating two chromosomes. The following description is based on the method of York et al. [6]. In brief, a Markov chain is established that has, as its stationary distribution, the posterior distribution of inversion paths (possible histories of inversions).
The likelihood function is calculated assuming inversions occur according to a Poisson process and assuming a uniform prior over all possible inversions paths of a fixed length. The inversion path is then represented explicitly in the computer memory and updates are proposed according to a proposal kernel, allowing exploration of the posterior distribution. The update kernel is guided by the parsimony distance computed from the breakpoint graphs developed for solving the sorting by reversal problem [4, 7]. Using the parsimony distance to guide updates greatly increases convergence rates of the Markov chain. Point estimates of the number of inversions, with associated measures of statistical confidence are then obtained from the posterior distribution. The method of [6] was extended in [8] to the case of multiple chromosomes differing by an unknown number of translocations and inversions. Similarly, [9] extends this type of approach to rearrangements due to transpositions and inverted transpositions in addition to inversions. The advantage of these Bayesian approaches is that they use all of the information in the marker data to obtain a statistical estimate of the number of inversions and translocations. However, so far these approaches have assumed that a long chromosomal segment is as likely to be inverted as a short one, and have lumped together pericentric and paracentric inversions rather than distinguishing between them. Pericentric inversions appear to be rarer than paracentric ones, and there is evidence for a length-dependent effect also [10, 11], with selection related to recombination in the inverted region of inversion heterozygotes as a possible cause. Another simplification made hitherto is that only the order of markers in a set (and their orientations, in the case of signed data) has been used, so no account is taken of the uneven spacing of the markers. The objective of this paper is to modify the previous methods to take into account these factors. This will allow us to estimate the relative frequency of pericentric and paracentric inversions and to estimate the distribution of inversion tract lengths. We apply the new method to genomic data from D. melanogaster and D. yakuba.
The assumption of tract-length independence is relaxed also in [12], which considers the problem of finding the optimal inversion path when the cost of an inversion depends on its tract-length; they do not address determining that dependence from data.
Results and Discussion
Results
1, -4, 3, -2, 5, -7, 6, -8, 9, -10, 11, 20, -13, 14, -18, 16, -17, -15, 19, 12, 21, -22, 23.
1, -2, 3, -10, -4, 11, -9, -13, -7, 5, 12, 8, 14.
1, -4, 6, -2, 5, -3, 7, 12, -8, -11, -13, -9, 10, -14, 15, -18, -16, -17, 19.
The inversion distance is 11 including one pericentric inversion. The centromere is in the middle of block 11. Thus, it takes at least 31 inversions, including at least one pericentric inversion, to turn the D. yakuba marker arrangement on chromosomes 2, 3 and X into the D. melanogaster arrangement.
Table
95% credible interval | MAP estimate | units | |
---|---|---|---|
L _{ pa } | [30,36] | 32 | |
λ _{ pa } | [0.028, 0.094] | 0.053 | Mb ^{-2} |
λ _{ pe } | [0, 0.0041] | 7.5 × 10^{-4} | Mb ^{-2} |
β | [0.044, 0.22] | 0.13 | Mb ^{-1} |
From figure 4 it is clear that the number of inversions is compatible with the parsimony estimate of 31 inversions. However, the most likely number of inversions is 33. The credible interval (Table 1) excludes more than 37 inversions at the 95% level. The 95% credible interval for the rate parameter λ_{ pa }is [0.028, 0.094] Mb^{-2}.
A minimum of one pericentric inversion (on chromosome 2) is needed to rearrange the markers, and the posterior probability of > 1 pericentric inversions is < 1 × 10^{-4}. The pericentric rate parameter, λ_{ pe }, is correspondingly small, with a MAP estimate of 7.5 × 10^{-4} Mb^{-2}.
The MAP estimate of the tract length dependence parameter (β) is 0.130 Mb^{-1} with a 95% credible interval of [0.044, 0.22] Mb^{-1} (Table 1 and Figure 6). Using (6), and the chromosome arm lengths (20.7, 22.3, 21.2, 24.2 and 28.7 Mb), we find that β_{ MAP }= 0.130 Mb^{-1} corresponds to a mean tract length of 4.8 Mb, compared with 8.1 Mb assuming β = 0.
The fact that β is positive, and that values of β close to zero receive very little support shows that small tract lengths are favored over large tract lengths.
Discussion
One drawback of the current method is that, as is the case for many other MCMC methods, it is computationally slow. Nonetheless, the speed of the program is not so slow that it is prohibitive, as illustrated in the analysis of the Drosophila data. The existing program should be able to handle somewhat larger data sets (up to perhaps 100 blocks and 800 markers) by some combination of running longer, running replicate chains on separate processors, and, in some cases breaking a multi-chromosome data set down into individual chromosomes or arms and analyzing each one separately. To go beyond that would require substantial work to improve the algorithm. A related issue is the resolution at which we can analyze genome rearrangements. In addition to the increased computational burden of analyzing more and shorter blocks, the assumption implicit in our method that the observed rearrangement is due solely to inversions (and translocations) becomes more problematic for smaller scale rearrangements. The method is, therefore, more suitable for making statements regarding inversions occurring at the scale of hundreds of kilobases or megabases than at the scale of a few kilobases. Nonetheless, with several blocks less than 200 kilobases long in our data, and 5 chromosome arms totaling 117 megabases, we are apparently sensitive to inversion tract-lengths down to about 1% of the chromosome arm length.
Conclusion
The method developed in this paper provides the first statistical estimator for estimating the distribution of inversion tract lengths from marker data. Application of this method to a number of data sets may help elucidate the relationship between the length of an inversion and the chance that it will get accepted.
Methods
The model
Using marker order information only
The prior p(λ) is taken to be uniform between 0 and λ_{ max }, and zero elsewhere. The data in this case are the marker orders D_{1} and D_{2} observed in two taxa. A path X starting at D_{1} either ends up at D_{2}, in which case P(D|X) = 1, or it ends up at some order other than D_{2}, in which case P(D|X) = 0.
We construct an initial path by starting with D_{1}, and performing inversions and translocations until D_{2} is obtained. Using the Hannenhalli-Pevzner breakpoint graph theory of sorting by reversal (i.e. by inversions) [4, 7], which has been used in all the MCMC sampling approaches to the inversion problem [5, 6, 9, 8], we preferentially choose rearrangements that lead to short paths. Proposed updates are constructed by choosing two points along the existing path and constructing a path between them in the same way, thus guaranteeing P(D|X) = 1.
Starting from a particular marker order there are N_{ I }distinct inversions, each occurring with rate λ, i.e., the probability of a particular inversion occurring in a short time t is λt where time is scaled such that the whole rearrangement process takes unit time.
In order to handle multiple chromosomes and translocations [8], we require distinct parameters λ_{ I }and λ_{ T }for the rates of inversions and translocations respectively. For each arrangement of markers there will be some number of inversions N_{ I }and some number of translocations N_{ T }; both of these depend on how many markers are on the various chromosomes, and therefore can change along a path. For this reason we now uniformize the process by defining a total event rate Λ(λ_{ I }, λ_{ T }) which is guaranteed to be at least as great as the sum of the total inversion and total translocation rates,
where the product is over the dummy events on the path, indexed by k. Note that the path X here is a sequence of inversions, translocations and dummies.
Using distance information
Often, in addition to knowing the order of markers, we have some form of distance information, such as recombination distance or number of nucleotides between markers. We use this information by generating proposed paths which start from one of the genomes (call it genome 1) specified in the data, with not only the marker order being as specified, but also the distances. The distance information for genome 2 is ignored. A path is then constructed which has distance information at every step, but only the marker order at the end of the path is required to agree with genome 2. If distance information is available for both genomes, we can choose to use the distance information from either genome but not from both. We would like to be able to use the distance information from both genomes, where available, but we don't know how to construct a path which ends not only with a specified marker order, but also with (or close to) a specified set of inter-marker distances. This is particularly difficult because in reality the sum of these distances is not conserved.
which differs from (3) in that it is a density and because the dummy event rates, ${\lambda}_{{d}_{k}}$, now depend on the continuous breakpoint positions.
An earlier version of our software, implementing this method of using distance information, but ignoring tract-lengths, was used in a comparative analysis of Arabidopsis thaliana, Arabidopsis lyrata and Capsella [13].
Inversion tract lengths
We will analyze unsigned data, i.e., we use the positions of the markers but not the orientations of individual markers. In this case inversions containing one marker are undetectable. However, since finding the shortest inversion path is hard for the unsigned case, we study the unsigned problem by working with signed arrangements of markers, and sampling from the set of all (signed) paths consistent with the unsigned data, as described in [6]. This means our paths may include one or more 1-marker inversions.
Paracentric and pericentric inversions
where here ℓ_{2j - 1}and ℓ_{2j}are the lengths of the two arms of chromosome j.
where now Λ(λ_{ pa }, λ_{ pe }, λ_{ T }) > Λ_{ real }= Λ_{ pa }+ Λ_{ pe }+ Λ_{ T }, and λ_{ d }= Λ - Λ_{ real }as before, and τ_{ l }is the tract length of the l^{ th }paracentric inversion.
The λ's priors are all uniform between 0 and λ_{ max }and zero elsewhere. We assume β ≥ 0 with a uniform prior. We assume that chromosomes always have exactly one centromere. In the computer code the breakpoint graph only considers marker-marker adjacencies, not marker-centromere adjacencies, and this means the way proposed rearrangement paths are constructed does not guarantee that centromeres end up in the right place. The centromeres are just passively carried along by the inversions and rearrangements dictated by the breakpoint graph. If the centromeres do not end up in the right place, the proposed path is rejected in the MCMC updating step, leading to loss of efficiency, but not loss of correctness. If the centromere lies within a region of conserved marker order its probability of ending up in the right place will typically be high, but if it lies between conserved regions this probability may be quite low, contributing to a low MCMC acceptance probability.
Data processing
We chose D. yakuba to compare with D. melanogaster. This choice was dictated by the need to have sufficiently many inversions that the biological problem is interesting, but not so many inversions that computational complexity becomes too large. We started with chained and netted alignments as described in [14]. We used the "net" file droYak2.dm2.net.gz, downloaded from the UC Santa Cruz website. This file contains information on chained alignments ('chains"), organized into hierarchies called "nets". These alignments are based on the Nov. 2005 WUSTL version 2.0 D. yakuba assembly and the Apr. 2004, BDGP v. 4/DHGP v. 3.2 D. melanogaster assembly.
Remaining markers are further processed by defining blocks within which adjacency is conserved. Two markers which are adjacent in both species are in the same block; if adjacent in just one species they are in different blocks. Blocks containing only a single marker are discarded, and blocks shorter than a minimum length are replaced by a single marker at the block's average position. This procedure is then repeated and the number of blocks may decrease, both directly because of discarding one-marker blocks, and also because when a block is discarded, or when a block is shortened to one marker, neighboring blocks will often join into one block. This procedure is repeated several times while the minimum block length is gradually increased from 100 bases to some final value L_{ min }. Thus, a long block can emerge from a set of short blocks as some are eliminated and others join together. In some cases a block which ideally would be retained and incorporated into a long block may be lost during this process, if it is shorter than L_{ min }and doesn't join another block soon enough. This can cause gaps in the spacing of markers on the resulting long block or the shortening of the block at an end. Neither of these is a big problem, although shortening at the ends of blocks means breakpoints are less well localized. The set of blocks generated is insensitive to L_{ min }over a broad range: for our data, any value of L_{ mim }between 25 kilobases and 115 kilobases gives the set of blocks that we analyzed.
Finally, markers are thinned from blocks containing many markers, until no block has more than 8 markers. Markers at the ends of blocks are kept, and the thinning of the others is done so as get a fairly even spacing. This reduces the time and memory requirements of the program, while having little effect on posterior distributions, according to our studies.
Applied to chromosomes X, 2, and 3, this procedure gives the 388 markers in 56 blocks shown in figures 1, 2, and 3.
Declarations
Acknowledgements
This work was supported by joint NSF/NIGMS grant DMS-02-01037.
Authors’ Affiliations
References
- Sturtevant AH, Dobzhansky T: Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. Proceedings of the National Academy of Sciences USA. 1936, 22: 448-450. 10.1073/pnas.22.7.448.View ArticleGoogle Scholar
- Watterson GA, Ewens WJ, Hall TE, Morgan A: The chromosome inversion problem. Journal of Theoretical Biology. 1982, 99: 1-7. 10.1016/0022-5193(82)90384-8.View ArticleGoogle Scholar
- Kececioglu J, Sankoff D: Exact and approximation algorithms for the inversion distance between two permutations. Algortihmica. 1995, 13: 180-210. 10.1007/BF01188586.View ArticleGoogle Scholar
- Hannenhalli S, Pevzner PA: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proceedings of the 27th Annual ACM Symposium on the Theory of Computing. 1995, 1-27.Google Scholar
- Larget B, Simon DL, Kadane JB: Bayesian phylogenetic inference from animal mitochondrial genome arrangements (with discussion). J R Stat Soc Ser B. 2002, 64: 681-693. 10.1111/1467-9868.00356.View ArticleGoogle Scholar
- York TL, Durrett R, Nielsen R: Bayesian Estimation of the Number of Inversions in the History of Two Chromosomes. Journal of Computational Biology. 2002, 9 (6): 805-818. 10.1089/10665270260518281.View ArticlePubMedGoogle Scholar
- Bafna V, Pevzner PA: Genome rearrangements and sorting by reversals. SIAM Journal of Computing. 1996, 25: 272-289. 10.1137/S0097539793250627.View ArticleGoogle Scholar
- Durrett R, Nielsen R, York TL: Bayesian Estimation of Genomic Distance. Genetics. 2004, 166: 621-629. 10.1534/genetics.166.1.621.PubMed CentralView ArticlePubMedGoogle Scholar
- Miklos I: MCMC genome rearrangement. Bioinformatics. 2003, 19 (Suppl 2): 130-137.View ArticleGoogle Scholar
- Caceres M, Barbadilla A, Ruiz A: Inversion Length and Breakpoint Distribution in the Drosophila buzzatii Species Complex: Is Inversion Length a Selected Trait?. Evolution. 1997, 51 (4): 1149-1155. 10.2307/2411044.View ArticleGoogle Scholar
- Brehm A, Krimbas C: Inversion polymorphism in Drosophila obscura. Journal of Heredity. 1991, 82 (2): 110-117.PubMedGoogle Scholar
- Pinter R, Skiena S: Sorting with length-weighted reversals. Proceedings of the 13th international conference on genome informatics. 2002, 103-111.Google Scholar
- Yogeeswaran K, Frary A, York TL, Amenta A, Lesser AH, Nasrallah JB, Tanksley SD, Nasrallah ME: Comparative genome analyses of Arabidopsis spp.: inferring chromosomal rearrangement events in the evolutionary history of A. thaliana. Genome Res. 2005, 15 (4): 505-515. 10.1101/gr.3436305.PubMed CentralView ArticlePubMedGoogle Scholar
- Kent WJ, Baertsch R, Hinrichs A, Miller W, Haussler D: Evolution's cauldron: duplication, deletion, and rearrangement in the mouse and human genomes. Proc Natl Acad Sci USA. 2003, 100 (20): 11484-11489. 10.1073/pnas.1932072100.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.