Proceedings of IEEE 36th Annual Foundations of Computer Science (1995)
Oct. 23, 1995 to Oct. 25, 1995
S. Hannenhalli , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
P.A. Pevzner , Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA
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/spl plusmn/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.
biology computing; evolution (biological); genetics; duality (mathematics); sorting; set theory; string matching; pattern matching; polynomial algorithm; genomic distance problem; genomic rearrangements; human-mouse evolution; multi chromosomal genomes; duality theorem; computable parameters; combinatorial properties; strings; polynomial time algorithm; parsimonious rearrangement scenarios; comparative physical mapping data; genome rearrangement algorithm; ZOO FISH; mammalian evolution
S. Hannenhalli and P. Pevzner, "Transforming men into mice (polynomial algorithm for genomic distance problem)," Proceedings of IEEE 36th Annual Foundations of Computer Science(FOCS), Milwaukee, Wisconsin, 1995, pp. 581.