Bordewich, M.McCartin, C.Semple, C.2016-05-302016-05-3020071172-8531http://hdl.handle.net/10092/12224In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5-approximation. We also give a faster fixed-parameter algorithm for the rooted subtree prune and regraft distance than was previously known.enAll Rights ReservedDiscussion / Working PapersFields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics