Reconstructing the genomic architecture of ancestral mammals: Lessons from human, mouse, and rat genomes

被引:175
作者
Bourque, G
Pevzner, PA
Tesler, G [1 ]
机构
[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
[2] Univ Calif San Diego, Dept Comp Sci & Engn, La Jolla, CA 92093 USA
[3] Univ Montreal, Ctr Rech Math, Montreal, PQ H3C 3J7, Canada
关键词
D O I
10.1101/gr.1975204
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Recent analysis of genome rearrangements in human and mouse genomes revealed evidence for more rearrangements than thought previously and shed light on previously unknown features of mammalian evolution, like breakpoint reuse and numerous microrearrangements. However, two-way analysis cannot reveal the genomic architecture of ancestral mammals or assign rearrangement events to different lineages. Thus, the "original synteny" problem introduced by Nadeau and Sankoff previously, remains unsolved, as at least three mammalian genomes are required to derive the ancestral mammalian karyotype. We show that availability of the rat genome allows one to reconstruct a putative genomic architecture of the ancestral murid rodent genome. This reconstruction suggests that this ancestral genome retained many previously postulated chromosome associations in the placental ancestor and reveals others that were beyond the resolution of cytogenetic, radiation hybrid mapping, and chromosome painting techniques. Three-way analysis of rearrangements leads to a reliable reconstruction of the genomic architecture of specific regions in the murid ancestor, including the X chromosome, and for the first time allows one to assign major rearrangement events to one of human, mouse, and rat lineages. Our analysis implies that the rate of rearrangements is much higher in murid rodents than in the human lineage and confirms the existence of rearrangement hot-spots in all three lineages.
引用
收藏
页码:507 / 516
页数:10
相关论文
共 32 条
  • [1] Tandem repeats finder: a program to analyze DNA sequences
    Benson, G
    [J]. NUCLEIC ACIDS RESEARCH, 1999, 27 (02) : 573 - 580
  • [2] Blanchette, 1997, Genome Inform Ser Workshop Genome Inform, V8, P25
  • [3] Bourque G, 2002, GENOME RES, V12, P26
  • [4] The reversal median problem
    Caprara, A
    [J]. INFORMS JOURNAL ON COMPUTING, 2003, 15 (01) : 93 - 113
  • [5] Strategies and tools for whole-genome alignments
    Couronne, O
    Poliakov, A
    Bray, N
    Ishkhanov, T
    Ryaboy, D
    Rubin, E
    Pachter, L
    Dubchak, I
    [J]. GENOME RESEARCH, 2003, 13 (01) : 73 - 80
  • [6] Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals
    Hannenhalli, S
    Pevzner, PA
    [J]. JOURNAL OF THE ACM, 1999, 46 (01) : 1 - 27
  • [7] Hannenhalli S, 1995, AN S FDN CO, P581, DOI 10.1109/SFCS.1995.492588
  • [8] EXACT AND APPROXIMATION ALGORITHMS FOR SORTING BY REVERSALS, WITH APPLICATION TO GENOME REARRANGEMENT
    KECECIOGLU, J
    SANKOFF, D
    [J]. ALGORITHMICA, 1995, 13 (1-2) : 180 - 210
  • [9] The human genome browser at UCSC
    Kent, WJ
    Sugnet, CW
    Furey, TS
    Roskin, KM
    Pringle, TH
    Zahler, AM
    Haussler, D
    [J]. GENOME RESEARCH, 2002, 12 (06) : 996 - 1006
  • [10] Evolution's cauldron: Duplication, deletion, and rearrangement in the mouse and human genomes
    Kent, WJ
    Baertsch, R
    Hinrichs, A
    Miller, W
    Haussler, D
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (20) : 11484 - 11489