Distorted metrics on trees and phylogenetic forests
We study distorted metrics on binary trees in the context of phylogenetic reconstruction. Given a binary tree T on n leaves with a path metric d, consider the pairwise distances {d(u, v)} between leaves. It is well known that these determine the tree and the d length of all edges. Here, we consider distortions (d) over cap of d such that, for all leaves u and v, it holds that vertical bar d(u, v) - (d) over cap (u, v) vertical bar < f/2 if either d(u: v) < M + f/2 or (d) over cap (u, v) < M + f/2, where d satisfies f <= d(e) <= g for all edges e. Given such distortions, we show how to reconstruct in polynomial time a forest T-1,..., T-alpha such that the true tree T may be obtained from that forest by adding alpha - 1 edges and alpha - 1 <= 2(-Omega(M/g))n. Our distorted metric result implies a reconstruction algorithm of phylogenetic forests with a small number of trees from sequences of length logarithmic in the number of species. The reconstruction algorithm is applicable for the general Markov model. Both the distorted metric result and its applications to phylogeny are almost tight.
distortion metric tree phylogenetics forest cfn jukes-cantor