Hi Ziad,
Hmm... not right now.
Would you like me to put this back in? I guess the way it would work is that you would specify a multifurcating tree, and any internal branch imposes a constraint.
Are you thinking that it would make the program faster?
-BenRI
--
You received this message because you are subscribed to the Google Groups "bali-phy-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bali-phy-user...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/bali-phy-users/0c741c97-3088-4cfb-ae72-eb88c631c686n%40googlegroups.com.
Hi Ziad,
I thought of a way to implement this that is relatively CPU
efficient. Basically, each constraint can correspond to a virtual
binary character, and we can then constrain the parsimony score to
be <= 1 for each virtual character.
What do you think?
-BenRI