Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 19-31 |
| Number of pages | 13 |
| Journal | Discrete Applied Mathematics |
| Volume | 69 |
| Issue number | 1-2 |
| Publication status | Published - 13 Aug 1996 |
| Externally published | Yes |