We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, ...
Abstract. We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, ...
[PDF] Improved Bounds on Sorting with Length-Weighted Reversals
csaws.cs.technion.ac.il › typescripts
Abstract. We study the problem of sorting integer sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, ...
Improved Bounds on Sorting with Length-Weighted Reversals. (Extended Abstract) ... We study the sorting of integer permutations and sequences by length-weighted ...
We study the problem of sorting integer sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, ...
Abstract. We study the problem of sorting integer sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, ...
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f(l) = l ^ ...
We present tight or nearly tight upper and lower bounds on the worst-case cost of sorting by reversals. Then we develop algorithms to approximate the optimal ...
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an equal cost. This model limits the biological meaning of sorting ...
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 ...