Longest previous overlapping factor array

DOI10.1016/J.IPL.2021.106097OpenAlexW3125201828MaRDI QIDQ2656356

Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106097

zbMATH Keywords

algorithmsManhattan skyline problemoverlapping factorlongest previous overlapping factor

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Extracting powers and periods in a word from its runs structure
• Efficient algorithms for three variants of the LPF table
• Computing longest previous factor in linear time and applications
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Computing the longest previous factor
• Computing longest previous non-overlapping factors
• A universal algorithm for sequential data compression
• The “Runs” Theorem
• Algorithms on Strings

This page was built for publication: Longest previous overlapping factor array