83 search results - page 1 / 17 » Improving the Efficiency of Sorting by Reversals |
BIOCOMP
2006
14 years 9 days ago
2006
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
IPL
2008
13 years 11 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
JCSS
2008
13 years 11 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...
ITIIS
2010
2010
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
13 years 9 months ago
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
CPM
2004
Springer
14 years 2 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...