New dissimilarity measure for recognizing noisy subsequence trees (Q2997938): 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.1002/int.20478
@@ Property / full work available at URL: https://doi.org/10.1002/int.20478 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2065491606
@@ Property / OpenAlex ID: W2065491606 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+A survey on tree edit distance and related problems
+Normal rank
@@ Property / cites work @@
+Ordered and Unordered Tree Inclusion
@@ Property / cites work: Ordered and Unordered Tree Inclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252025
@@ Property / cites work: Q4252025 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for the unit cost editing distance between trees
+Normal rank
@@ Property / cites work @@
+Q5585021
@@ Property / cites work: Q5585021 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+A graph distance metric based on the maximal common subgraph
+Normal rank
@@ Property / cites work @@
+On the editing distance between unordered labeled trees
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2997938