• DocumentCode
    3396840
  • Title

    Transforming men into mice (polynomial algorithm for genomic distance problem)

  • Author

    Hannenhalli, Sridhar ; Pevzner, Pavel A.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
  • fYear
    1995
  • fDate
    23-25 Oct 1995
  • Firstpage
    581
  • Lastpage
    592
  • Abstract
    Many people believe that transformations of humans into mice happen only in fairy tales. However, despite some differences in appearance and habits, men and mice are genetically very similar. In the pioneering paper, J.H. Nadeau and B.A. Taylor (1984) estimated that surprisingly few genomic rearrangements (178±39) happened since the divergence of human and mouse 80 million years ago. However, their analysis is nonconstructive and no rearrangement scenario for human-mouse evolution has been suggested yet. The problem is complicated by the fact that rearrangements in multi chromosomal genomes include inversions, translocations, fusions and fissions of chromosomes, a rather complex set of operations. As a result, at first glance, a polynomial algorithm for the genomic distance problem with all these operations looks almost as improbable as the transformation of a (real) man into a (real) mouse. We prove a duality theorem which expresses the genomic distance in terms of easily computable parameters reflecting different combinatorial properties of sets of strings. This theorem leads to a polynomial time algorithm for computing most parsimonious rearrangement scenarios. Based on this result and the latest comparative physical mapping data we have constructed a scenario of human-mouse evolution with 131 reversals/translocaitons/fusions/fissions. A combination of the genome rearrangement algorithm with the recently proposed experimental technique called ZOO FISH suggests a new constructive approach to the 100 year old problem of reconstructing mammalian evolution
  • Keywords
    biology computing; duality (mathematics); evolution (biological); genetics; pattern matching; set theory; sorting; string matching; ZOO FISH; combinatorial properties; comparative physical mapping data; computable parameters; duality theorem; genome rearrangement algorithm; genomic distance problem; genomic rearrangements; human-mouse evolution; mammalian evolution; multi chromosomal genomes; parsimonious rearrangement scenarios; polynomial algorithm; polynomial time algorithm; strings; Bioinformatics; Biological cells; Chaos; Computer science; Ear; Genomics; Humans; Mice; Polynomials; Power engineering and energy;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on
  • Conference_Location
    Milwaukee, WI
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-7183-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1995.492588
  • Filename
    492588