Abstract
The human and mouse genomic sequences provide evidence for a larger number of rearrangements than previously thought and reveal extensive reuse of breakpoints from the same short fragile regions. Breakpoint clustering in regions implicated in cancer and infertility have been reported in previous studies; we report here on breakpoint clustering in chromosome evolution. This clustering reveals limitations of the widely accepted random breakage theory that has remained unchallenged since the mid-1980s. The genome rearrangement analysis of the human and mouse genomes implies the existence of a large number of very short “hidden” synteny blocks that were invisible in the comparative mapping data and ignored in the random breakage model. These blocks are defined by closely located breakpoints and are often hard to detect. Our results suggest a model of chromosome evolution that postulates that mammalian genomes are mosaics of fragile regions with high propensity for rearrangements and solid regions with low propensity for rearrangements.
In a landmark paper, Nadeau and Taylor (1) introduced the notion of conserved segments (i.e., segments with preserved gene orders without disruption by rearrangements) and estimated that there are ≈180 conserved segments in human and mouse. In the same paper they provided convincing arguments in favor of the random breakage model of genomic evolution postulated by Ohno (2). The model assumes a random (i.e., uniform and independent) distribution of chromosome rearrangement breakpoints and is supported by the observation that the lengths of synteny blocks shared by human and mouse are well fitted by the predicted distribution imposed by the random breakage model. Since the model was first introduced, it has been analyzed by Nadeau and others (1, 3–6), and it has become widely accepted. It was further supported by studies of significantly larger datasets that confirmed that newly discovered synteny blocks still fit the predicted exponential distribution very well (7–11). These studies, with progressively increasing levels of resolution, made the random breakage model the de facto theory of chromosome evolution.
The arguments in favor of the random breakage model usually proceed as follows. One first constructs the distribution of lengths of conserved segments and fits the resulting histogram with the theoretical distribution predicted by the random breakage model. An important implication of this model is that the segment lengths approximate an exponential distribution with density function f(x) = 1/L e-x/L, where L is the average length of all segments. Nadeau and Taylor (1) did not have information about all segments because most of them were still undiscovered in 1984. However, they were able to estimate L (and therefore the number of still undiscovered segments) from the small set of already discovered segments. The relatively small departure from an exponential distribution was attributed to missing information about some conserved segments. Of course, there was always a danger that newly discovered segments would shift this estimate and even deviate from the exponential distribution predicted by the model. However, this did not happen in the past, and the random breakage model was reinforced in a number of influential studies in the last decade (7, 9, 12, 13). Sankoff et al. (14, 15) analyzed the accuracy of the random breakage model and further reinforced it despite some deviations, particularly for relatively short conserved segments. These deviations are often attributed to mapping errors, statistical noise, or other evolutionary processes like frequent short inversions (16). As a result, the Nadeau–Taylor predictions are viewed as among the most significant results in “... the history and development of the mouse as a research tool” (17).
The Nadeau and Taylor (1) result laid the foundation of the statistical approach to studies of chromosomal history that was further advanced by Nadeau and Sankoff (3, 4) and others. The statistical approach is not concerned with the details of rearrangement history. Sankoff and colleagues (18, 19) pioneered a combinatorial approach to studies of genome rearrangements that attempts to infer the rearrangement scenario explaining the differences between genomic organizations. They also raised the problem of integrating the statistical and combinatorial approaches, something that never was done in the past (20). In this article, we demonstrate that such combined analysis reveals limitations of the random breakage model and leads to a fragile breakage model.
The draft human and mouse sequences reveal many previously undiscovered synteny blocks and put the random breakage model to a new test. We (21) identified 281 synteny blocks shared by human and mouse of size at least 1 Mb (Tables 1 and 2, which are published as supporting information on the PNAS web site, www.pnas.org). Although the number of synteny blocks is higher than the Nadeau–Taylor predictions, the lengths of the blocks still fit the exponential distribution (Fig. 1 Left), another argument in favor of the random breakage model. However, a different type of evidence derived from genome rearrangements studies reveals an unexpectedly large number of closely located breakpoints that cannot be explained by the random breakage model. This analysis implies that in addition to the segments shown in Fig. 1 Left, another 190 “short” synteny blocks, typically <1 Mb in length, exist. These blocks were never discovered in the comparative mapping studies, and moreover, most of them are hard to find even with available human and mouse sequences. If the breakpoints are located very close to each other (e.g., within a few nucleotides or even at the same position), the corresponding very short blocks may be undetectable by alignment analysis. Moreover, some short blocks may be deleted in the course of evolution. However, the rearrangement analysis confirms the existence of such breakpoints, even in the absence of statistically significant sequence alignments. The existence of these short blocks immediately implies that an exponential distribution is not a good fit to reality, thus pointing to limitations of the random breakage model (Fig. 1 Center). In other words, the rearrangement analysis of human and mouse genomes reveals clumps of closely located breakpoints that cannot be explained by the random breakage model.
The surprisingly large number of breakpoint clumps is an argument in favor of a different model of chromosome evolution that we call the fragile breakage model. This model postulates that the breakpoints occur mainly within relatively short fragile regions (hot spots of rearrangements). The existence of some fragile regions at the population level was supported by previous studies of cancer and infertility (22, 23), but the extent of this phenomenon in molecular evolution became clear only after the human and mouse DNA sequences became available. Although many clinical rearrangement breakpoints form clusters (24, 25), there were no previous reports of evolutionary breakpoint clustering, and the relationships between the cytogenetic processes and evolution remain unclear. Moreover, previous evolutionary studies implicitly (and wrongly) assumed that there exists a single rearrangement site between any two consecutive conserved segments shared by human and mouse, and therefore overlooked potential breakpoint clustering. Our understanding of fragility is still incomplete; in particular, there are reports of correlations between some common fragile sites and evolutionary breakpoints (26) and lack of correlation for other ones (27). A recent study (28) of some breakpoints on chromosome 19 and corresponding repeats suggested that clinical and evolutionary rearrangements may be driven by similar forces. Our study opens the possibility of correlating the detailed cancer breakpoint maps recently generated by Volik et al. (29) with breakpoint reuse affecting evolutionary fragile sites, despite the vastly different time scales.
If one assumes that the fragile regions are uniformly distributed through the genome then the fragile and random breakage models lead to identical estimates for the number of long segments (e.g., segments >1–2 Mb). In some sense, the random breakage model can be viewed as an excellent null hypothesis for a certain level of resolution and genome heterogeneities. However, the random breakage and fragile breakage models generate very different predictions when it comes to short segments that were below the granularity level of comparative mapping studies.
Synteny Blocks
The genomic sequences provide evidence that the human and mouse genomes are significantly more rearranged than previously thought. A large proportion of previously identified conserved segments turned out not to be really conserved, because there is evidence of multiple microrearrangements in many of them (10). These microrearrangements were not visible in the comparative genetic maps that were used for defining ≈180 conserved segments in the past. The draft human and mouse genomic sequences reveal a few thousand conserved segments; many of them may be caused by microrearrangements whereas others may be artifacts of assembly errors. We therefore developed the GRIMM-Synteny algorithm (21) to detect synteny blocks, i.e., fragments that can be converted into conserved segments by microrearrangements. The blocks generated by GRIMM-Synteny are similar to the blocks generated in ref. 30 and are based on the same versions of the draft human and mouse genomic sequences. GRIMM-Synteny detected Nb = 281 synteny blocks shared by human and mouse of size at least 1 Mb in human, and Nb - Nc = 281 - 23 = 258 breakpoint regions, i.e., regions between consecutive synteny blocks, where Nc is the number of chromosomes. Many of these synteny blocks were previously viewed as “conserved segments” by Nadeau and Taylor (1), because microrearrangements within these blocks were beyond the resolution of comparative human–mouse maps. Because of insufficient sequencing data, we ignore the breakpoint regions at the ends of the chromosomes. Our estimates need to be revisited when more sequencing data from chromosome ends become available. We do not exclude the possibility that chromosome ends may host multiple rearrangement hot spots.
Errors in draft human and mouse genomic sequences raise the question of whether imperfections of the sequence assemblies affect our estimate of breakpoint reuse. Although the draft genomic sequences indeed contain many errors, these errors are local rather than global. For example, the draft human sequence may include some misassembled bacterial artificial chromosomes, resulting in the appearance of microrearrangements with spans <200 kb. Such local errors typically result in microrearrangements that are sequencing artifacts rather than real evolutionary events. We identified 3,170 microrearrangements between draft human and mouse sequences and it is expected that only a portion of them correspond to real evolutionary rearrangements whereas the rest are caused by assembly errors (21). However, there is little doubt that large synteny blocks (e.g., blocks >1 Mb) are placed correctly because their arrangement is consistent with existing genetic and physical maps (30). Our breakpoint analysis is based only on the arrangement of such large synteny blocks and therefore the existing local assembly errors do not affect our conclusions.
These large synteny blocks were rigorously derived from the same 558,678 small-scale orthologous landmarks as in ref. 30 and are largely consistent with other recent studies of human–mouse synteny blocks (21). See ref. 30 for discussion of the quality of these 558,678 small-scale orthologous landmarks. We emphasize that even if smaller synteny blocks (e.g., <1 Mb in length) and breakpoint regions are corrupted because of assembly errors, it does not affect our conclusions; information about short synteny blocks is not used in establishing the breakpoint reuse phenomenon.
We emphasize that in contrast to previous approaches to analyzing gene orders, our approach takes into account similarities in both coding and noncoding sequences. This allows us to bypass the problem of unreliable gene annotations and take into account overwhelming evidence that similarities are well preserved in noncoding regions as well. Although most synteny blocks contain a large number of annotated genes (see Tables 1 and 2), some blocks contain very few genes and would be hard to find with the traditional gene order approaches. In particular, there is a synteny block with just one annotated human gene, and another with just one annotated mouse gene. We emphasize that these findings refer to annotated genes and more accurate gene predictions may prove that these synteny blocks contain more genes. We also found a number of genes residing within breakpoint regions and even some genes spanning entire breakpoint regions. Such “spanning genes” are likely examples of the genes that were disrupted by rearrangements in the course of evolution. Gene disruption in clinical rearrangements was discovered in the past; for example, the Abelson gene on chromosome 9 and the BCR gene on chromosome 22 are both disrupted and fused together in many leukemia patients (31). Our finding indicates that similar gene disruption effects happen in the course of evolution, contrary to the existing point of view that evolutionary genome rearrangements are neutral speciation events.
Fig. 1 Left presents a histogram of the lengths of these 281 synteny blocks (in human) fitted by an exponential distribution. However, the empirical distribution in Fig. 1 Left does not include the lengths of short synteny blocks (i.e., blocks <1 Mb), which are hard to detect even with available human and mouse sequences. Nadeau and Taylor (1) bypassed this problem by declaring such short blocks as still undiscovered and even estimated the number of such blocks via the predicted curve (4). Our key insight is that although most of these blocks are still undiscovered, the number of such blocks can be reliably estimated with genome rearrangement analysis. Each such short block creates an impression of breakpoint reuse because the breakpoints flanking short synteny blocks are hard to separate. The genome rearrangement analysis implies that there is a very large number Nr (Nr is at least 190) of such breakpoint reuses (and, therefore, short synteny blocks), thus adding an extra bar to the empirical distribution of block length (Fig. 1 Center).
This new distribution cannot be fitted with the exponential one, thus providing a solid argument against the random breakage model. Most breakpoint regions are short (<1 Mb) with very few exceptions like a 23.2-Mb breakpoint region in human and a 6.7-Mb breakpoint region in mouse (the distribution of breakpoint region lengths in human is shown in Fig. 1 Right). However, the average size of breakpoint regions is only 668 kb in human and 458 kb in mouse, and each of them contains on average 1.9 breakpoints (rather than a single breakpoint as was implicitly assumed in the previous studies). The overall size of the breakpoint regions equals 172.5 Mb in human (5.7% of the genome length) and 119 Mb in mouse (4.7% of the genome length). Intuitively, the random breakage model contradicts the fact that 5.7% of the genome is populated by such a large number of closely located breakpoints (1.9 breakpoints per breakpoint region on average if the chromosome ends are excluded). The 190 breakpoint reuses revealed by rearrangement analysis and the 258 breakpoint regions revealed by GRIMM-Synteny imply an estimate of n = Nb - Nc + Nr = 281 - 23 + 190 = 448 for the overall number of breakpoints.† We assume that these breakpoints are located in breakpoint regions and we ignore chromosome ends (see above). One can estimate the expected number of clumps [e.g., pairs of consecutive points that are within a “small” distance w from each other) in the positions of n uniformly distributed points in the interval‡ [0,1] as (n - 1)(1 - (1 - w)n] (34). If we are interested in the number of clumps of n breakpoints within a distance of 0.668 Mb (average size of breakpoint regions in human) in the genome of total length§ G = 2,983 Mb, then w = 0.668/2,983, and the number of clumps is ≈43. This is in sharp contrast with the estimate of Nr = 190 breakpoint reuses, a strong argument against the random breakage model.¶
We emphasize that this insight has only become possible with human and mouse genomic sequences available. It turned out that most breakpoint regions are rather short, thus implying that still undiscovered synteny blocks (residing within breakpoint regions) are short and making it impossible to fit the empirical distribution by the exponential one.
Genome Rearrangements and Breakpoint Reuse
The evidence for existence of 190 closely located breakpoints is provided by genome rearrangement analysis. Every genome rearrangement study involves solving a combinatorial puzzle to find a series of genome rearrangements to transform one genome into another. For multichromosomal genomes, the most common rearrangements are inversions (also known as reversals), translocations, fusions, and fissions, and the number of such rearrangements in a most parsimonious scenario is known as the genomic distance. Following Nadeau and Taylor (1), we assume that transpositions are rare and therefore can be ignored. Finding the genomic distance is a difficult combinatorial problem. In the very first computational studies of genome rearrangements, Watterson et al. (35) and Nadeau and Taylor (1) introduced the notion of a breakpoint (disruption of gene order) and noticed some correlations between the genomic distance and the number of breakpoints. The shortcoming of early genome rearrangement studies is that they considered breakpoints independently without revealing combinatorial dependencies between related breakpoints. The simplest example of related breakpoints are two breakpoints formed by a single inversion or translocation. Hannenhalli and Pevzner (36, 37) and Tesler (38) developed a polynomial-time algorithm for the genomic distance problem. We used a fast implementation of the Hannenhalli–Pevzner algorithm (39) to analyze the human–mouse rearrangement scenario (available via the GRIMM web server at www-cse.ucsd.edu/groups/bioinformatics/GRIMM). Our analysis implies that at least 245 rearrangements of 281 synteny blocks occurred because the divergence of human and mouse. This result, combined with formulas to compute the number of breakpoint reuses, implies that any human–mouse rearrangement scenario requires at least 190 breakpoint reuses.
Fig. 2 presents two different most parsimonious scenarios that transform the order of the 11 synteny blocks on the mouse X chromosome into the order on the human X chromosome. Although the scenarios are very different, they both have three breakpoint region reuses.
Our extension of the Hannenhalli–Pevzner theory implies that any rearrangement scenario based on these 11 blocks has at least three reuses of breakpoint regions (although we cannot unambiguously infer where these breakpoint reuses happened). This indicates that there are at least three more “hidden” synteny blocks in addition to our 11 “large” synteny blocks. Some of these blocks may be detected by lowering the threshold for synteny block detection, whereas others may escape such detection. Our analysis further reveals at least 190 breakpoint region reuses over the whole genome on the evolutionary path from mouse to human.
Identifying the exact position of hidden blocks is a difficult problem. If the consecutive breakpoints are very close (e.g., within tens of nucleotides of each other) then the resulting very short hidden synteny blocks will escape detection because the similarity between them is insignificant at the genome scale. In addition, even longer hidden blocks (e.g., tens of thousands of nucleotides) may escape detection because these blocks may not host genes and therefore the similarity between them may be quickly dissolved by frequent mutation in noncoding regions. Despite these difficulties we were able to point to some potential hidden blocks. The black dot flanked by double yellow lines in Fig. 2 Right shows the position of such a potential hidden block on the human X chromosome. Backtracking the position of this block to mouse implies that it resides between blocks 11 and 3 on the mouse X chromosome. There is indeed an area of significant similarity (≈350 bp) between the breakpoint regions in human and mouse indicated by black dots in Fig. 2 Right. We emphasize that it is not a repeat-induced similarity but rather a significant alignment hit that does not extend to any other regions.
Two similar segments in the breakpoint regions of mouse and human form a potential hidden block if one of them can be backtracked into the other within some most parsimonious evolutionary scenario on the existing blocks, but these do not merely lengthen an existing block. For technical details, see the definition of (g, b)-splits in ref. 37.
We have developed an algorithm to find all such potential hidden blocks, given our list of 281 synteny blocks and a separate list of candidate regions. It identified 111 potential hidden blocks between breakpoint regions in human and mouse (see Appendix, which is published as supporting information on the PNAS web site). Moreover, we found 81 orthologous gene pairs in the breakpoint regions satisfying the potential hidden block requirements. We emphasize that most orthologous gene pairs falling into breakpoint regions are not potential hidden blocks because there is no rearrangement scenario in which they satisfy the combinatorial constraints imposed by the backtracking procedure illustrated in Fig. 2 Right. However, the question of which of these 81 orthologous genes correspond to real hidden synteny blocks remains open because the backtracking procedure assumes that the evolutionary scenario is known. Although this is not the case yet, sequencing other mammalian species will reveal the likely rearrangement scenario and will point us to real hidden synteny blocks.
Because every rearrangement creates at most two new breakpoints, the genomic distance is at most half the number of the breakpoints in the genome. If there is no breakpoint reuse then the real evolutionary scenario is a most parsimonious one as computed by the Hannenhalli–Pevzner algorithm (36). However, the estimate of genomic distance in terms of breakpoints is inaccurate because it assumes that the breakpoints are not reused in evolution. In most genome rearrangement studies, there is evidence of breakpoint reuse (at least at a certain level of synteny block resolution), thus indicating that breakpoint reuse is the rule rather than the exception. We emphasize that by reusing breakpoints we do not mean multiple use of exactly the same genomic position as an endpoint of rearrangements, but rather the fact that the breakpoint regions host endpoints for multiple rearrangement events. Therefore our estimate of 190 breakpoint reuse events in human–mouse evolution does not imply that there were 190 reuses of exactly the same nucleotides as rearrangement endpoints.
Fragile Breakage Model Versus Random Breakage Model
Below we describe our tests of the random breakage model and introduce the alternative fragile breakage model. If positions of n breakpoints in the genome are given by random variables ui in [0, 1], the segment sizes are yi = ui - ui - 1. For the following analysis, n = Nb - 1 = 280, because we ignore the chromosome endpoints (see above) and, similarly to Nadeau and Taylor (1), do not consider short blocks (<1 Mb). We also discard any other genomic material not observed to be within the synteny blocks. To test the random breakage model, we follow the approach described in Churchill et al. (40) and use the Kolmogorov– Smirnov test, which measures the largest difference between the empirical and theoretical distribution functions:
The computed Kolmogorov–Smirnov statistic is D280 = 0.085, which comes close to the estimate of 0.095 computed by Sankoff et al. (14) based on comparative mapping data for 1,423 genes and only 130 blocks. The probability (P value) that the Kolmogorov–Smirnov statistic D280 is >0.085 for the uniform distribution is 0.032. We also found that there is a reasonably good fit between the largest synteny block of length 79.6 Mb and the expected maximum fragment length L[γ + ln(n + 1)] = 59.8 Mb, where L is the mean fragment length and γ = 0.5772 is Euler's constant.
Ideally, these inferences should be based on complete data about segment lengths. However, the information about short segments may be hard to obtain even with available draft human and mouse sequences. Churchill et al. (40) model the missing data by assuming that if two breakpoint sites are within locking distance a then the conserved segment remains undetected. However, even this more flexible model is unable to explain the very large number Nr = 190 of short unobserved segments that are revealed by our genome rearrangement studies.
In summary, the tests of the random breakage model reveal its inability to explain a large number of short synteny blocks found by genome rearrangement analysis. At the same time, the truncated exponential density function 1/L ex-a/L fits the experimental data for synteny blocks longer than a = 1 Mb well. The question therefore arises as to whether there exists a different model of chromosomal rearrangements that (i) explains the fit between the distribution of long synteny blocks and the truncated exponential density function observed by Nadeau and Taylor (1), and (ii) explains a large number of short blocks that the Nadeau–Taylor statistics failed to explain. Below we describe a natural fragile breakage model that explains both good fit of long blocks and a large number of short blocks.
In the fragile breakage model, the genome consists of (short) fragile and (long) solid regions with different propensities to breakpoints. For expository purposes we assume that the probability of a breakpoint in a fragile region follows the Poisson process, while the probability of a breakpoint in a solid region is zero (extreme case). The overall size of fragile regions may be very small, e.g., 5% of the genome, in sharp contrast to the random breakage model. However, if fragile regions are distributed randomly in the genome, both the random breakage and the fragile breakage models predict the same distribution of long synteny blocks. This may be the reason for the prophetic predictive power of the random breakage model in the past. However, the random breakage model does not perform well in a test with the sequencing data that has recently became available, whereas the fragile breakage model easily explains the large number of short blocks, thus reinforcing our belief that the fragile breakage model may be a better approximation of reality than the random breakage model. In addition, the fragile breakage model allows one to estimate the number of still unobserved fragile regions that may be revealed by sequencing efforts in other mammalian species. Assume there are m fragile regions in the genome and n = Nb - Nc + Nr = 448 random breakages, of which Nb - Nc = 258 are observed. The probability that a given fragile region is not affected by any breakage is (1 - 1/m)n. Therefore, the expected number of observed fragile regions (i.e., fragile regions that are broken by breakages) is m[1 - (1 - 1/m)n]. Solving m[1 - (1 - 1/m)448] = 258 gives m ≈364. The estimate for the number of still undiscovered fragile regions is m -(Nb - Nc) ≈106, most of which probably reside within existing synteny blocks. This high estimate of the number of still undiscovered fragile regions may explain the recently observed phenomenon that the highly recombinogenic FRA3B locus was never disrupted in the course of mouse–human evolution (27).
Conclusion
The visionary insights of Nadeau and Taylor (1) and prophetic accuracy of their estimates survived many comparative mapping studies and (at a certain level of granularity) still remain in good fit with available human and mouse genomic sequences. The random breakage model proved to be an extremely valuable evolutionary theory, particularly when contrasted against random gene scrambling and other models that were considered in the early 1980s. However, the available human and mouse genomic sequences dramatically increased the level of resolution at which we can analyze the genomes and reveal that, with a new level of granularity, the random breakage model is unable to explain the very large number of breakpoint clumps. Therefore, a new more accurate model is needed for comparative studies of the many mammalian genomes that are about to be sequenced.
We remark that our conclusions about breakpoint reuse are based on the assumption (made in ref. 1) that transpositions are relatively rare. Although inversions and translocations are believed to be more common than transpositions, we do not entirely rule out the possibility that a significant fraction of breakpoint reuses is caused by transpositions (because every transposition can be modeled by three inversions that reuse three breakpoints).
Supplementary Material
Acknowledgments
We are grateful to Richard Durbin, Michael Kamal, Uri Keich, Eric Lander, and David Sankoff for helpful discussions and suggestions.
This paper was submitted directly (Track II) to the PNAS office.
Footnotes
A more accurate estimate for the number of breakpoints would involve the number of chromosomes in the common ancestor of human and mouse, which remains unknown. See refs. 32 and 33 for the analysis of chromosomal organization in the mammalian ancestor.
Similarly to Nadeau and Taylor (1), we represent the genome as a single interval rather than a set of intervals corresponding to chromosomes. We also estimate the number of breakpoints in breakpoint regions as n = Nb - Nc + Nr although some of these breakpoints may fall at the ends of chromosomes and, in this case, should not be counted. In addition, the exact borders of the syntenic blocks are not well defined and may extend into the breakpoint regions. However, these simplifications only slightly affect our analysis.
G is the total length of the draft human sequence, comprised of the synteny blocks (2,707 Mb), breakpoint regions (172.5 Mb) and chromosome ends.
For expository purposes, this estimate uses the average breakpoint region length rather than the distribution of breakpoint region lengths. The estimate needs to be revisited in the (rather unlikely) case that the chromosome ends and a small number of long breakpoint regions account for almost all breakpoint reuse events.
References
- 1.Nadeau, J. H. & Taylor, B. A. (1984) Proc. Natl. Acad. Sci. USA 81, 814-818. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 2.Ohno, S. (1973) Nature 244, 259-262. [DOI] [PubMed] [Google Scholar]
- 3.Nadeau, J. H. & Sankoff, D. (1998) Trends Genet. 14, 495-501. [DOI] [PubMed] [Google Scholar]
- 4.Nadeau, J. H. & Sankoff, D. (1998) Mamm. Genome 9, 491-495. [DOI] [PubMed] [Google Scholar]
- 5.Schoen, D. J. (2000) Genetics 154, 943-952. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 6.Waddington, D., Springbett, A. J. & Burt, D. W. (2000) Genetics 154, 323-332. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 7.Copeland, N. G., Jenkins, N. A., Gilbert, D. J., Eppig, J. T., Maltais, L. J., Miller, J. C., Dietrich, W. F., Weaver, A., Lincoln, S. E., Steen, R. G., et al. (1993) Science 262, 57-66. [DOI] [PubMed] [Google Scholar]
- 8.DeBry, R. W. & Seldin, M. F. (1996) Genomics 33, 337-351. [DOI] [PubMed] [Google Scholar]
- 9.Lander, E. S., Linton, L. M., Birren, B., Nusbaum, C., Zody, M. C., Baldwin, J., Devon, K., Dewar, K., Doyle, M., FitzHugh, W., et al. (2001) Nature 409, 860-921. [DOI] [PubMed] [Google Scholar]
- 10.Mural, R. J., Adams, M. D., Myers, E. W., Smith, H. O., Miklos, G. L., Wides, R., Halpern, A., Li, P. W., Sutton, G. G., Nadeau, J., et al. (2002) Science 296, 1661-1671. [DOI] [PubMed] [Google Scholar]
- 11.O'Brien, S. J., Menotti-Raymond, M., Murphy, W. J., Nash, W. G., Wienberg, J., Stanyon, R., Copeland, N. G., Jenkins, N. A., Womack, J. E. & Marshall Graves, J. A. (1999) Science 286, 458–462, 479-481. [DOI] [PubMed] [Google Scholar]
- 12.Burt, D. W., Bruley, C., Dunn, I. C., Jones, C. T., Ramage, A., Law, A. S., Morrice, D. R., Paton, I. R., Smith, J., Windsor, D., et al. (1999) Nature 402, 411-413. [DOI] [PubMed] [Google Scholar]
- 13.Gregory, S. G., Sekhon, M., Schein, J., Zhao, S., Osoegawa, K., Scott, C. E., Evans, R. S., Burridge, P. W., Cox, T. V., Fox, C. A., et al. (2002) Nature 418, 743-750. [DOI] [PubMed] [Google Scholar]
- 14.Sankoff, D., Parent, M. N., Marchand, I. & Ferretti, V. (1997) in Eighth Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science (Springer, New York), Vol. 1264, pp. 262-274. [Google Scholar]
- 15.Sankoff, D., Parent, M. N. & Bryant, D. (2000) in Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, eds. Sankoff, D. & Nadeau, J. (Kluwer, Dordrecht, The Netherlands), pp. 299-305.
- 16.Seoighe, C., Federspiel, N., Jones, T., Hansen, N., Bivolarovic, V., Surzycki, R., Tamse, R., Komp, C., Huizar, L., Davis, R. W., et al. (2000) Proc. Natl. Acad. Sci. USA 97, 14433-14437. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Pennisi, E. (2000) Science 288, 248-257. [DOI] [PubMed] [Google Scholar]
- 18.Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B. & Cedergren, R. (1992) Proc. Natl. Acad. Sci. USA 89, 6575-6579. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 19.Sankoff, D. & Nadeau, J., eds. (2000) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families (Kluwer, Dordrecht, The Netherlands).
- 20.Sankoff, D. (1999) in Proceedings of From Jay L. Lush to Genomics: Visions for Animal Breeding and Genetics, eds. Dekkers, J. C. M., Lamont, S. J. & Rothschild, M. F. (CAB International, Oxon, U.K.), pp. 124-134.
- 21.Pevzner, P. A. & Tesler, G. (2003) Genome Res. 13, 13-26. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 22.Cohen, O., Cans, C., Cuillel, M., Gilardi, J. L., Roth, H., Mermet, M. A., Jalbert, P. & Demongeot, J. (1996) Hum. Genet. 97, 659-657. [DOI] [PubMed] [Google Scholar]
- 23.Sankoff, D., Deneault, M., Turbis, P. & Allen, C. (2002) Theor. Popul. Biol. 61, 497-501. [DOI] [PubMed] [Google Scholar]
- 24.Obe, G., Pfeiffer, Savage, J. R., Johannes, C., Goedecke, W., Jeppesen, P., Natarajan, A. T., Martinez-Lopez, W., Folle, G. A. & Drets, M. E. (2002) Mutat. Res. 504, 17-36. [DOI] [PubMed] [Google Scholar]
- 25.Butler, M. P., Iida, S., Capello, D., Rossi, D., Rao, P. H., Nallasivam, P., Louie, D. C., Chaganti, S., Au, T., Gascoyne, R. D., et al. (2002) Cancer Res. 62, 4089-4094. [PubMed] [Google Scholar]
- 26.Ruiz-Herrera, A., Ponsa, M., Garcia, F., Egozcue, J. & Garcia, M. (2002) Chromosome Res. 10, 33-44. [DOI] [PubMed] [Google Scholar]
- 27.Shiraishi, T., Druck, T., Mimori, K., Flomenberg, J., Berk, L., Alder, H., Miller, W., Huebner, K. & Croce, C. M. (2001) Proc. Natl. Acad. Sci. USA 98, 5722-5727. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 28.Dehal, P., Predki, P., Olsen, A. S., Kobayashi, A., Folta, P., Lucas, S., Land, M., Terry, A., Ecale Zhou, C. L., Rash, S., et al. (2001) Science 293, 104-111. [DOI] [PubMed] [Google Scholar]
- 29.Volik, S., Zhao, S., Chin, K., Brebner, J. H., Herndon, D. R., Tao, Q., Kowbel1, D., Huang, G., Lapuk, A., Kuo, W. L., et al. (2003) Proc. Natl. Acad. Sci. USA, in press. [DOI] [PMC free article] [PubMed]
- 30.Waterston, R. H., Lindblad-Toh, K., Birney, E., Rogers, J., Abril, J. F., Agarwal, P., Agarwala, R., Ainscough, R., Alexandersson, M., An, P., et al. (2002) Nature 420, 520-562. [DOI] [PubMed] [Google Scholar]
- 31.Rowley, J. D. (1998) Annu. Rev. Genet. 32, 495-519. [DOI] [PubMed] [Google Scholar]
- 32.Bourque, G. & Pevzner, P. A. (2002) Genome Res. 12, 9748-9753. [PMC free article] [PubMed] [Google Scholar]
- 33.Moret, B. M., Wang, L. S., Warnow, T. & Wyman, S. K. (2001) Bioinformatics 17, Suppl. 1, S165-S173. [DOI] [PubMed] [Google Scholar]
- 34.Glaz, J., Naus, J. & Wallenstein, S. (2001) Scan Statistics (Springer, Berlin).
- 35.Watterson, G. A., Ewens, W. J., Hall, T. E. & Morgan, A. (1982) J. Theor. Biol. 99, 1-7. [Google Scholar]
- 36.Hannenhalli, S. & Pevzner, P. A. (1995) in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA), pp. 581-592.
- 37.Hannenhalli, S. & Pevzner, P. A. (1999) J. ACM 46, 1-27. [Google Scholar]
- 38.Tesler, G. (2002) J. Comp. Sys. Sci. 65, 587-609. [Google Scholar]
- 39.Tesler, G. (2002) Bioinformatics 18, 492-493. [DOI] [PubMed] [Google Scholar]
- 40.Churchill, G. A., Daniels, D. L. & Waterman, M. S. (1990) Nucleic Acids Res. 18, 589-597. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 41.Yunis, J. J. & Prakash, O. (1982) Science 215, 1525-1530. [DOI] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.