微信服务号

微信订阅号

Home > Archive>Volume 13, Issue 6, 2002 >1117-1122
PDF HTML XML Export Cite reminder
Computational Complexity and an Approximation Algorithm for Star-Tree Phylogeny Problem with Reversal Distance
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    In this paper, the algorithms and the computational complexity of Star-Tree phylogeny problem are studied. The Star-Tree phylogeny problem is proved to be NP-complete first. Then it is proved that there is no absolute approximation algorithm for this problem. At last, a polynomial approximation algorithm of ratio 2 is presented to compute the Star-Tree phylogeny problem.

    Reference
    Related
    Cited by
Get Citation

朱大铭,马绍汉,雷鹏.翻转距离星树问题的计算复杂度和近似算法.软件学报,2002,13(6):1117-1122

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 10,2000
  • Revised:March 01,2001
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063