目标序列部分确定的翻转距离星树问题-CiteSeerX.PDF

1000-9825/2003/14(02)0183 ©2003 Journal of Software 软 件 学 报 Vol.14, No.2 ∗ 目标序列部分确定的翻转距离星树问题 + 栾峻峰 , 朱大铭, 马绍汉 ( 山东大学 计算机科学与技术学院, 山东 济南 250100) A Problem of Reversal Distance on Star-Tree with Object Partially Fixed + LUAN Jun-Feng , ZHU Da-Ming, MA Shao-Han (School of Computer Science and Technology, Shandong University, Ji’nan 250100, China) + Corresponding author: Phn: 86-531-8395772, E-mail: jfluan@ Received 2001-10-23; Accepted 2002-02-26 Luan JF, Zhu DM, Ma SH. A problem of reversal distance on star-tree with object partially fixed. Journal of Software, 2003,14(2):183~189. Abstract: A problem of reversal distance on star-tree is discussed. The problem of 3SAT is induced to the problem of the reversal distance on star-tree with object partially fixed. The fact described below is proved: if an instance has 3 sequences given, and the order and some signs of the symbols in aimed sequence are fixed, it is still NP-hard to solve the problem of reversal distance on star-tree in which only need to decide the signs of the other symbols to minimizing the sum of distance between object and the given sequences. A polynomial approximation algorithm for the problem is given. Key words: algorithm; computational complexity; evolutionary tree; genome; reversal distance 摘 要: 讨论翻转距离星树问题,将3SAT 问题归约到目标序列部分固定的翻转距离星树问题,证明实例中当有 向符号序列个数为 3 时,若目标序列符号顺序固定,且有部分符号方向给定,则只确定其余符号方向以使得目标 序列与已知3 条给定序列翻转距离之和最小所对应的翻转距离星树问题也是NP-难解问题. 同时,还给出了该问 题的多项式时间近似算法. 关键词: 算法;计算复杂性;进化树;基因组;翻转距离 中图法分类号: TP301 文献标识码: A 基因组翻转距离计算问题由 D.S ank off 等人提出[ 1] ,其极强的理论及实用价值吸引了许多专家 的注 意[2~4] ,S.Hannenhalli 与 P.A.Pevzner 给出多项式时间算法解决了任意两个有向符号序列的翻转距离计算问 题[5] .D.Sankoff 等人对多种形式的进化距离,提出各种形式的进化树问题,这些进化树问题都有很强的应用背 景,其中星树问题是进化树问