Before revision:  In this paper, we break the cubic barrier by showing an O(n ^ {2.9546}) time algorithm for the unweighted tree edit distance problem.
After revision:  In this paper, we break the cubic barrier by showing an O(n ^ {2.9546}) time algorithm for the unweighted tree edit distance problem.