We give an algorithm for finding the set of all rooted trees with labelled leaves having subtrees homeomorphic to each of a given set of rooted trees with labelled leaves. This type of problem arises in the study of evolutionary trees.
|Number of pages||13|
|Journal||Discrete Applied Mathematics|
|Publication status||Published - 13 Aug 1996|