Self-adjusting binary search trees
Journal of the ACM (JACM)
Sorting permutations by block-interchanges
Information Processing Letters
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
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
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A very elementary presentation of the Hannenhalli-Pevzner theory
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
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
An improved algorithm for sorting by block-interchanges based on permutation groups
Information Processing Letters
The problem of chromosome reincorporation in DCJ sorting and halving
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
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
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 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
| Hi-index | 0.00 |
In this article, we present a new data structure, called the permutation tree, to improve the running time of sorting permutation by transpositions and sorting permutation by block interchanges. The existing 1.5-approximation algorithm for sorting permutation by transpositions has time complexity O(n3/2 &sqrt;logn). By means of the permutation tree, we can improve this algorithm to achieve time complexity O(nlogn). We can also improve the algorithm for sorting permutation by block interchanges to take its time complexity from O(n2) down to O(nlogn).