Either my google-fu is lacking or there just isn't a whole lot of need for tree comparison algorithms. I can find lots of information on types of trees, but not on the algorithms to compare.

It is known that the GMST problem belongs to the hard core of NP-hard problems. The aim of this paper is to present an exact exponential time algorithm for the GMST problem as well three efficient ...

Algorithms can have practical applications like increasing efficiency by automating small, repeating details. It can allow graphic design elements to respond to external inputs like sound and motion.