SIAM Journal on Discrete Mathematics
Reversing trains: a turn of the century sorting problem
Journal of Algorithms
On the problem of sorting burnt pancakes
Discrete Applied Mathematics
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
Sorting by reversals is difficult
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth 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
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
Improved bounds on sorting with length-weighted reversals
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
8/7-approximation algorithm for (1,2)-TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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)
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
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)
Sorting by transpositions: dealing with length-weighted models
International Journal of Bioinformatics Research and Applications
Improved bounds on sorting by length-weighted reversals
Journal of Computer and System Sciences
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
The gene evolution model and computing its associated probabilities
Journal of the ACM (JACM)
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
A simpler 1.5-approximation algorithm for sorting by transpositions
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Genome rearrangement algorithms for unsigned permutations with O(log n) singletons
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Polynomial-time sortable stacks of burnt pancakes
Theoretical Computer Science
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
Efficient sampling of transpositions and inverted transpositions for bayesian MCMC
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
A 2-approximation algorithm for sorting by prefix reversals
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A 1.375-approximation algorithm for sorting by transpositions
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
Genome rearrangement in mitochondria and its computational biology
RCG'04 Proceedings of the 2004 RECOMB international conference on Comparative Genomics
Sorting by weighted reversals, transpositions, and inverted transpositions
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Analysis of genomes evolving by inversions leads to a general combinatorial problem of Sorting by Reversals, MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. Following a series of preliminary results, Hannenhalli and Pevzner developed the first exact polynomial time algorithm for the problem of sorting signed permutations by reversals, and a polynomial time algorithm for a special case of unsigned permutations. The best known approximation algorithm for MIN-SBR, due to Christie, gives a performance ratio of 1.5. In this paper, by exploiting the polynomial time algorithm for sorting signed permutations and by developing a new approximation algorithm for maximum cycle decomposition of breakpoint graphs, we design a new 1.375-algorithm for the MIN-SBR problem.