Longest previous overlapping factor array

Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we introduce the longest previous overlapping factor array of a string – a variant of the longest previous factor array. We show that it can be computed in linear time in the length of the input string, via a reduction to the Max-variant of the Manhattan skyline problem Crochemore et al. (2014) [5].

Original languageEnglish
Article number106097
JournalInformation Processing Letters
Volume168
DOIs
Publication statusPublished - Jun 2021

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Longest previous overlapping factor array'. Together they form a unique fingerprint.

Cite this