A bit-string longest-common-subsequence algorithm (Q1996891): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(86)90091-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1994790623
@@ Property / OpenAlex ID: W1994790623 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+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 @@
+A longest common subsequence algorithm suitable for similar text strings
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4509227
@@ Property / cites work: Q4509227 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Theory and Computation of Evolutionary Distances
+Normal rank
@@ Property / cites work @@
+The theory and computation of evolutionary distances: Pattern recognition
+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 @@
+General methods of sequence comparison
@@ Property / cites work: General methods of sequence comparison / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the String Editing Problem
@@ Property / cites work: Bounds for the String Editing Problem / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/ipl/AllisonD86
@@ Property / DBLP publication ID: journals/ipl/AllisonD86 / rank @@
+Normal rank