SIAM Journal on Discrete Mathematics
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
Finding an Optimal Inversion Median: Experimental Results
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
On Some Tighter Inapproximability Results
On Some Tighter Inapproximability Results
INFORMS Journal on Computing
A 1.5-approximation algorithm for sorting by transpositions and transreversals
Journal of Computer and System Sciences - Special issue on bioinformatics II
A 1.375-Approximation Algorithm for Sorting by Transpositions
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Reversal and transposition medians
Theoretical Computer Science
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Information and Computation
Improving inversion median computation using commuting reversals and cycle information
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
On the Cost of Interchange Rearrangement in Strings
SIAM Journal on Computing
Disjoint cycles: integrality gap, hardness, and approximation
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 5.23 |
During recent years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the most important distance measures are the reversal distance and the transposition distance. The two main tasks in all phylogenetic reconstruction algorithms are to calculate pairwise distances and to solve the median of three problem. While the reversal distance problem can be solved in linear time, the reversal median problem has been proven to be NP-complete. The status of the transposition distance problem is still open, but it is conjectured to be more difficult than the reversal problem. This, in turn, also suggests that the transposition median problem is NP-complete. However, this conjecture could not yet be proven. We have now succeeded in giving a non-trivial proof for the NP-completeness of the transposition median problem.