An Exact Quadratic Algorithm for the Shortest Tree Transformation

Abstract

The article proposes a new exact algorithm of quadratic complexity that solves the problem of the shortest transformation (“alignment”) of one weighted tree into another, taking into account arbitrary costs of operations on trees. Three operations are considered: adding vertex deletions to an edge or root of a tree and shifting a subtree with deletions.