Most supertree methods use just leaf-labelled phylogenetic trees to infer the resulting supertree. In this paper, we describe several new supertree algorithms that extend the allowable information that can be used for phylogenetic inference. These algorithms have been recently implemented and we describe here two illustrative applications.