Computing the hybridization number is fixed-parameter tractable
| dc.contributor.author | Semple, Charles | |
| dc.contributor.author | Bordewich, Magnus | |
| dc.date.accessioned | 2016-04-04T21:07:55Z | |
| dc.date.available | 2016-04-04T21:07:55Z | |
| dc.date.issued | 2006 | en |
| dc.description.abstract | Reticulation processes in evolution mean that the ancestral history of certain groups of present-day species is non-tree-like. These processes include hybridization, lateral gene transfer, and recombination. Despite the existence of reticulation, such events are relatively rare and so a fundamental problem for biologists is the following: given a collection of rooted binary phylogenetic trees on sets of species that correctly represent the tree-like evolution of different parts of their genomes, what is the smallest number of "reticulation" vertices in any network that explains the evolution of the species under consideration. It has been previously shown that this problem is NP-hard even when the collection consists of only two rooted binary phylogenetic trees; however, in this paper, we show that it is fixed-parameter tractable. | en |
| dc.identifier.issn | 1172-8531 | |
| dc.identifier.uri | http://hdl.handle.net/10092/11964 | |
| 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 | Computing the hybridization number is fixed-parameter tractable | en |
| dc.type | Discussion / Working Papers | |
| uc.college | Faculty of Engineering | |
| uc.department | School of Engineering | en |