A simple algorithm for the constrained sequence problems (Q2390246): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1974063126
@@ Property / OpenAlex ID: W1974063126 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02919
@@ Property / arXiv ID: 2103.02919 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+The constrained longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2390246