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

@@ Property / describes a project that uses @@
+GtEncseq
@@ Property / describes a project that uses: GtEncseq / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Readjoiner
@@ Property / describes a project that uses: Readjoiner / 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/j.jda.2016.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2345086198
@@ Property / OpenAlex ID: W2345086198 / rank @@
+Normal rank
@@ Property / cites work @@
+Replacing suffix trees with enhanced suffix arrays
+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 @@
+An efficient algorithm for the all pairs suffix-prefix problem
+Normal rank
@@ Property / cites work @@
+Q4547749
@@ Property / cites work: Q4547749 / rank @@
+Normal rank
@@ Property / cites work @@
+External Memory Generalized Suffix and LCP Arrays Construction
+Normal rank
@@ Property / cites work @@
+Suffix Arrays: A New Method for On-Line String Searches
+Normal rank
@@ Property / cites work @@
+Q5397902
@@ Property / cites work: Q5397902 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
+Normal rank
@@ Property / cites work @@
+Compressed suffix trees with full functionality
@@ Property / cites work: Compressed suffix trees with full functionality / rank @@
+Normal rank
@@ Property / cites work @@
+Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
+Normal rank