Lempel-Ziv factorization powered by space efficient suffix trees (Q724218): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-017-0333-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2737421126
@@ Property / OpenAlex ID: W2737421126 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved dynamic dictionary matching
@@ Property / cites work: Improved dynamic dictionary matching / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time construction of compressed text indices in compact space
+Normal rank
@@ Property / cites work @@
+Range Predecessor and Lempel-Ziv Parsing
@@ Property / cites work: Range Predecessor and Lempel-Ziv Parsing / rank @@
+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 @@
+Representing trees of higher degree
@@ Property / cites work: Representing trees of higher degree / rank @@
+Normal rank
@@ Property / cites work @@
+Transducers and repetitions
@@ Property / cites work: Transducers and repetitions / rank @@
+Normal rank
@@ Property / cites work @@
+A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
+Normal rank
@@ Property / cites work @@
+Linear-time computation of local periods
@@ Property / cites work: Linear-time computation of local periods / rank @@
+Normal rank
@@ Property / cites work @@
+Raising Permutations to Powers in Place
@@ Property / cites work: Raising Permutations to Powers in Place / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Functional Static and Dynamic Succinct Trees
+Normal rank
@@ Property / cites work @@
+Indexing compressed text
@@ Property / cites work: Indexing compressed text / rank @@
+Normal rank
@@ Property / cites work @@
+Alphabet-Dependent String Searching with Wexponential Search Trees
+Normal rank
@@ Property / cites work @@
+Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
+Normal rank
@@ Property / cites work @@
+Radix Sorting with No Extra Space
@@ Property / cites work: Radix Sorting with No Extra Space / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Grammar-Based Self-index
@@ Property / cites work: A Faster Grammar-Based Self-index / rank @@
+Normal rank
@@ Property / cites work @@
+LZ77-Based Self-indexing with Faster Pattern Matching
+Normal rank
@@ Property / cites work @@
+Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding and representing all the tandem repeats in a string
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank
@@ Property / cites work @@
+Ultra-succinct representation of ordered trees with applications
+Normal rank
@@ Property / cites work @@
+Linked dynamic tries with applications to LZ-compression in sublinear time and space
+Normal rank
@@ Property / cites work @@
+Lempel-Ziv index for \(q\)-grams
@@ Property / cites work: Lempel-Ziv index for \(q\)-grams / rank @@
+Normal rank
@@ Property / cites work @@
+Linear work suffix array construction
@@ Property / cites work: Linear work suffix array construction / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
+Normal rank
@@ Property / cites work @@
+Detecting leftmost maximal periodicities
@@ Property / cites work: Detecting leftmost maximal periodicities / rank @@
+Normal rank
@@ Property / cites work @@
+Suffix Arrays: A New Method for On-Line String Searches
+Normal rank
@@ Property / cites work @@
+Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
+Normal rank
@@ Property / cites work @@
+Constructing LZ78 tries and position heaps in linear time for large alphabets
+Normal rank
@@ Property / cites work @@
+Indexing text using the Ziv--Lempel trie
@@ Property / cites work: Indexing text using the Ziv--Lempel trie / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Dynamic Sequence Representations
@@ Property / cites work: Optimal Dynamic Sequence Representations / rank @@
+Normal rank
@@ Property / cites work @@
+Fully-Compressed Suffix Trees
@@ Property / cites work: Fully-Compressed Suffix Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828936
@@ Property / cites work: Q4828936 / rank @@
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+Data compression via textual substitution
@@ Property / cites work: Data compression via textual substitution / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering a compressed suffix tree implementation
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank