Genome Rearrangement Problem with Simpler Transposition Distance

Pranav Kumar and G. Sahoo

Comparative genomics actually resolves around some of the most difficult questions such as “can one species be transformed into another or not”, so it attracts many researchers. There are several rearrangement operations available for the sorting of gene sequence but this paper deals with sorting by transposition. Transposition is an important rearrangement operation in the sorting of signed and unsigned permutation. It is an operation in which a segment from a chromosome is detached or shifted to another position. Among several types of transpositions, the block transposition approach is dealt. As its rearrangement distance complexity is still open, so many researchers are trying to add something to this topic. A TpSort approach is shown by removing plateau from the transposition. This can be unearthed by solving left and right mark algorithms generated from the permutation, along with exploring the simpler method for transposition distance problem. The result seems to be better than a previous study by Bafna and Pevzner.

Volume 11 | 10-Special Issue

Pages: 1319-1329

DOI: 10.5373/JARDCS/V11SP10/20192977