Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing
An algorithm to enumerate all sorting reversals
Proceedings of the sixth annual international conference on Computational biology
Edit Distances for Genome Comparisons Based on Non-Local Operations
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Hurdles Hardly Have to Be Heeded
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
On the cost of interchange rearrangement in strings
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Listing all sorting reversals in quadratic time
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Polynomial-time sortable stacks of burnt pancakes
Theoretical Computer Science
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms
On the repeat-annotated phylogenetic tree reconstruction problem
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Sorting by translocations via reversals theory
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Ordering partially assembled genomes using gene arrangements
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Sorting genomes using almost-symmetric inversions
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Heuristics for the Sorting by Length-Weighted Inversion Problem
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Hi-index | 0.05 |
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation. Their solution, as well as subsequent ones, relies on many intermediary constructions, such as simulations with permutations on 2n elements, and manipulation of various graphs. Here we give the first completely elementary treatment of this problem. We characterize safe reversals and hurdles working directly on the original signed permutation. Moreover, our presentation leads to polynomial algorithms that can be efficiently implemented using bit-wise operations.