You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Find the most parsimonious labeling of the internal nodes of a rooted tree.
I have observed that the test never fails on the score: it is always one of the labels. Could it be the case that there is more than one most parsimonious labeling? I will comment out the tests of each label in the meantime.
There is a call to randrange in SmallParsimony (phylogeny.py). Initially the test passed, but it sometimes fails now.
The text was updated successfully, but these errors were encountered: