Replies: 2 comments 3 replies
-
|
Thanks for the suggestion – this is an interesting idea. The problem I would anticipate is that the collapsed nodes may not be the only ones whose interpretation differs between trees: trees that reconstruct node A as |
Beta Was this translation helpful? Give feedback.
-
|
I've had a first pass at implementing this. I've not had time to test it extensively, but perhaps you could see whether it works as you expect on your own datasets?
This should also work in the |
Beta Was this translation helpful? Give feedback.
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 Professor Smith,
I'm trying to reconstruct ancestral states using
TreeSearch::PlotCharacter()for a strict consensus of trees generated by TreeSearch. However,TreeSearch::PlotCharacterdoesn't seem to be able to reconstruct ancestral states well for a multifurcating tree; it appears to terminate without problems, but some of the reconstructed ancestral states look odd. I understand this is why Smith et al. (2024) used an arbitrarily selected most parsimonious tree for the ancestral state reconstruction.So I have a suggestion. For each internal node in a strict consensus tree, we could examine how all most parsimonious trees reconstruct its state and then map them onto the strict consensus tree. For example, for a given node, if all most parsimonious trees reconstruct its state as
-, we could map-to the node. Conversely, for another node, if some most parsimonious trees reconstruct its state as-while others reconstruct it as1, we could map?to the node.I believe this feature would facilitate the interpretation of ancestral states. I would greatly appreciate it if you could consider implementing it in TreeSearch.
Beta Was this translation helpful? Give feedback.
All reactions