Publication

Abstract : Genome rearrangement problems in Genomics are studied extensively due to their significance in the evolution theory and detection of hereditary illnesses. This is a challenging problem in Big Data science for Computational Biologist due to the large number of DNA sequences being generated, explored, and analyzed. Identifying the position of genes in a genome as a permutation has transformed this problem into a sorting of permutations with certain constraints. Sorting permutations by different types of reversals and transpositions have been an active area of research due to their high resemblance to genome rearrangements. A prefix transposition is a particular type of transposition where the first few symbols of the permutation are moved to another fixed position. In this paper, we provide a better upper bound for sorting permutations by prefix transpositions.