A fast algorithm for the longest-common-subsequence problem (Q1155365): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/0020-0255(80)90025-0
-Normal rank
@@ Property / OpenAlex ID @@
-W2026097868
@@ Property / OpenAlex ID: W2026097868 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0255(80)90025-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2026097868
@@ Property / OpenAlex ID: W2026097868 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+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 @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+PASCAL. User manual and report. Corr. reprint of the 2nd ed
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Spelling correction in systems programs
@@ Property / cites work: Spelling correction in systems programs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching Sequences under Deletion/Insertion Constraints
+Normal rank
@@ Property / cites work @@
+An algorithm for the distance between two finite sequences
+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