@inbook{191017ab6c1041b49cbd3e3e95d827c8,
title = "Longest previous non-overlapping factors table computation",
abstract = "We examine the computation of the Longest Previous non-overlapping Factor (LPnF) table. The LPnF table is the table that stores the maximal length of factors re-occurring at each position of a string without overlapping. The LPnF table is related to well-known techniques for data compression, such as Ziv-Lempel factorization. This table is useful both for string algorithms and for text compression. In this paper, we present two algorithms to compute the LPnF table of a string: one from its augmented position heap and the other from its suffix heap. The proposed algorithms run in linear time with linear memory space.",
keywords = "Augmented position heap, Data compression, Longest previous non-overlapping factor, Suffix heap, Text compression",
author = "Supaporn Chairungsee and Maxime Crochemore",
year = "2017",
doi = "10.1007/978-3-319-71147-8_35",
language = "English",
isbn = "9783319711461",
volume = "10628 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "483--491",
booktitle = "Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings",
address = "Germany",
note = "11th International Conference on Combinatorial Optimization and Applications, COCOA 2017 ; Conference date: 16-12-2017 Through 18-12-2017",
}