On the Computation of Longest Previous Non-overlapping Factors

String Processing and Information Retrieval - Lecture Notes in Computer Science ◽

10.1007/978-3-030-32686-9_26 ◽

2019 ◽

pp. 372-381

Author(s):

Enno Ohlebusch ◽

Pascal Weber

Download Full-text