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 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
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
A 1.5-approximation algorithm for sorting by transpositions and transreversals
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 very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
A 1.375-approximation algorithm for sorting by transpositions
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Faster algorithms for sorting by transpositions and sorting by block interchanges
ACM Transactions on Algorithms (TALG)
Expected number of breakpoints after t random reversals in genomes with duplicate genes
Discrete Applied Mathematics
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions
BSB '08 Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Edit Distances and Factorisations of Even Permutations
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A quadratic time 2-approximation algorithm for block sorting
Theoretical Computer Science
Block sorting: a characterization and some heuristics
Nordic Journal of Computing
Constraint Programming Models for Transposition Distance Problem
BSB '09 Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology
Extending Bafna-Pevzner algorithm
ISB '10 Proceedings of the International Symposium on Biocomputing
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters
Prefix reversals on binary and ternary strings
AB'07 Proceedings of the 2nd international conference on Algebraic biology
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
An improved 1.375-approximation algorithm for the transposition distance problem
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Bounds on the transposition distance for lonely permutations
BSB'10 Proceedings of the Advances in bioinformatics and computational biology, and 5th Brazilian conference on 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
Weighted genomic distance can hardly impose a bound on the proportion of transpositions
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
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
A Lower Bound on the Transposition Diameter
SIAM Journal on Discrete Mathematics
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Journal of Computer and System Sciences
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
Fitness distance correlation and search space analysis for permutation based problems
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A (1+ε)-approximation algorithm for sorting by short block-moves
Theoretical Computer Science
The distribution of cycles in breakpoint graphs of signed permutations
Discrete Applied Mathematics
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
| 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 10-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 simple permutations.