A linear space algorithm for computing a longest common increasing subsequence (Q845723): Difference between revisions

@@ Property / describes a project that uses @@
+MUMMER
@@ Property / describes a project that uses: MUMMER / rank @@
+Normal rank
@@ 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.ipl.2006.05.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1983269319
@@ Property / OpenAlex ID: W1983269319 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for computing longest common increasing subsequences
+Normal rank
@@ Property / cites work @@
+Enumerating longest increasing subsequences and patience sorting
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+An almost-linear time and linear space algorithm for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+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 @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:845723