Name
Abstract | ||
|---|---|---|
Given a set X of taxa, a phylogenetic X-tree T that is only partially resolved, and a collection of characters on X, we consider the problem of finding a resolution (refinement) of T that minimizes the parsimony score of the given characters. Previous work has shown that this problem has a polynomial time solution provided certain strong constraints are imposed on the input. In this paper we provide a new algorithm for this problem, and show that it is fixed parameter tractable under more general conditions. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TCBB.2008.100 | IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) |
Keywords | Field | DocType |
combinatorial algorithms,life and medical sciences | Maximum parsimony,Combinatorics,Phylogenetic tree,Polynomial,Combinatorial algorithms,Algorithm,Sorting,Bioinformatics,Time complexity,Phylogenetics,Mathematics | Journal |
Volume | Issue | ISSN |
6 | 1 | 1545-5963 |
Citations | PageRank | References |
1 | 0.36 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taoyang Wu | 1 | 74 | 13.24 |
| Vincent Moulton | 2 | 39 | 7.46 |
| Mike Steel | 3 | 270 | 41.87 |