BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+A fast and practical bit-vector algorithm for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Speeding up transposition-invariant string matching
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding interleaving relationship between sequences
+Normal rank
@@ Property / cites work @@
+Dynamic programming algorithms for the mosaic longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+The constrained longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank