SIAM Journal on Discrete Mathematics
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 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
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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 simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
New Bounds and Tractable Instances for the Transposition Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Transposition Distance Based on the Algebraic Formalism
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Block sorting: a characterization and some heuristics
Nordic Journal of Computing
Interchange rearrangement: The element-cost model
Theoretical Computer Science
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Multi-break rearrangements: from circular to linear genomes
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
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
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
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 |
Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a ten-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: We improve the lower bound for the transposition diameter of the symmetric group, and determine the exact transposition diameter of 2-permutations and simple permutations.