Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2023.01.003
+Normal rank
@@ Property / OpenAlex ID @@
+W4320477283
@@ Property / OpenAlex ID: W4320477283 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607965
@@ Property / cites work: Q4607965 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal decomposition algorithm for tree edit distance
+Normal rank
@@ Property / cites work @@
+A Full and Linear Index of a Tree for Tree Patterns
+Normal rank
@@ Property / cites work @@
+The tree-to-tree editing problem
@@ Property / cites work: The tree-to-tree editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Tree-to-Tree Correction Problem
@@ Property / cites work: The Tree-to-Tree Correction Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the editing distance between unordered labeled trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2689648