# Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees

@article{Allen2001SubtreeTO, title={Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees}, author={Benjamin Allen and Mike A. Steel}, journal={Annals of Combinatorics}, year={2001}, volume={5}, pages={1-15} }

Abstract. Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology. In this setting, extant species label the leaves of the tree, while the internal vertices correspond to ancestral species. Various techniques exist for reconstructing these evolutionary trees from data, and an important problem is to determine how "far apart" two such reconstructed trees are from each other, or indeed from the true historical tree. To investigate this question requires…

## 331 Citations

A rearrangement distance for fully-labelled trees

- Computer Science, MathematicsCPM
- 2019

This paper provides a rearrangement distance measure between two fully-labelled trees, and shows that it is fixed-parameter tractable, and gives a 4-approximation algorithm when one of the trees is binary.

Extremal Distances for Subtree Transfer Operations in Binary Trees

- Mathematics, Computer ScienceAnnals of Combinatorics
- 2018

It is shown that for a pair of leaf-labelled binary trees with n leaves, the maximum number of such moves required to transform one into the other is n-Theta (n-Θ(n), extending a result of Ding, Grünewald, and Humphries.

28 : 2 A Rearrangement Distance for Fully-Labelled Trees

- Computer Science, Mathematics
- 2019

This paper provides a rearrangement distance measure between two fully-labelled trees, and shows that it is fixed-parameter tractable, and gives a 4-approximation algorithm when one of the trees is binary.

Computing nearest neighbour interchange distances between ranked phylogenetic trees

- Computer ScienceJournal of mathematical biology
- 2021

This paper provides the first example of a phylogenetic tree rearrangement operation for which shortest paths, and hence the distance, can be computed efficiently and scales to trees with tens of thousands of leaves.

A 3-factor approximation algorithm for a Minimum Acyclic Agreement Forest on k rooted, binary phylogenetic trees

- BiologyArXiv
- 2014

This paper shows that the MAAF for k(>= 2) phylogenetic trees can be approximated to within a factor of 3, and improves this ratio to 3.5.

Reflections on kernelizing and computing unrooted agreement forests

- Computer ScienceAnn. Oper. Res.
- 2022

This work explores the practical impact of kernelization (i.e. data reduction) on the NP-hard problem of computing the TBR distance between two unrooted binary phylogenetic trees and finds that the new rules yield smaller reduced instances and thus have clear practical added value.

SPR Distance Computation for Unrooted Trees

- Computer ScienceEvolutionary bioinformatics online
- 2008

The method is a heuristic version of a fixed parameter tractability (FPT) approach and the running time behaves similar to FPT algorithms, and was able to quickly compute dSPR for the majority of trees that were part of a study of LGT in 144 prokaryotic genomes.

Neighborhoods of Trees in Circular Orderings

- Computer ScienceBulletin of mathematical biology
- 2015

It is shown that the size of such a neighborhood of a binary tree associated with the nni operation is independent of the tree’s topology, but that this is not the case for the spr and tbr operations.

## References

SHOWING 1-10 OF 23 REFERENCES

On the Complexity of Comparing Evolutionary Trees

- Computer ScienceDiscret. Appl. Math.
- 1996

The discovery and importance of multiple islands of most

- Environmental Science
- 1991

The set of most-parsimonious trees for a data matrix may include several distinct classes (islands) of trees, and trees in different islands may have different implications for character evolution, and for this reason should be sought.

Reconstructing evolution of sequences subject to recombination using parsimony.

- BiologyMathematical biosciences
- 1990

An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets.

- MathematicsJournal of theoretical biology
- 1973

Parameterized complexity: A framework for systematically confronting computational intractability

- Computer ScienceContemporary Trends in Discrete Mathematics
- 1997

An improved FPT ker-nelization algorithm for Vertex Cover, a practical FPT algorithm for the Maximum Agreement Subtree problem parameterized by the number of species to be deleted, and new general heuristics for these problems based on FPT techniques are described.

Computers and Intractability: A Guide to the Theory of NP-Completeness

- Computer Science
- 1978

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.