Maximal Common Subsequence Algorithms (Q5140762): Difference between revisions

@@ label / en / label / en @@
+Maximal Common Subsequence Algorithms
@@ Property / cites work @@
+On the generalized constrained longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Maximal common subsequences and minimal common supersequences
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+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
@@ Property / cites work @@
+Log-logarithmic worst-case range queries are possible in space theta(N)
+Normal rank
@@ Property / full work available at URL @@
+http://drops.dagstuhl.de/opus/volltexte/2018/8707/
+Normal rank
@@ Property / OpenAlex ID @@
+W2807021032
@@ Property / OpenAlex ID: W2807021032 / rank @@
+Normal rank
@@ Property / title @@
+Maximal Common Subsequence Algorithms (English)
@@ Property / title: Maximal Common Subsequence Algorithms (English) / rank @@
+Normal rank