scientific article; zbMATH DE number 1302179
An evolutionary tree is an unordered tree with labelled leaves, but unlabelled inner nodes. They may be rooted or not, with edge-lengths or not. Several distance measures between such trees on a fixed leave-set are surveyed, all defined as the minimum number of steps needed to transform one tree into the other, of some basic transformation operation like the interchange of the subtrees rooted in two neighbouring nodes. For each distance calculation is shown to be generally NP-hard, and an approximation scheme with guaranteed optimality ratio is described. For the entire collection see [Zbl 0914.90001].
- A computationally efficient approximation to the nearest neighbor interchange metric
- A robust model for finding optimal evolutionary tree
- Tripartitions do not always discriminate phylogenetic networks
- Computing an evolutionary ordering is hard
- An Evolutionary Distance Based on Maximal Unique Matches
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- scientific article; zbMATH DE number 1541304 (Why is no real title available?)
- A rearrangement distance for fully-labelled trees
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
- scientific article; zbMATH DE number 6277703 (Why is no real title available?)
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
- Some notes on the nearest neighbour interchange distance
- The Bourque distances for mutation trees of cancers
- Statistics for phylogenetic trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247446)