%0 Journal Article
	%A Swapnoneel Roy and  Minhazur Rahman and  Ashok Kumar Thakur
	%D 2008
	%J International Journal of Bioengineering and Life Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 14, 2008
	%T Sorting Primitives and Genome Rearrangementin Bioinformatics: A Unified Perspective
	%U https://publications.waset.org/pdf/1608
	%V 14
	%X Bioinformatics and computational biology involve
the use of techniques including applied mathematics,
informatics, statistics, computer science, artificial intelligence,
chemistry, and biochemistry to solve biological problems
usually on the molecular level. Research in computational
biology often overlaps with systems biology. Major research
efforts in the field include sequence alignment, gene finding,
genome assembly, protein structure alignment, protein structure
prediction, prediction of gene expression and proteinprotein
interactions, and the modeling of evolution. Various
global rearrangements of permutations, such as reversals and
transpositions,have recently become of interest because of their
applications in computational molecular biology. A reversal is
an operation that reverses the order of a substring of a permutation.
A transposition is an operation that swaps two adjacent
substrings of a permutation. The problem of determining the
smallest number of reversals required to transform a given
permutation into the identity permutation is called sorting by
reversals. Similar problems can be defined for transpositions
and other global rearrangements. In this work we perform a
study about some genome rearrangement primitives. We show
how a genome is modelled by a permutation, introduce some
of the existing primitives and the lower and upper bounds
on them. We then provide a comparison of the introduced
	%P 48 - 53