Linear-space algorithms that build local alignments from fragments (Q1902469): Difference between revisions

@@ Property / cites work @@
+Constrained sequence alignment
@@ Property / cites work: Constrained sequence alignment / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse dynamic programming I
@@ Property / cites work: Sparse dynamic programming I / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse dynamic programming II
@@ Property / cites work: Sparse dynamic programming II / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up dynamic programming with applications to molecular biology
+Normal rank
@@ Property / cites work @@
+Dynamic programming with convexity, concavity and sparsity
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+A time-efficient, linar-space local similarity algorithm
+Normal rank
@@ Property / cites work @@
+Sequence comparison with concave weighting functions
+Normal rank
@@ Property / cites work @@
+An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm
+Normal rank
@@ Property / cites work @@
+Pattern recognition in genetic sequences by mismatch density
+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 @@
+The Context Dependent Comparison of Biological Sequences
+Normal rank