A few logs suffice to build (almost) all trees: part II
Theoretical Computer Science
A few logs suffice to build (almost) all trees (l): part I
Random Structures & Algorithms
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Learning nonsingular phylogenies and hidden Markov models
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Maximum likelihood of evolutionary trees is hard
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Maximal accurate forests from distance matrices
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Optimal phylogenetic reconstruction
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast and reliable reconstruction of phylogenetic trees with very short edges
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Distinguishing Markov Random Fields
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Network delay inference from additive metrics
Random Structures & Algorithms
Quartets MaxCut: A Divide and Conquer Quartets Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Alignment-Free phylogenetic reconstruction
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Maximal accurate forests from distance matrices
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
Random Structures & Algorithms
| Hi-index | 0.00 |
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 $\hat{d}$ of d such that, for all leaves u and v, it holds that $|d(u,v) - \hat{d}(u,v)|