论文信息 - The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance

The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance

We show that computation of the subtree prune and regraft (SPR) distance between unrooted binary phylogenetic trees is NP-Hard and fixed parameter tractable. Similar results exist for the related tree bisection and reconnection (TBR) distance, as well as the SPR distance between rooted trees but the complexity of the unrooted SPR case has heretofore remained unknown.

Frank Dehne | Andrew Rau-Chaplin | Glenn Hickey | Christian Blouin

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] L. Orgel,et al. Phylogenetic Classification and the Universal Tree , 1999 .

[3] M. Steel,et al. Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .

[4] Charles Semple,et al. On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance , 2005 .

[5] Nicholas Hamilton,et al. Phylogenetic identification of lateral genetic transfer events , 2006, BMC Evolutionary Biology.

[6] Doolittle Wf. Phylogenetic Classification and the Universal Tree , 1999 .

[7] 室章治郎. Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[8] Tao Jiang,et al. On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..