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
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
An algorithm to enumerate all sorting reversals
Proceedings of the sixth annual international conference on Computational biology
Reconstructing an ancestral genome using minimum segments duplications and reversals
Journal of Computer and System Sciences - Computational biology 2002
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Experiments in Computing Sequences of Reversals
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On maximal instances for the original syntenic distance
Theoretical Computer Science
An O(n2) algorithm for signed translocation
Journal of Computer and System Sciences - Special issue on bioinformatics II
Sorting signed permutations by reversals, revisited
Journal of Computer and System Sciences - Special issue on bioinformatics II
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Colored de Bruijn Graphs and the Genome Halving Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reversal and transposition medians
Theoretical Computer Science
Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing bacterial genomes from linear orders of patterns
Discrete Applied Mathematics
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences
HP Distance Via Double Cut and Join Distance
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A new linear time algorithm to compute the genomic distance via the double cut and join distance
Theoretical Computer Science
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Chronological order of reversal events on Rickettsia genus
ISB '10 Proceedings of the International Symposium on Biocomputing
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Efficient data structures and a new randomized approach for sorting signed permutations by reversals
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
An improved algorithm to enumerate all traces that sort a signed permutation by reversals
Proceedings of the 2010 ACM Symposium on Applied Computing
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maximizing synteny blocks to identify ancestral homologs
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Efficient sampling of transpositions and inverted transpositions for bayesian MCMC
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Matrix tightness: a linear-algebraic framework for sorting by transpositions
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Genome halving problem revisited
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A PQ framework for reconstructions of common ancestors and phylogeny
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Conservation of combinatorial structures in evolution scenarios
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Genome rearrangement in mitochondria and its computational biology
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Hi-index | 0.01 |
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.