Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance-Reference-Cited by-同舟云学术

Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Mao Xiao¹

Affiliation:

1. Massachusetts Institute of Technology,Department of Electrical Engineering and Computer Science,Cambridge,USA

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719831.pdf?arnumber=9719831

Reference32 articles.

1. $1+\varepsilon$ approximation of tree edit distance in quadratic time;boroujeni;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC),0

2. A data structure for dynamic trees

3. Geometric applications of a matrix searching algorithm

4. A tree-edit-distance algorithm for comparing simple, closed shapes;klein;Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),0

5. Shape matching using edit-distance: an implementation;klein;Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA),0

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted Edit Distance Computation: Strings, Trees, and Dyck;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Improved bounds for rectangular monotone Min-Plus Product and applications;Information Processing Letters;2023-03

3. Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Faster min-plus product for monotone instances;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. On the Hardness of Computing the Edit Distance of Shallow Trees;String Processing and Information Retrieval;2022