The following pages link to A Faster Grammar-Based Self-index (Q2890196):
Displayed 21 items.
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Top tree compression of tries (Q2067669) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Fast relative Lempel-Ziv self-index for similar sequences (Q2445867) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- LZ-End Parsing in Linear Time (Q5111742) (← links)
- A Space-Optimal Grammar Compression. (Q5111756) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)