Constant-Space Algorithms for BWT and Lyndon Array Construction

This ArXiv paper presents advancements in string processing algorithms, specifically focusing on in-place construction of the Burrows-Wheeler Transform (BWT) and Lyndon arrays. The research likely contributes to efficient data compression and pattern matching techniques.

• •Explores constant-space algorithms.
• •Focuses on BWT and Lyndon array construction.
• •Potentially relevant to data compression and related fields.