Counting tanglegrams with species

A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams (unordered and unrooted tanglegrams). We use the theory of combinatorial species to solve these problems.