LUAN Junfeng, ZHU Daming, MA Shaohan. The Problem of Reversal Distance on Star-Trees with 9 SequencesJ. Journal of Computer Research and Development, 2003, 40(8): 1277-1278.
Citation:
LUAN Junfeng, ZHU Daming, MA Shaohan. The Problem of Reversal Distance on Star-Trees with 9 SequencesJ. Journal of Computer Research and Development, 2003, 40(8): 1277-1278.
LUAN Junfeng, ZHU Daming, MA Shaohan. The Problem of Reversal Distance on Star-Trees with 9 SequencesJ. Journal of Computer Research and Development, 2003, 40(8): 1277-1278.
Citation:
LUAN Junfeng, ZHU Daming, MA Shaohan. The Problem of Reversal Distance on Star-Trees with 9 SequencesJ. Journal of Computer Research and Development, 2003, 40(8): 1277-1278.
The Problem of Reversal Distance on Star-Trees with 9 Sequences
The problem of the reversal distance between genomes on star-trees is discussed. It is proved that if the instance has 9 sequences given, the problem of the reversal distance on star-trees must be NP-hard. A polynomial approximation algorithm for the problem is given.
DownLoad: