New and Improved Algorithms for Unordered Tree Inclusion

Tatsuya Akutsu, Jesper Jansson, Ruiming Li +2

The tree inclusion problem is, given two node-labeled trees $P$ and $T$ (the ``pattern tree'' and the ``target tree''), to locate every minimal subtree in $T$ (if any) that can be…