2 search results - page 1 / 1 » Improved bounds on sorting by length-weighted reversals |
CPM
2004
Springer
15 years 10 days ago
2004
Springer
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 l...
JCSS
2008
14 years 7 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...