An \(O(ND)\) difference algorithm and its variations (Q1099955): Difference between revisions

@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+An information-theoretic lower bound for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+A longest common subsequence algorithm suitable for similar text strings
+Normal rank
@@ Property / cites work @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank