Sorting by transposition and translocation using parallel approach

Study of genomic rearrangement helps in species recognition and is an important procedure to understand evolution process and comparative genomics in a better way. If we have two genome A and B, our aim is to convert one genomic sequence A into another one using two sorting process called transposition and translocation. Sorting by transposition and translocation (SBT²) problem is based on minimum length sequence conversion. During evolution genomes undergo large scale mutations to change gene order, mainly (reversal, translocation and transposition) but here we focus on transposition and translocation only. This paper reexamines the problem of genome sorting by transposition and translocation together and proposed a layout with a parallel concept. We give an elementary proof for computing arrangement distance formula and a proficient algorithm is derived to solve the problem of sorting by transposition and translocation which looks simpler, faster and natural.