Wu, Taoyang ORCID: https://orcid.org/0000-0002-2663-2001, Moulton, Vincent
ORCID: https://orcid.org/0000-0001-9371-6435 and Steel, Mike
(2009)
Refining phylogenetic trees given additional data: An algorithm based on parsimony.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6 (1).
pp. 118-125.
ISSN 1545-5963
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.
Item Type: | Article |
---|---|
Faculty \ School: | Faculty of Science > School of Computing Sciences |
Depositing User: | Vishal Gautam |
Date Deposited: | 07 Mar 2011 13:31 |
Last Modified: | 16 Jan 2023 10:30 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/22429 |
DOI: | 10.1109/TCBB.2008.100 |
Actions (login required)
![]() |
View Item |