Self-adjusting binary search trees
Journal of the ACM (JACM)
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
CPM '96 Proceedings of the 7th Annual Symposium 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
Perfect Sorting by Reversals Is Not Always Difficult
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolution under Reversals: Parsimony and Conservation of Common Intervals
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A more efficient algorithm for perfect sorting by reversals
Information Processing Letters
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
Solving the Preserving Reversal Median Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reversals Cayley graphs of symmetric groups
Information Processing Letters
Topological Morphing of Planar Graphs
Graph Drawing
Sorting Signed Permutations by Inversions in O(nlogn) Time
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Swarming along the evolutionary branches sheds light on genome rearrangement scenarios
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Average-Case Analysis of Perfect Sorting by Reversals
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Rearrangement Models and Single-Cut Operations
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
Chronological order of reversal events on Rickettsia genus
ISB '10 Proceedings of the International Symposium on Biocomputing
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters
The solution space of sorting by reversals
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
A fast and exact algorithm for the perfect reversal median problem
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
An improved algorithm to enumerate all traces that sort a signed permutation by reversals
Proceedings of the 2010 ACM Symposium on Applied Computing
How to achieve an equivalent simple permutation in linear time
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Listing all sorting reversals in quadratic time
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
The problem of chromosome reincorporation in DCJ sorting and halving
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Listing all parsimonious reversal sequences: new algorithms and perspectives
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Polynomial-time sortable stacks of burnt pancakes
Theoretical Computer Science
An O(n3/2log(n)) algorithm for sorting by reciprocal translocations
Journal of Discrete Algorithms
An O(n3/2√log(n)) algorithm for sorting by reciprocal translocations
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Sorting by translocations via reversals theory
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Sorting genomes using almost-symmetric inversions
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.07 |
The problem of sorting signed permutations by reversals is inspired by genome rearrangement problems in computational molecular biology. Given two genomes represented as signed permutations of the same elements (e.g. orthologous genes), the problem consists in finding a most parsimonious scenario of reversals that transforms one genome into the other. Following the first polynomial solution of this problem, several improvements, simplifications, generalizations, tutorials or surveys have been published on the subject. While the reversal distance problem-i.e. the problem of computing the minimum number of reversals in a sorting sequence, without giving the sequence itself-seems to be well explored, the problem of giving a scenario realizing the distance still raises some open questions, one of which by Ozery-Flato and Shamir about whether an algorithm with subquadratic time complexity could ever be achieved for solving the problem. We give a positive answer to this question by describing an algorithm of time complexity O(n^3^/^2logn).