Efficient algorithms for finding a longest common increasing subsequence (Q996830): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-9031-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2078864816
@@ Property / OpenAlex ID: W2078864816 / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating longest increasing subsequences and patience sorting
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Computing Longest Common Increasing Subsequences
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+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 @@
+Longest Increasing and Decreasing Subsequences
@@ Property / cites work: Longest Increasing and Decreasing Subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Adding range restriction capability to dynamic data structures
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank