On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance |
| |
Authors: | Magnus Bordewich Charles Semple |
| |
Institution: | (1) School of Computing, University of Leeds, Leeds, LS2 9JT, United Kingdom;(2) Biomathematics Research Centre, Department of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand |
| |
Abstract: | The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004 |
| |
Keywords: | 05C05 92D15 |
本文献已被 SpringerLink 等数据库收录! |
|