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 条
12345