Faster algorithms for computing longest common increasing subsequences (Q655431): 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.1016/j.jda.2011.03.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2131441444
@@ Property / OpenAlex ID: W2131441444 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
+Normal rank
@@ Property / cites work @@
+Enumerating longest increasing subsequences and patience sorting
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding a longest common increasing subsequence
+Normal rank
@@ Property / cites work @@
+On computing the length of longest increasing subsequences
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing a longest common increasing subsequence
+Normal rank
@@ Property / cites work @@
+Design and implementation of an efficient priority queue
+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 / cites work @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank