Searching subsequences (Q2638800): Difference between revisions

@@ Property / describes a project that uses @@
+PATRICIA
@@ Property / describes a project that uses: PATRICIA / rank @@
+Normal rank
@@ 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/0304-3975(91)90358-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2914364168
@@ Property / OpenAlex ID: W2914364168 / 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 @@
+On the computational power of pushdown automata
@@ Property / cites work: On the computational power of pushdown automata / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+The smallest automaton recognizing the subwords of a text
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Calcul de la distance par les sous-mots
@@ Property / cites work: Calcul de la distance par les sous-mots / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a longest common subsequence for a set of strings
+Normal rank
@@ Property / cites work @@
+An information-theoretic lower bound for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing longest common subsequences
+Normal rank
@@ Property / cites work @@
+The string merging problem
@@ Property / cites work: The string merging problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank