Accessing the suffix array via \(\phi^{-1}\)-forest (Q6166975): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-20643-6_7
+Normal rank
@@ Property / OpenAlex ID @@
+W4312335429
@@ Property / OpenAlex ID: W4312335429 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster repetition-aware compressed suffix trees based on block trees
+Normal rank
@@ Property / cites work @@
+Q6098784
@@ Property / cites work: Q6098784 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4607985
@@ Property / cites work: Q4607985 / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
+Normal rank
@@ Property / cites work @@
+Permuted Longest-Common-Prefix Array
@@ Property / cites work: Permuted Longest-Common-Prefix Array / rank @@
+Normal rank
@@ Property / cites work @@
+Suffix Arrays: A New Method for On-Line String Searches
+Normal rank
@@ Property / cites work @@
+Q6098794
@@ Property / cites work: Q6098794 / rank @@
+Normal rank