Abstract

A classic problem in comparative genomics is to find a shortest sequence of evolutionary operations that transform one genome into another. There are different types of genome rearrangement operators such as reversals, transpositions, translocations, block interchange, double cut and join (DCJ) etc. In this paper we consider reversals and block-interchanges simultaneously and incorporate inverted block-interchange in a heuristic algorithm, which inverts one or both of the two swapped segments of a block-interchange. Experimental results confirm that incorporation of inverted block-interchange always results in a better (or at least equal) sorting sequence.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.