A polynomial-time algorithm for near-perfect phylogeny

被引：19
|
作者：
Fernández-Baca, D [1 ]
Lagergren, J
机构：
[1] Iowa State Univ, Dept Comp Sci, Ames, IA 50011 USA
[2] Royal Inst Technol, Dept Numer Anal & Comp Sci, S-10044 Stockholm, Sweden
来源：
SIAM JOURNAL ON COMPUTING | 2003年 / 32卷 / 05期
关键词：
algorithms; computational biology; character-based methods; evolutionary trees; parsimony; perfect phylogeny; phylogeny; Steiner tree;
D O I：
10.1137/S0097539799350839
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A parameterized version of the Steiner tree problem in phylogeny is defined, where the parameter measures the amount by which a phylogeny differs from "perfection." This problem is shown to be solvable in polynomial time for any fixed value of the parameter.
引用
收藏
页码：1115 / 1127
页数：13
相关论文
共 50 条
  • [11] ON NEAR-PERFECT NUMBERS
    Tang, Min
    Ma, Xiaoyan
    Feng, Min
    COLLOQUIUM MATHEMATICUM, 2016, 144 (02) : 157 - 188
  • [12] A POLYNOMIAL-TIME GENERATOR FOR MINIMAL PERFECT HASH FUNCTIONS
    SAGER, TJ
    COMMUNICATIONS OF THE ACM, 1985, 28 (05) : 523 - 532
  • [13] A 'Near-Perfect Gift'
    Kinder, RM
    SOUTHERN HUMANITIES REVIEW, 1999, 33 (01): : 64 - 77
  • [14] Near-perfect pitch
    Ackman, D
    FORBES, 2004, 173 (13): : 184 - 184
  • [15] Near-perfect model
    Miller, Richard
    NEW SCIENTIST, 2007, 196 (2630) : 24 - 24
  • [16] Near-perfect 'black'
    Ball, Philip
    NATURE, 2008, 453 (7197) : 834 - 834
  • [17] NEAR-PERFECT MATRICES
    SHEPHERD, FB
    MATHEMATICAL PROGRAMMING, 1994, 64 (03) : 295 - 323
  • [18] Near-perfect 'black'
    Philip Ball
    Nature, 2008, 453 : 834 - 834
  • [19] On near-perfect numbers
    Cohen, Peter
    Cordwell, Katherine
    Epstein, Alyssa
    Kwan, Chung-Hang
    Lott, Adam
    Miller, Steven J.
    ACTA ARITHMETICA, 2020, 194 (04) : 341 - 366
  • [20] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
    Joshua A. Grochow
    Theory of Computing Systems, 2023, 67 : 627 - 669
12345