A faster algorithm computing string edit distances (Q1140994): 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/0022-0000(80)90002-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2012010763
@@ Property / OpenAlex ID: W2012010763 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q55891303
@@ Property / Wikidata QID: Q55891303 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+An Extension of the String-to-String Correction Problem
+Normal rank
@@ Property / cites work @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the String Editing Problem
@@ Property / cites work: Bounds for the String Editing Problem / rank @@
+Normal rank