On the number of elements to reorder when updating a suffix array (Q414460): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2011.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2027441741
@@ Property / OpenAlex ID: W2027441741 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q125075052
@@ Property / Wikidata QID: Q125075052 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5485338
@@ Property / cites work: Q5485338 / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed representations of sequences and full-text indexes
+Normal rank
@@ Property / cites work @@
+IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS
+Normal rank
@@ Property / cites work @@
+Q4449231
@@ Property / cites work: Q4449231 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547749
@@ Property / cites work: Q4547749 / rank @@
+Normal rank
@@ Property / cites work @@
+Space Efficient Linear Time Construction of Suffix Arrays
+Normal rank
@@ Property / cites work @@
+Q3138909
@@ Property / cites work: Q3138909 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering a lightweight suffix array construction algorithm
+Normal rank
@@ Property / cites work @@
+A four-stage algorithm for updating a Burrows-Wheeler transform
+Normal rank
@@ Property / cites work @@
+Dynamic extended suffix arrays
@@ Property / cites work: Dynamic extended suffix arrays / rank @@
+Normal rank