Comparing the method for creating fast stepwise addition trees from the old PLL library,
I have noticed that the old method ran an algorithm for rearrangement at the end to optimize
parsimony score even further. The new stepwise addition algorithm removed this part. Is there a way to access the parsimony-based rearrangement with the new library?
Hello,
Comparing the method for creating fast stepwise addition trees from the old PLL library, I have noticed that the old method ran an algorithm for rearrangement at the end to optimize parsimony score even further. The new stepwise addition algorithm removed this part. Is there a way to access the parsimony-based rearrangement with the new library?
Thank you for the help! Djordje