Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science - Special issue: Genome informatics
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
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
A review of metrics on permutations for search landscape analysis
Computers and Operations Research
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
Whole genome duplications, multi-break rearrangements, and genome halving problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Sorting by transpositions: dealing with length-weighted models
International Journal of Bioinformatics Research and Applications
Multi-break rearrangements and chromosomal evolution
Theoretical Computer Science
An approximation algorithm for sorting by reversals and transpositions
Journal of Discrete Algorithms
A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Block sorting: a characterization and some heuristics
Nordic Journal of Computing
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
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
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
Maximizing synteny blocks to identify ancestral homologs
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A new tight upper bound on the transposition distance
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
The complexity of string partitioning
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A new and faster method of sorting by transpositions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
An important problem in genome rearrangements is sorting permutations by transpositions. Its complexity is still open, and two rather complicated 1.5-approximation algorithms for sorting linear permutations are known (Bafna and Pevzner, 96 and Christie, 98). 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 1.5-approximation algorithm, which is considerably simpler than the previous ones, and achieves running time which is equal to the best known. Moreover, the analysis of the algorithm is significantly less involved, and provides a good starting point for studying related open problems.