Refining phylogenetic trees given additional data: An algorithm based on parsimony

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

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
UEA Research Groups:	Faculty of Science > Research Groups > Computational Biology > Computational biology of RNA (former - to 2018) Faculty of Science > Research Groups > Computational Biology > Phylogenetics (former - to 2018) Faculty of Science > Research Groups > Computational Biology Faculty of Science > Research Groups > Norwich Epidemiology Centre Faculty of Medicine and Health Sciences > Research Groups > Norwich Epidemiology Centre Faculty of Science > Research Centres > Centre for Ecology, Evolution and Conservation
Depositing User:	Vishal Gautam
Date Deposited:	07 Mar 2011 13:31
Last Modified:	09 Oct 2024 13:31
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22429
DOI:	10.1109/TCBB.2008.100

Actions (login required)

View Item