New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774): Difference between revisions

@@ Property / arXiv ID @@
+.2217
@@ Property / arXiv ID: 1312.2217 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast and compact regular expression matching
@@ Property / cites work: Fast and compact regular expression matching / rank @@
+Normal rank
@@ Property / cites work @@
+A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
+Normal rank
@@ Property / cites work @@
+Speeding up transposition-invariant string matching
+Normal rank
@@ Property / cites work @@
+BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
+Normal rank
@@ Property / cites work @@
+Sparse dynamic programming I
@@ Property / cites work: Sparse dynamic programming I / rank @@
+Normal rank
@@ Property / cites work @@
+An information-theoretic lower bound for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding interleaving relationship between sequences
+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 @@
+Transposition invariant string matching
@@ Property / cites work: Transposition invariant string matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q5293986
@@ Property / cites work: Q5293986 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the String Editing Problem
@@ Property / cites work: Bounds for the String Editing Problem / rank @@
+Normal rank