Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Bringmann, K., Gawrychowski, P., Mozes, S., & Weimann, O. (2020). Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). ACM Transactions on Algorithms, 16(4): 48. doi:10.1145/3381878.