Abstract

A reversal inverts a segment and the signs of the elements of this segment in a permutation. A transposition exchanges the position of two consecutive segments. These are the most common kinds of genome rearrangements. In this paper, we introduce the study of prefix and suffix versions of these operations, that is, when only segments of the beginning or of the end are involved, when considering signed permutations. We gave asymptotic approximation algorithms of factor two for three new problems: when prefix and suffix reversals are allowed, when prefix reversals and prefix transpositions are allowed, and when prefix and suffix reversals and prefix and suffix transpositions are allowed.

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.