Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553): Difference between revisions

@@ Property / cites work @@
+Improved dynamic dictionary matching
@@ Property / cites work: Improved dynamic dictionary matching / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient LZ78 Factorization of Grammar Compressed Text
+Normal rank
@@ Property / cites work @@
+The level ancestor problem simplified
@@ Property / cites work: The level ancestor problem simplified / rank @@
+Normal rank
@@ Property / cites work @@
+Finding level-ancestors in trees
@@ Property / cites work: Finding level-ancestors in trees / rank @@
+Normal rank
@@ Property / cites work @@
+The suffix tree of a tree and minimizing sequential transducers
+Normal rank
@@ Property / cites work @@
+A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
+Normal rank
@@ Property / cites work @@
+Position heaps: a simple and dynamic text indexing data structure
+Normal rank
@@ Property / cites work @@
+Compressing and indexing labeled trees, with applications
+Normal rank
@@ Property / cites work @@
+New Algorithms for Position Heaps
@@ Property / cites work: New Algorithms for Position Heaps / rank @@
+Normal rank
@@ Property / cites work @@
+Linked dynamic tries with applications to LZ-compression in sublinear time and space
+Normal rank
@@ Property / cites work @@
+Fast incremental planarity testing
@@ Property / cites work: Fast incremental planarity testing / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank