Refining Phylogenetic Trees Given Additional Data: An Algorithm Based on Parsimony

Wu, Taoyang, Moulton, Vincent and Steel, M. (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

Full text not available from this repository. (Request a copy)

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
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 07 Mar 2011 13:31
Last Modified: 21 Apr 2020 17:49
URI: https://ueaeprints.uea.ac.uk/id/eprint/22429
DOI: 10.1109/TCBB.2008.100

Actions (login required)

View Item View Item