|
|||||
|
|
On agreement forests |
|
| Authors: | Yang Ding Stefan Grünewald Peter J Humphries |
| Institution: | a School of Mathematics and Statistics, Wuhan University, Wuhan, China b Department of Biology, Boston College, USA c CAS-MPG Partner Institute for Computational Biology, Shanghai Institutes for Biological Sciences, Chinese Academy of Sciences, Shanghai, China d Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany e Department of Mathematics and Statistics, University of Canterbury, New Zealand |
| Abstract: | Tree rearrangement operations are widely used to measure the dissimilarity between phylogenetic trees with identical leaf sets. The tree bisection and reconnection (tbr) distance for unrooted trees can be equivalently defined in terms of agreement forests. For both the tbr distance and the less general subtree prune and regraft (spr) distance, we use such forests to derive new upper and lower bounds on the maximal possible distance between two trees with n leaves. |
| Keywords: | Agreement forest Tree rearrangement TBR SPR Phylogenetic tree |
| 本文献已被 ScienceDirect 等数据库收录！ | |