Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity

Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by length-weighted reversals in two directions: we consider the signed case for linear sequences and also the signed and unsigned cases for circular sequences. We give lower and upper bounds as well as guaranteed approximation ratios for these three cases. The main result in this paper is an optimal polynomial-time algorithm for sorting circular 0/1 sequences when the cost function is additive.

• Type: Conference
• Year: 2004
• Where: CPM
• Authors: Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
• Keywords: Circular 0/1 Sequences, Circular Sequences, CPM 2004, Linear Sequences