Finding the longest common nonsuperstring in linear time (Q989576): 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.ipl.2009.06.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2017496585
@@ Property / OpenAlex ID: W2017496585 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Shortest consistent superstrings computable in polynomial time
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+String Noninclusion Optimization Problems
@@ Property / cites work: String Noninclusion Optimization Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Data compression via textual substitution
@@ Property / cites work: Data compression via textual substitution / rank @@
+Normal rank
@@ Property / cites work @@
+On-line construction of suffix trees
@@ Property / cites work: On-line construction of suffix trees / rank @@
+Normal rank