$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance — mentioned by belter

Fri, 16 Sep 2022 15:31:39 GMT

"...Computing the edit distance of two strings is one of the most basic problems in computer science and combinatorial optimization. Tree edit distance is a natural generalization of edit distance in which the task is to compute a measure of dissimilarity between two (unweighted) rooted trees with node labels... ...Perhaps the most notable recent application of tree edit distance is in NoSQL big databases, such as MongoDB, where each row of the database is a JSON document represented as a labeled rooted tree, and finding dissimilarity between two rows is a basic operation... ...Until…

Paper and discussion history. A mention is not an endorsement.

$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance — HN submission

Fri, 16 Sep 2022 15:31:38 GMT

O˜(N and Poly(k))-Time Algorithm for Bounded Tree Edit Distance

2 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.

$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance · HackerPapers discussions

$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance — mentioned by belter

$\tilde{O}(n+\mathrm{poly}(k))$-time Algorithm for Bounded Tree Edit Distance — HN submission