Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635): Difference between revisions

@@ 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 @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
+Normal rank
@@ Property / cites work @@
+Fast computation of a longest increasing subsequence and application
+Normal rank
@@ Property / cites work @@
+The longest almost-increasing subsequence
@@ Property / cites work: The longest almost-increasing subsequence / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+A new efficient algorithm for computing the longest common subsequence
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing a longest common increasing subsequence
+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