Optimizing phylogenetic diversity across two trees

Simple item page
dc.contributor.authorBordewich, M.
dc.contributor.authorSemple, C.
dc.contributor.authorSpillner, A.
dc.date.accessioned2009-08-10T21:30:35Z
dc.date.available2009-08-10T21:30:35Z
dc.date.issued2009en
dc.description.abstractWe present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted sum of the phylogenetic diversity across two phylogenetic trees. This resolves one of the challenges proposed as part of the Phylogenetics Programme held at the Isaac Newton Institute for Mathematical Sciences (Cambridge, 2007). It also completely closes the gap between optimizing phylogenetic diversity on one tree, which is known to be in P, and optimizing phylogenetic diversity across three or more trees, which is known to be NP-hard.en
dc.identifier.citationBordewich, M., Semple, C., Spillner, A. (2009) Optimizing phylogenetic diversity across two trees. Applied Mathematics Letters, 22(5), pp. 638-641.en
dc.identifier.doihttps://doi.org/10.1016/j.aml.2008.05.004
dc.identifier.issn0893-9659
dc.identifier.urihttp://hdl.handle.net/10092/2665
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematics and Statisticsen
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectPhylogenetic diversityen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::230200 Statistics::230204 Applied statisticsen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematicsen
dc.titleOptimizing phylogenetic diversity across two treesen
dc.typeJournal Article
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
12616184_Semple.pdf
Size:
121.89 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Journal Articles