Sorting strings by reversals and by transpositions

Christie, D. A. and Irving, R. W. (2001) Sorting strings by reversals and by transpositions. SIAM Journal on Discrete Mathematics, 14(2), pp. 193-206. (doi:10.1137/S0895480197331995)

Full text not currently available from Enlighten.

Publisher's URL: http://dx.doi.org/10.1137/S0895480197331995

Abstract

The problems of sorting by reversals and sorting by transpositions have been studied because of their applications to genome comparison. Prior studies of both problems have assumed that the sequences to be compared (or sorted) contain no duplicates, but there is a natural generalization in which the sequences are allowed to contain repeated characters. In this paper we study primarily the versions of these problems in which the strings to be compared are drawn from a binary alphabet. We obtain upper and lower bounds for reversal and transposition distance and show that the problem of finding reversal distance between binary strings, and therefore between strings over an arbitrary fixed-size alphabet, is NP-hard.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Irving, Dr Rob
Authors: Christie, D. A., and Irving, R. W.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:SIAM Journal on Discrete Mathematics
Publisher:Society for Industrial and Applied Mathematics
ISSN:0895-4801
Published Online:01 August 2006

University Staff: Request a correction | Enlighten Editors: Update this record