Agreement Subtrees

Abstract

The following problem has its origin in systematic and computational biology: Given a collection of trees, each having the same set of leaf labels, produce an "agreement subtree" of the collection that displays the common branching information of the entire collection. How should this be done? How efficiently can this subtree be constructed? A brief history of this problem is given, and a new result presented.