Phylogenetic diversity and the greedy algorithm
| dc.contributor.author | Steel, M. A. | |
| dc.date.accessioned | 2016-07-28T21:39:31Z | |
| dc.date.available | 2016-07-28T21:39:31Z | |
| dc.date.issued | 2004 | en |
| dc.description.abstract | Given a phylogenetic tree with leaves labelled by a collection of species, and with weighted edges, the 'phylogenetic diversity' of any subset of the species is the sum of the edge weights of the minimal subtree connecting the species. This measure is relevant in biodiversity conservation where one may wish to compare different subsets of species according to how much evolutionary variation they encompass. In this note we show that phylogenetic diversity has an attractive mathematical property that ensures that we can solve the following problem easily by the greedy algorithm: find a subset of the species of any given size k of maximal phylogenetic diversity. We also describe an extension of this result that also allows weights to be assigned to species. | en |
| dc.identifier.issn | 1172-8531 | |
| dc.identifier.uri | http://hdl.handle.net/10092/12532 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury | en |
| dc.rights | All Rights Reserved | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | |
| dc.subject.anzsrc | Fields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics | en |
| dc.title | Phylogenetic diversity and the greedy algorithm | en |
| dc.type | Discussion / Working Papers | |
| uc.college | Faculty of Engineering | |
| uc.department | School of Engineering | en |