An all-substrings common subsequence algorithm (Q2482100): Difference between revisions

@@ 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.dam.2007.05.056
+Normal rank
@@ Property / OpenAlex ID @@
+W2095950337
@@ Property / OpenAlex ID: W2095950337 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3439674
@@ Property / cites work: Q3439674 / rank @@
+Normal rank
@@ Property / cites work @@
+The longest common subsequence problem revisited
@@ Property / cites work: The longest common subsequence problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+On the Common Substring Alignment Problem
@@ Property / cites work: On the Common Substring Alignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On a cyclic string-to-string correction problem
@@ Property / cites work: On a cyclic string-to-string correction problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526776
@@ Property / cites work: Q4526776 / rank @@
+Normal rank
@@ Property / cites work @@
+All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
+Normal rank