Self-adjusting binary search trees
Journal of the ACM (JACM)
SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science - Special issue: Genome informatics
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
SIAM Journal on Computing
Signed genome rearrangement by reversals and transpositions: models and approximations
Theoretical Computer Science
Discrete Mathematics
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A 1.5-approximation algorithm for sorting by transpositions and transreversals
Journal of Computer and System Sciences - Special issue on bioinformatics II
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
Working on the problem of sorting by transpositions on genome rearrangements
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The transposition median problem is NP-complete
Theoretical Computer Science
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions
SIAM Journal on Discrete Mathematics
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Analysis and implementation of sorting by transpositions using permutation trees
BSB'11 Proceedings of the 6th Brazilian conference on Advances in bioinformatics and computational biology
Matrix tightness: a linear-algebraic framework for sorting by transpositions
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Faster algorithms for sorting by transpositions and sorting by block-interchanges
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
The 1.375 approximation algorithm for sorting by transpositions can run in O(n log n) time
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
| Hi-index | 0.00 |
An important problem in genome rearrangements is sorting permutations by transpositions. The complexity of the problem is still open, and two rather complicated 1.5-approximation algorithms for sorting linear permutations are known (Bafna and Pevzner, 98 and Christie, 99). The fastest known algorithm is the quadratic algorithm of Bafna and Pevzner. In this paper, we observe that the problem of sorting circular permutations by transpositions is equivalent to the problem of sorting linear permutations by transpositions. Hence, all algorithms for sorting linear permutations by transpositions can be used to sort circular permutations. Our main result is a new O(n^3^/^2logn) 1.5-approximation algorithm, which is considerably simpler than the previous ones, and whose analysis is significantly less involved.