Abstract:
InComputationalbiology,genomerearrangementbytranspositionisanimportantproblem. Genome evolution analysis by transpositions leads to a combinatorial optimization problem of sorting by transpositions. Though the status of the transposition distance problem was open, a non-trivial proof for the NP-completeness of the transposition median problem is given [2]. In this paper, we utilize a 1.375-approximation algorithm for sorting by transpositions [16]. GRIMM is a tool for analyzing rearrangements in pairs of genomes, including unichromosomal and multichromosomal genomes, and signed and unsigned data. In GRIMM, reversal is the only operation for unichromosomal genome rearrangement. In this paper, we implement transposition in GRIMM as another unichromosomal operation. Wealsocomputethetranspositionaldistancebetweentwogenomesandcomputeitwiththe corresponding reversal distance. At the end of the paper, we also show that, we merge, two algorithms [16] and [11], we reduced the algorithm [16] in our implementation of transposition.
Description:
We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Our heartiest gratitude, profound indebtedness and deep respect go to our supervisor Prof. Dr. M.SohelRahman,DepartmentofCSE,BangladeshUniversityofEngineeringand Technology, Dhaka, Bangladesh, for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing thesis.
We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work.
Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis.
