An efficient algorithm for the all pairs suffix-prefix problem (Q1190509): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel construction of a suffix tree with applications
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+A Space-Economical Suffix Tree Construction Algorithm
+Normal rank
@@ Property / cites work @@
+A greedy approximation algorithm for constructing shortest common superstrings
+Normal rank
@@ Property / cites work @@
+Q4010349
@@ Property / cites work: Q4010349 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the shortest common superstring problem
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding approximate shortest common superstrings
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90176-v
+Normal rank
@@ Property / OpenAlex ID @@
+W2063556310
@@ Property / OpenAlex ID: W2063556310 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126551376
@@ Property / Wikidata QID: Q126551376 / rank @@
+Normal rank