Stack Solution for Finding Optimal One

Abstract

In comparative genomics, genome rearrangement evolution is an important effort. Genome conversion is the major problem in this field using different sorting process. Transforming one sequence into another and finding an optimal solution is a useful tool for analyzing real evolutionary scenario but it will be much better if we find all possible solution for that. In order to obtain more accurate result, some solution should be taken into consideration as there is large number of different optimal sorting sequence. Reversal and translocation are the two common genome sorting process used in development of mammalian species. The problem of genome sorting using reversal and translocation is to find the shortest sequence that transforms any source genome A into some target genome B. Currently the question is resolved by lessening of sorting by reversal and sorting by translocation problem separately, but here we are applying both the sorting process together at the same time. By this paper we present an algorithm for the two sorting process that explicitly treats them as two distinct operations, along with that finding the various solutions which is a better hypothetical and real-world solution than just finding a solo one. If we have single solution for any problem then we cannot decide whether this solution is the perfect one or not but if we have more solution indeed we can find the best one among them and say this is the perfect solution. We also present an example which proves that this solution is more prominent than previous one.