Distorted Metrics on Trees and Phylogenetic Forests
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Alignment-Free phylogenetic reconstruction
RECOMB'10 Proceedings of the 14th 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 |
In this paper we study inverting random functions under the maximum likelihood estimation (MLE) criterion in the discrete setting. In particular, we consider how many independent evaluations of the random function at a particular element of the domain are needed for reliable reconstruction of that element. We provide explicit upper and lower bounds for MLE, both in the nonparametric and parametric setting, and give applications to coin-tossing and phylogenetic tree reconstruction.