On the Computation of Longest Previous Non-overlapping Factors

Enno Ohlebusch, Pascal Weber. On the Computation of Longest Previous Non-overlapping Factors. In Nieves R. Brisaboa, Simon J. Puglisi, editors, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings. Volume 11811 of Lecture Notes in Computer Science, pages 372-381, Springer, 2019. [doi]

Abstract

Abstract is missing.