z-logo
open-access-imgOpen Access
A Bias in ML Estimates of Branch Lengths in the Presence of Multiple Signals
Author(s) -
David Penny,
W. Timothy J. White,
Michael D. Hendy,
Matthew J. Phillips
Publication year - 2007
Publication title -
molecular biology and evolution
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.637
H-Index - 218
eISSN - 1537-1719
pISSN - 0737-4038
DOI - 10.1093/molbev/msm263
Subject(s) - tree (set theory) , biology , maximum likelihood , enhanced data rates for gsm evolution , bayesian network , bayesian probability , minimum description length , sequence (biology) , algorithm , statistics , computer science , pattern recognition (psychology) , mathematics , artificial intelligence , combinatorics , genetics
Sequence data often have competing signals that are detected by network programs or Lento plots. Such data can be formed by generating sequences on more than one tree, and combining the results, a mixture model. We report that with such mixture models, the estimates of edge (branch) lengths from maximum likelihood (ML) methods that assume a single tree are biased. Based on the observed number of competing signals in real data, such a bias of ML is expected to occur frequently. Because network methods can recover competing signals more accurately, there is a need for ML methods allowing a network. A fundamental problem is that mixture models can have more parameters than can be recovered from the data, so that some mixtures are not, in principle, identifiable. We recommend that network programs be incorporated into best practice analysis, along with ML and Bayesian trees.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom