Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
From MaRDI portal
Publication:4785702
DOI10.1137/S089548010138790XzbMath1055.62522OpenAlexW2170920620MaRDI QIDQ4785702
László A. Székely, Mike A. Steel
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s089548010138790x
Related Items
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges, Phylogenetic information complexity: is testing a tree easier than finding it?, A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements, Statistics for phylogenetic trees, Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees, Consistency and convergence rate of phylogenetic inference via regularization, Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis, On the inference of large phylogenies with long branches: how long is too long?, A phase transition for a random cluster model on phylogenetic trees., Inverting random functions. III: Discrete MLE revisited, Phase transition in the sample complexity of likelihood-based phylogeny inference, Teasing Apart Two Trees, The impact and interplay of long and short branches on phylogenetic information content, Sequence length bounds for resolving a deep phylogenetic divergence, Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
