Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications

DOI10.1137/S089548010138790XzbMATH Open1055.62522OpenAlexW2170920620MaRDI QIDQ4785702FDOQ4785702

Authors: László A. Székely, Mike 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

Recommendations

• Inverting random functions. III: Discrete MLE revisited
• Inverting random functions
• scientific article; zbMATH DE number 3872480
• Maximum likelihood estimation for discrete exponential families and random graphs
• Efficient algorithms for inverting evolution

zbMATH Keywords

maximum likelihood estimationKullback-Leibler distancerandom functionphylogeny reconstruction

Mathematics Subject Classification ID

Parametric inference (62F99) Problems related to evolution (92D15) Nonparametric inference (62G99)

Cited In (16)

• The impact and interplay of long and short branches on phylogenetic information content
• A phase transition for a random cluster model on phylogenetic trees.
• Consistency and convergence rate of phylogenetic inference via regularization
• Phylogenetic information complexity: is testing a tree easier than finding it?
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Teasing Apart Two Trees
• Statistics for phylogenetic trees
• Title not available (Why is that?)
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
• Sequence length bounds for resolving a deep phylogenetic divergence
• On the inference of large phylogenies with long branches: how long is too long?
• Phase transition in the sample complexity of likelihood-based phylogeny inference
• Inverting random functions. III: Discrete MLE revisited

This page was built for publication: Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785702)