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...
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...
Firas Swidan, Michael A. Bender, Dongdong Ge, Sima...
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
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...
Hee Joon Hwang, Hyoung Joong Kim, Vasiliy Sachnev,...
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...