1 research outputs found
Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
This paper addresses the problem of finding a representation of a subtree
distance, which is an extension of the tree metric. We show that a minimal
representation is uniquely determined by a given subtree distance, and give a
linear time algorithm that finds such a representation. This algorithm achieves
the optimal time complexity