Related Experiment Video
Updated: Aug 15, 2026

A Simple Protocol for Mapping the Plant Root System Architecture Traits
Published on: February 10, 2023
Transforming rooted agreement into unrooted agreement
1Department of Biophysics, Johns Hopkins School of Medicine, Baltimore, MD 21205, USA.
Abstract:
We give a simple technique that allows to transform dynamic programming type algorithms for the Maximum Agreement Subtree problem (MAST) for rooted trees into algorithms for the Maximum Agreement Subtree problem for unrooted trees (UMAST). Using this technique we obtain an O (n log n)-time algorithm for the UMAST problem for binary trees. This matches the complexity of the best known algorithm for the rooted case.
Related Concept Videos
Robbers Cave
Water and Mineral Acquisition
Radical Formation: Abstraction
Even though homolysis produces radicals, it is different from radical...
Rationalizing Substitutions
Radicals
Transformations of Functions III

