Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537): Difference between revisions

@@ Property / cites work @@
+Faster Algorithms for Computing Longest Common Increasing Subsequences
+Normal rank
@@ Property / cites work @@
+Fast computation of a longest increasing subsequence and application
+Normal rank
@@ Property / cites work @@
+Algorithms for subsequence combinatorics
@@ Property / cites work: Algorithms for subsequence combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms
+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 @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank