Bordewich, M. and Semple, C. (2007) 'Computing the hybridisation number of two phylogenetic trees is fixed parameter tractable.', Transactions on computational biology and bioinformatics., 4 (3). pp. 458-466.
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 the problem is fixed-parameter tractable in the two-tree instance, when parameterized by this smallest number of reticulation vertices.
|Keywords:||Rooted phylogenetic tree, Reticulate evolution, Hybridization network, Agreement forest, Subtree prune and regraft.|
|Full text:||(VoR) Version of Record|
Download PDF (718Kb)
|Publisher Web site:||http://dx.doi.org/10.1109/tcbb.2007.1019|
|Publisher statement:||©2007 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Record Created:||05 Jan 2010 09:50|
|Last Modified:||06 Dec 2011 16:28|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Look up in GoogleScholar | Find in a UK Library|