85 search results - page 6 / 17 » On Sorting Permutations by Double-Cut-and-Joins |
IPL
2007
14 years 9 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
AB
2007
Springer
15 years 1 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
100
click to vote
RECOMB
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
69
Voted
IPL
2008
14 years 9 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...