More Web Proxy on the site http://driver.im/

Article

Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited

Authors:

Glenn TeslerAuthors Info & Claims

RECOMB '03: Proceedings of the seventh annual international conference on Research in computational molecular biology

Pages 247 - 256

https://doi.org/10.1145/640075.640108

Published: 10 April 2003 Publication History

Abstract

Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the existing varieties of genomic architectures. The genomic sequences of human and mouse provide evidence for a larger number of rearrangements than previously thought and shed some light on previously unknown features of mammalian evolution. In particular, they reveal extensive re-use of breakpoints from the same relatively short regions. Our analysis implies the existence of a large number of very short "hidden" synteny blocks that were invisible in comparative mapping data and were not taken into account in previous studies of chromosome evolution. These blocks are defined by closely located breakpoints and are often hard to detect. Our result is in conflict with the widely accepted random breakage model of chromosomal evolution. We suggest a new "fragile breakage" model of chromosome evolution that postulates that breakpoints are chosen from relatively short fragile regions that have much higher propensity for rearrangements than the rest of the genome.

References

[1]

D. Bader, B. Moret, and M. Yan. A linear-time algorithm for computing inversion distances between signed permutations with an experimental study. Journal of Computational Biology, 8:483--491, 2001.

[2]

V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 148--157, 1993 (Full version has appeared in SIAM J. Computing, 25: 272--289, 1996).

Digital Library

[3]

V. Bafna and P. Pevzner. Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, 12:239--246, 1995.

[4]

A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. In Proceedings 12th Annual Symposium on Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 106--117, Jerusalem, Israel, 2001.

Digital Library

[5]

P. Berman and S. Hannenhalli. Fast sorting by reversal. In Combinatorial Pattern Matching. 7th Annual Symposium, volume 1075 of Lecture Notes in Computer Science, pages 168--185, New York, 1996. Springer.

Digital Library

[6]

G. Bourque and P. Pevzner. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research, 12:9748--9753, 2002.

[7]

G. Churchill, D. Daniels, and M. Waterman. The distribution of restriction enzyme sites in Escherichia coli. Nucleic Acids Research, 18:589--597, 1990.

[8]

O. Cohen, C. Cans, M. Cuillel, J. Gilardi, H. Roth, M. Mermet, P. Jalbert, and J. Demongeot. Cartographic study: breakpoints in 1574 families carrying human reciprocal translocations. Human Genetics, 97:659--657, 1996.

[9]

R. DeBry and M. Seldin. Human/mouse homology relationships. Genomics, 33:337--351, 1996.

[10]

T. Dobzhansky and A. Sturtevant. Inversions in the chromosomes of Drosophila pseudoobscura. Genetics, 23:28--64, 1938.

[11]

N. El-Mabrouk. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. Journal of Discrete Algorithms, 1:--, 2000.

[12]

J. Glaz, J. Naus, and S. Wallenstein. Scan Statistics. Springer, Berlin, 2001.

[13]

S. Hannenhalli and P. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pages 581--592, Milwaukee, Wisconsin, 1995.

Digital Library

[14]

S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pages 178--189, 1995 (full version appeared in Journal of ACM, 46: 1--27, 1999).

Digital Library

[15]

S. Hannenhalli and P. Pevzner. To cut. or not to cut (applications of comparative physical maps in molecular evolution). In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 304--313, 1996.

Digital Library

[16]

H. Kaplan, R. Shamir, and R. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344--351, New York, 1997. ACM.

Digital Library

[17]

J. Kececioglu and D. Sankoff. Exact and approximation algorithms for the inversion distance between two permutations. Algorithmica, 13:180--210, 1995.

[18]

W. J. Kent. BLAT--the BLAST-like alignment tool. Genome Research, 12:656--664, 2002.

[19]

B. Koop and L. Hood. Striking sequence similarity over almost 100 kilobases of human and mouse T-cell receptor DNA. Nature Genetics, 7:48--53, 1994.

[20]

E. Lander and et~al. Initial sequencing and analysis of the human genome. Nature, 409:860--921, 2001.

[21]

B. Ma, J. Tromp, and M. Li. PatternHunter: faster and more sensitive homology search. Bioinformatics, 18:440--445, 2002.

[22]

C. Mayor, M. Brudno, J. Schwartz, A. Poliakov, E. M. Rubin, K. A. Frazer, L. Pachter, and I. Dubchak. VISTA: Visualizing global DNA sequence alignments of arbitrary length. Bioinformatics, 16:1046--1047, 2000.

[23]

B. Moret, A. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABI'02), Rome (Lecture Notes in Computer Science 2452), pages 521--563, 2002.

Digital Library

[24]

R. Mural and et~al. A comparison of whole-genome shotgun-derived mouse chromosome 16 and the human genome. Science, 296:1661--1671, 2002.

[25]

W. J. Murphy, G. Bourque, G. Tesler, P. A. Pevzner, and S. J. O'Brien. Analysis of mammalian genome rearrangements using multispecies comparative maps. (submitted).

[26]

N. Copeland, et al. A genetic linkage map of the mouse: Current applications and future prospects. Science, 262:57--66, 1993.

[27]

J. Nadeau and D. Sankoff. Counting on comparative maps. Trends Genet., 14:495--501, 1998.

[28]

J. Nadeau and D. Sankoff. The lengths of undiscovered conserved segments in comparative maps. Mamm Genome., 9:491--495, 1998.

[29]

J. Nadeau and B. Taylor. Lengths of chromosomal segments conserved since divergence of man and mouse. Proceedings of the National Academy of Sciences USA, 81:814--818, 1984.

[30]

S. Ohno. Ancient linkage groups and frozen accidents. Nature, 244:259--262, 1973.

[31]

E. Pennisi. A mouse chronology. Science, 288:248--257, 2000.

[32]

P. Pevzner and G. Tesler. Genome rearrangements in mammalian evolution: Lessons from human and mouse genomic sequences. Genome Research, 13:13--26, 2003.

[33]

R. Waterston, et al. Initial sequencing and comparative analysis of the mouse genome. Nature, 420:520--562, 2002.

[34]

D. Sankoff. Comparative mapping and genome rearrangement. In J. Dekkers, S. Lamont, and M. Rotschild, editors, From Jay L. Lush to Genomics: Visions for animal breeding and genetics, pages 124--134, 1999.

[35]

D. Sankoff and M. Blanchette. The median problem for breakpoints in comparative genomics. In Computing and Combinatorics, Proceeedings of COCOON `97, Lecture Notes in Computer Science, pages 251--263, New York, 1997. Springer Verlag.

[36]

D. Sankoff, M. Deneault, P. Turbis, and C. Allen. Chromosomal distribution of breakpoints in cancer, infertility, and evolution. Theoretical Population Biology, 61:497--501, 2002.

[37]

D. Sankoff, M. Parent, and D. Bryant. Accuracy and robustness of analyses based on numbers of genes in observed segments. In D. Sankoff and J. Nadeau, editors, Comparative Genomics - Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families., pages 299--305. Kluwer, 2000.

[38]

D. Sankoff, M. Parent, I. Marchand, and V. Ferretti. On the Nadeau-Taylor theory of conserved chromosome segments. In Eight Annual Symposium on Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 262--274, Aarhus, Denmark, June 1997. Springer-Verlag.

Digital Library

[39]

D. Schoen. Comparative genomics, marker density and statistical analysis of chromosome rearrangements. Genetics, 154:943--952, 2000.

[40]

S. Schwartz, Z. Zhang, K. A. Frazer, A. Smit, C. Riemer, J. Bouck, R. Gibbs, R. Hardison, and W. Miller. PipMaker -- a web server for aligning two genomic DNA sequences. Genome Research, 10:577--586, 2000.

[41]

R. Tatusov, E. Koonin, and D. Lipman. A genomic perspective on protein families. Science, 278:631--637, 1997.

[42]

G. Tesler. GRIMM, 2001. http://www-cse.ucsd.edu/groups/bioinformatics/GRIMM.

[43]

G. Tesler. Efficient algorithms for multichromosomal genome rearrangements. J. Comp. Sys. Sci., 65(3):587--609, 2002.

Digital Library

[44]

G. Tesler. GRIMM: genome rearrangements web server. Bioinformatics, 18:492--493, 2002.

[45]

J. Thomas, T. Summers, S. Lee-Lin, V. Maduro, J. Idol, S. Mastrian, J. R. JF, D. Jamison, and E. Green. Comparative genome mapping in the sequence-based era: early experience with human chromosome 7. Genome Research, 10:624--633, 2000.

Cited By

Hartmann TMiddendorf MBernt M(2024)Genome Rearrangement AnalysisComparative Genomics10.1007/978-1-0716-3838-5_9(215-245)Online publication date: 1-Jun-2024
https://doi.org/10.1007/978-1-0716-3838-5_9
Zeira RShamir R(2019)Genome Rearrangement Problems with Single and Multiple Gene Copies: A ReviewBioinformatics and Phylogenetics10.1007/978-3-030-10837-3_10(205-241)Online publication date: 9-Apr-2019
https://doi.org/10.1007/978-3-030-10837-3_10
Hartmann TMiddendorf MBernt M(2017)Genome Rearrangement Analysis: Cut and Join Genome Rearrangements and Gene Cluster Preserving ApproachesComparative Genomics10.1007/978-1-4939-7463-4_9(261-289)Online publication date: 26-Dec-2017
https://doi.org/10.1007/978-1-4939-7463-4_9
Show More Cited By

Index Terms

Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited
1. Applied computing
  1. Life and medical sciences

Recommendations

A Rapid Exact Solution for the Guided Genome Halving Problem
BCB '18: Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics

\subsubsection*Background Genome rearrangements are large-scale evolutionary events that shuffle genomic architectures. Since genome rearrangements are rare, the number of events between two genomes is used in phylogenomic studies to measure the ...
Rearrangement Phylogeny of Genomes in Contig Form

There has been a trend in increasing the phylogenetic scope of genome sequencing while decreasing the quality of the published sequence for each genome. With reduced finishing effort, there is an increasing number of genomes being published in contig ...
Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution

We present a parameterized definition of gene clusters that allows us to control the emphasis placed on conserved order within a cluster. Though motivated by biological rather than mathematical considerations, this parameter turns out to be closely ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

RECOMB '03: Proceedings of the seventh annual international conference on Research in computational molecular biology

April 2003

352 pages

ISBN:1581136358

DOI:10.1145/640075

Editors:
Martin Vingron
Max-Planck-Institute for Molecular Genetics, Germany
,
Sorin Istrail
Celera Genomics/Applied Biosystems
,
Pavel Pevzner
University of California at San Diego, CA
,
Michael Waterman
University of Southern California, CA
,
Program Chair:
Webb Miller
The Pennsylvania State University

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 April 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

RECOMB03

Sponsor:

RECOMB03: The Seventh Annual International Conference on Research in Computational Molecular Biology

April 10 - 14, 2003

Berlin, Germany

Acceptance Rates

RECOMB '03 Paper Acceptance Rate 35 of 175 submissions, 20%;

Overall Acceptance Rate 148 of 538 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
661
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hartmann TMiddendorf MBernt M(2024)Genome Rearrangement AnalysisComparative Genomics10.1007/978-1-0716-3838-5_9(215-245)Online publication date: 1-Jun-2024
https://doi.org/10.1007/978-1-0716-3838-5_9
Zeira RShamir R(2019)Genome Rearrangement Problems with Single and Multiple Gene Copies: A ReviewBioinformatics and Phylogenetics10.1007/978-3-030-10837-3_10(205-241)Online publication date: 9-Apr-2019
https://doi.org/10.1007/978-3-030-10837-3_10
Hartmann TMiddendorf MBernt M(2017)Genome Rearrangement Analysis: Cut and Join Genome Rearrangements and Gene Cluster Preserving ApproachesComparative Genomics10.1007/978-1-4939-7463-4_9(261-289)Online publication date: 26-Dec-2017
https://doi.org/10.1007/978-1-4939-7463-4_9
Feijao PMeidanis J(2011)SCJIEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)10.5555/2014670.20146838:5(1318-1329)Online publication date: 1-Sep-2011
https://dl.acm.org/doi/10.5555/2014670.2014683
Feijao PMeidanis J(2011)SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement ProblemsIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2011.348:5(1318-1329)Online publication date: Sep-2011
https://doi.org/10.1109/TCBB.2011.34
Farnoud FChien-Yu Chen Milenkovic OKashyap N(2010)A graphical model for computing the minimum cost transposition distance2010 IEEE Information Theory Workshop10.1109/CIG.2010.5592890(1-5)Online publication date: Aug-2010
https://doi.org/10.1109/CIG.2010.5592890
Bergeron AMedvedev PStoye J(2010)Rearrangement Models and Single-Cut OperationsJournal of Computational Biology10.1089/cmb.2010.009117:9(1213-1225)Online publication date: Sep-2010
https://doi.org/10.1089/cmb.2010.0091
Zhao HBourque G(2010)Chromosomal Rearrangements in EvolutionEvolutionary Genomics and Systems Biology10.1002/9780470570418.ch9(165-182)Online publication date: 12-Jul-2010
https://doi.org/10.1002/9780470570418.ch9
Andriani PMcKelvey B(2009) Perspective —From Gaussian to Paretian Thinking: Causes and Implications of Power Laws in Organizations Organization Science10.1287/orsc.1090.048120:6(1053-1071)Online publication date: Dec-2009
https://doi.org/10.1287/orsc.1090.0481
Tannier EZheng CSankoff D(2009)Multichromosomal median and halving problems under different genomic distancesBMC Bioinformatics10.1186/1471-2105-10-12010:1Online publication date: 22-Apr-2009
https://doi.org/10.1186/1471-2105-10-120
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents