The BAT-LZ algorithm introduces a new approach to text compression by limiting access time, improving efficiency without sacrificing compression ratio. It combines greedy and minmax parsing strategies to optimize phrase selection. Experimental results show superior performance compared to traditional LZ compression.
BAT-LZ offers fast access to compressed texts with minimal loss in compression ratio, making it suitable for repetitive text collections. The algorithm's design involves linear-space data structures and suffix trees for efficient parsing. Open challenges remain for further exploration in this field.
Sang ngôn ngữ khác
từ nội dung nguồn
arxiv.org
Thông tin chi tiết chính được chắt lọc từ
by Zsuz... lúc arxiv.org 03-18-2024
https://arxiv.org/pdf/2403.09893.pdfYêu cầu sâu hơn