The transposition median problem is NP-complete

@article{Bader2011TheTM,
  title={The transposition median problem is NP-complete},
  author={Martin Bader},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={1099-1110}
}
During the last 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 is 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… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
2 Citations
32 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

R

  • T. Hartman
  • Sharan, A 1.5-approximation algorithm for sorting…
  • 2005
Highly Influential
4 Excerpts

A fast and exact algorithm for the median of three problem - a graph decomposition approach

  • A. Xu
  • Journal of Computational Biology 16 (10)
  • 2009
2 Excerpts

Similar Papers

Loading similar papers…