A Dynamic Programming A* Algorithm for Computing Unordered Tree Edit Distance

In this paper, we improve the A* algorithm for computing the edit distance between rooted labeled unordered trees designed by Higuchi et al. (2012) by using the dynamic programming technique, which we call the dynamic programming A* algorithm. Then, we give experimental results for glycan data by comparing the dynamic programming A* algorithm with the original A* algorithm, the exhaustive search algorithm and the clique-based algorithm.