For a given triplet of host tree H, associate tree P, and known associations _, there may be many solutions. The computational complexity is known to be high, and is inversely related (loosely speaking) with the number of cospeciations which could have occured. There is also the added complexity of the order of host switches, since each induces a partial ordering on the host tree, and some of these may be in conflict.
