{"title":"Sorting Primitives and Genome Rearrangementin Bioinformatics: A Unified Perspective","authors":"Swapnoneel Roy, Minhazur Rahman, Ashok Kumar Thakur","country":null,"institution":"","volume":14,"journal":"International Journal of Bioengineering and Life Sciences","pagesStart":48,"pagesEnd":54,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/1608","abstract":"Bioinformatics and computational biology involve\r\nthe use of techniques including applied mathematics,\r\ninformatics, statistics, computer science, artificial intelligence,\r\nchemistry, and biochemistry to solve biological problems\r\nusually on the molecular level. Research in computational\r\nbiology often overlaps with systems biology. Major research\r\nefforts in the field include sequence alignment, gene finding,\r\ngenome assembly, protein structure alignment, protein structure\r\nprediction, prediction of gene expression and proteinprotein\r\ninteractions, and the modeling of evolution. Various\r\nglobal rearrangements of permutations, such as reversals and\r\ntranspositions,have recently become of interest because of their\r\napplications in computational molecular biology. A reversal is\r\nan operation that reverses the order of a substring of a permutation.\r\nA transposition is an operation that swaps two adjacent\r\nsubstrings of a permutation. The problem of determining the\r\nsmallest number of reversals required to transform a given\r\npermutation into the identity permutation is called sorting by\r\nreversals. Similar problems can be defined for transpositions\r\nand other global rearrangements. In this work we perform a\r\nstudy about some genome rearrangement primitives. We show\r\nhow a genome is modelled by a permutation, introduce some\r\nof the existing primitives and the lower and upper bounds\r\non them. We then provide a comparison of the introduced\r\nprimitives.","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 14, 2008"}