Abstract
Galled trees are a class of tree-like phylogenetic networks in which the loops are not overlapping with each other. They are popularly used among biologists to represent the evolutionary history between a set of species. In this paper, we propose a compact encoding for the structure of a galled tree, and show that with our encoding, the tree containment problem on a galled tree can be solved in optimal time.