This function takes some a tree and places a number of binary characters on the tree, with character states arranged
as if the derived condition was gained once, at a single node, and never lost. This ensures that the resulting simulated
character matrices have no character conflict, supporting a single solution under maximum parsimony.
If nchar
is greater than the number of nodes on the input phylogeny (ignoring the root), then characters are first
placed to evenly cover all nodes, with as many full passes of tree as possible. Any characters in excess are placed at random
nodes, without replacement. In other words, if a tree has 10 nodes (plus the root) and 25 characters are simulated, 20 of those
characters will consist of two 10-character 'full passes' of the tree. The remaining five will be randomly dropped on the tree.
If few characters are simulated than the number of nodes, these are randomly placed on the given topology without replacement,
just as described above.
This function assumes, like almost every function in paleotree, that the tree given is rooted, even if the
most basal node is a polytomy.