Efficient algorithms for finding interleaving relationship between sequences (Q2380070): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.08.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2144662852
@@ Property / OpenAlex ID: W2144662852 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+Sparse Dynamic Programming for Longest Common Subsequence from Fragments
+Normal rank
@@ Property / cites work @@
+A simple algorithm for the constrained sequence problems
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+Dynamic programming algorithms for the mosaic longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse LCS common substring alignment
@@ Property / cites work: Sparse LCS common substring alignment / rank @@
+Normal rank
@@ Property / cites work @@
+On the Common Substring Alignment Problem
@@ Property / cites work: On the Common Substring Alignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank