Location of Repository

A 3-approximation algorithm for the subtree between phylogenies

By M. Bordewich, C. McCartin and C. Semple

Abstract

In 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

Topics: Field of Research::01 - Mathematical Sciences::0102 - Applied Mathematics::010202 - Biological Mathematics
Publisher: University of Canterbury
Year: 2007
OAI identifier: oai:ir.canterbury.ac.nz:10092/12224
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://library.canterbury.ac.n... (external link)
  • http://hdl.handle.net/10092/12... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.