No abstract

Abstract-In this paper, we formulate an anchored alignment distance between rooted labeled unordered trees as the minimum cost of the anchored alignment whose anchoring is constructed from the minimum cost isolated-subtree mapping by adding the pairs of non-mapped leaves, and design the algorithm to compute it. Since this algorithm runs in exponential time with respect to the number of leaves in theoretical, we give experimental results for randomly generated trees and for N-glycan data with small degree as real data to evaluate the anchored alignment distance by comparing with the isolated-subtree distance and the alignment distance.