Replies: 1 comment 9 replies
-
|
If by 'iteration' you mean 'sampled most parsimonious tree', then this approach is invalid for the same reason that it is invalid to compute a majority rule consensus from a set of MPTs, i.e. the frequency of a split's occurrence is not related to its support. But perhaps I misunderstood your proposal? |
Beta Was this translation helpful? Give feedback.
9 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
-
Dear @ms609,
I'm thinking about support values derived from the resampling results of TreeSearch. To obtain the support values for an optimal tree in TreeSearch, I calculate the strict consensus of most parsimonious trees (MPTs) obtained in each jackknife iteration and apply the strict consensus trees to the optimal tree, using
TreeSearch::JackLabels()orTreeSearch::PresCont(). This approach seems to be also used, for example, in TNT.However, my concern on this approach is that strict consensus trees which are unresolved with respect to a certain split may underestimate (?) the support value for the split. For example, consider the case in which we have a total of 100 strict consensus trees derived from a jackknife resampling. Among them, 10 support a certain split and 90 are unresolved with respect to the split. In this case,
JackLabels(), for example, computes the support value for the split as 10%, despite that the majority of the trees that are unresolved with respect to the split likely doesn't decisively deny the split.As such, I've come up a new approach for this that results in probably more informative and higher support values. However, I'm not sure whether the approach or something similar to that has been proposed or implemented somewhere (I'm not familiar with the theories and circumstances in this area).
My approach is the following:
My questions are the following:
If you think my approach would be valuable, I would greatly appreciate it if you could consider implementing it in TreeSearch.
Thank you very much for your time and support.
Beta Was this translation helpful? Give feedback.
All reactions