Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365): Difference between revisions

@@ Property / cites work @@
+On the sorting-complexity of suffix tree construction
+Normal rank
@@ Property / cites work @@
+Indexing compressed text
@@ Property / cites work: Indexing compressed text / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+A space and time efficient algorithm for constructing compressed suffix arrays
+Normal rank
@@ Property / cites work @@
+Linear work suffix array construction
@@ Property / cites work: Linear work suffix array construction / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing suffix arrays in linear time
@@ Property / cites work: Constructing suffix arrays in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Space efficient linear time construction of suffix arrays
+Normal rank
@@ Property / cites work @@
+Q4808661
@@ Property / cites work: Q4808661 / rank @@
+Normal rank
@@ Property / cites work @@
+Suffix Arrays: A New Method for On-Line String Searches
+Normal rank
@@ Property / cites work @@
+New text indexing functionalities of the compressed suffix arrays
+Normal rank