chapter

LPF Computation Revisited

Authors:

Maxime Crochemore,

Lucian Ilie,

Costas S. Iliopoulos,

Marcin Kubica,

Wojciech Rytter,

Tomasz WaleńAuthors Info & Claims

Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28---July 2, 2009, Revised Selected Papers

November 2009

Pages 158 - 169

https://doi.org/10.1007/978-3-642-10217-2_18

Published: 10 November 2009 Publication History

Abstract

We present efficient algorithms for storing past segments of a text. They are computed using two previously computed read-only arrays (SUF and LCP) composing the Suffix Array of the text. They compute the maximal length of the previous factor (subword) occurring at each position of the text in a table called LPF. This notion is central both in many conservative text compression techniques and in the most efficient algorithms for detecting motifs and repetitions occurring in a text.

The main results are: a linear-time algorithm that computes explicitly the permutation that transforms the LCP table into the LPF table; a time-space optimal computation of the LPF table; and an O(nlogn) strong in-place computation of the LPF table.

Cited By

View all

Charoenrak SChairungsee S(2019)Algorithm for Palindrome Detection by Suffix HeapProceedings of the 2019 7th International Conference on Information Technology: IoT and Smart City10.1145/3377170.3377202(85-88)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3377170.3377202
Ohlebusch EWeber P(2019)On the Computation of Longest Previous Non-overlapping FactorsString Processing and Information Retrieval10.1007/978-3-030-32686-9_26(372-381)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-32686-9_26
Kongsen JChairungsee S(2017)Using Suffix Tray and Longest Previous Factor for Pattern SearchingProceedings of the 2017 International Conference on Information Technology10.1145/3176653.3176662(7-11)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3176653.3176662
Show More Cited By

LPF Computation Revisited
1. Computing methodologies
  1. Symbolic and algebraic manipulation
2. Theory of computation

Recommendations

Computing Longest Previous non-overlapping Factors

The Longest Previous non-overlapping Factor table (LPnF) stores for each position of a string the maximal length of factors occurring both there and in the preceding part of the string. The notion is a slight variant of the LPF table described before ...
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
SOFSEM '10: Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

Suffix arrays provide a powerful data structure to solve several questions related to the structure of all the factors of a string. We show how they can be used to compute efficiently two new tables storing different types of previous factors (past ...
Efficient algorithms for three variants of the LPF table

The concept of a longest previous factor (LPF) is inherent to Ziv-Lempel factorization of strings in text compression, as well as in statistics of repetitions and symmetries. It is expressed in the form of a table - LPF[i] is the maximum length of a ...

Comments

Information & Contributors

Information

Published In

Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28---July 2, 2009, Revised Selected Papers

November 2009

477 pages

ISBN:9783642102165

Editors:
Jiří Fiala
Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic
,
Jan Kratochvíl
Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic
,
Mirka Miller
School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, Australia NSW 2308

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 10 November 2009

Author Tags

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Charoenrak SChairungsee S(2019)Algorithm for Palindrome Detection by Suffix HeapProceedings of the 2019 7th International Conference on Information Technology: IoT and Smart City10.1145/3377170.3377202(85-88)Online publication date: 20-Dec-2019
https://dl.acm.org/doi/10.1145/3377170.3377202
Ohlebusch EWeber P(2019)On the Computation of Longest Previous Non-overlapping FactorsString Processing and Information Retrieval10.1007/978-3-030-32686-9_26(372-381)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-32686-9_26
Kongsen JChairungsee S(2017)Using Suffix Tray and Longest Previous Factor for Pattern SearchingProceedings of the 2017 International Conference on Information Technology10.1145/3176653.3176662(7-11)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3176653.3176662
Charoenrak SChairungsee S(2017)Palindrome Detection Using On-line PositionProceedings of the 2017 International Conference on Information Technology10.1145/3176653.3176661(62-65)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3176653.3176661
Chairungsee SCrochemore M(2017)Longest Previous Non-overlapping Factors Table ComputationCombinatorial Optimization and Applications10.1007/978-3-319-71147-8_35(483-491)Online publication date: 16-Dec-2017
https://dl.acm.org/doi/10.1007/978-3-319-71147-8_35
Kärkkäinen JKempa DPuglisi S(2016)Lazy Lempel-Ziv Factorization AlgorithmsACM Journal of Experimental Algorithmics10.1145/269987621(1-19)Online publication date: 21-Oct-2016
https://dl.acm.org/doi/10.1145/2699876
Crochemore MIlie LIliopoulos CKubica MRytter WWaleń T(2013)Computing the Longest Previous FactorEuropean Journal of Combinatorics10.1016/j.ejc.2012.07.01134:1(15-26)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1016/j.ejc.2012.07.011
Smyth W(2013)Computing regularities in stringsEuropean Journal of Combinatorics10.1016/j.ejc.2012.07.01034:1(3-14)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1016/j.ejc.2012.07.010
Al-Hafeedh ACrochemore MIlie LKopylova ESmyth WTischler GYusufu M(2012)A comparison of index-based lempel-Ziv LZ77 factorization algorithmsACM Computing Surveys10.1145/2379776.237978145:1(1-17)Online publication date: 7-Dec-2012
https://dl.acm.org/doi/10.1145/2379776.2379781
Starikovskaya T(2012)Computing lempel-ziv factorization onlineProceedings of the 37th international conference on Mathematical Foundations of Computer Science10.1007/978-3-642-32589-2_68(789-799)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32589-2_68
Show More Cited By

Abstract

Cited By

Recommendations

Computing Longest Previous non-overlapping Factors

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

Efficient algorithms for three variants of the LPF table

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations