The complexity of inferring a minimally resolved phylogenetic supertree
A recursive algorithm by Aho et al. [SIAM J. Comput., 10 (1981), pp. 405-421] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by Bryant [Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis, Ph.D. thesis, University of Canterbury, Christchurch, New Zealand, 1997], the tree output by the algorith
