Faster Lightweight Lempel-Ziv Parsing

DOI10.1007/978-3-662-48054-0_36zbMath1465.68316arXiv1504.06712OpenAlexW2270711291MaRDI QIDQ2946413

Dmitry Kosolobov

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06712

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (3)

Computing runs on a general alphabet ⋮ Refining the \(r\)-index ⋮ LZ-End Parsing in Linear Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the longest common prefix array based on the Burrows-Wheeler transform
• Deterministic Dictionaries
• Fully Functional Static and Dynamic Succinct Trees
• Computing Lempel-Ziv Factorization Online
• Lempel Ziv Computation in Small Space (LZ-CISS)
• Lempel-Ziv Factorization May Be Harder Than Computing All Runs
• Faster Compact On-Line Lempel-Ziv Factorization
• Lempel-Ziv Factorization Revisited
• An Online Algorithm for Finding the Longest Previous Factors
• Fast Lightweight Suffix Array Construction and Checking
• Succinct Dictionary Matching with No Slowdown
• On the Complexity of Finite Sequences
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets

This page was built for publication: Faster Lightweight Lempel-Ziv Parsing