Problems Of Sorting Genomes By Translocations And Deletions In Computational Biology

Computational biology is one of the most hottest research in the world today, result from the study of the Computational Biology are influence the study progress in many other fields like biological race evolution, cladistics, and the bio-pharmaceuticals etc, more and more scientics, especially those experts in the field of Biology, Mathematics, Computer Science, Chemistry, are interested in the progress of Computational Biology.With the advent of large-scale DNA physical mapping and sequencing, studies of genome rearrangements are becoming increasingly important in evolutionary molecular biology. One of the most useful way to learn the evolutionary history of species is to compute the sequence of genes in two different genomes. In the late 1980's, Jeffery Palmer and his colleagues discovered a remarkable pattern of evolutionary change in plant organelles. They mapped the mitochondrial genomes of cabbage and turnip, which are very closely related. To their surprise, these molecules, which are almost identical in gene sequence, differ dramatically in gene order. This discovery and many other studies in the last decade proved that genome rearrangements are common mode of molecular evolution. In the progress of biological evolution, The most common rearrangement events in mammalian evolution are translocations, which exchange genetic material between different chromosomes, and reversals, which rearrange genetic material within a chromosome.This paper worked on the problem of sorting genomes by translocations and deletions, and these are two results:(1). Improved the method of O(n3) time in this problem, by improving treatments of trees in many section, and use new simpler subroutine. It's time has been reduced to O(n2).(2). Been inspired by the method of sorting genomes by translocations, we did not discuss the sections in translocation-deletion problems. And we do it after all the proper translocations has done. In this way, it will be simpler and the time will reduce to O(n2).