Parallel approach on sorting of genes in search of optimal solution

An important tool for comparing genome analysis is the rearrangement event that can transform one given genome into other. For finding minimum sequence of fission and fusion, we have proposed here an algorithm and have shown a transformation example for converting the source genome into the target genome. The proposed algorithm comprises of circular sequence i.e. “cycle graph” in place of mapping. The main concept of algorithm is based on optimal result of permutation. These sorting processes are performed in constant running time by showing permutation in the form of cycle. In biological instances it has been observed that transposition occurs half of the frequency as that of reversal. In this paper we are not dealing with reversal instead commencing with the rearrangement of fission, fusion as well as transposition. •Genome rearrangement problem.•Significant result in species recognition.•Problem of sorting by transposition and fission and fusion along with that finding an optimal solution.•A new algorithm that traverse traces using three sorting operations having two or more processes working in parallel.