Computing Longest Previous non-overlapping Factors

Authors:
Maxime Crochemore;German Tischler
Affiliations:
King's College London, London, UK and Université Paris-Est, France;King's College London, London, UK
Venue:
Information Processing Letters
Year:
2011

Citing 12
Cited 5

Transducers and repetitions

Theoretical Computer Science
Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Computing quasi suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Algorithms on Strings

Algorithms on Strings
Computing Longest Previous Factor in linear time and applications

Information Processing Letters
Permuted Longest-Common-Prefix Array

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
LPF Computation Revisited

Combinatorial Algorithms
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
Crochemore factorization of sturmian and other infinite words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory

A linear time algorithm for seeds computation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized longest previous factor

Theoretical Computer Science
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
Computing the maximal-exponent repeats of an overlap-free string in linear time

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
The Forward Stem Matrix: An Efficient Data Structure for Finding Hairpins in RNA Secondary Structures

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Quantified Score

Hi-index	0.89

Visualization

Abstract

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 and used for text compression. The LPnF table is an essential element for the design of efficient algorithms on strings as it is related to a certain type of Ziv-Lempel factorisation used for this purpose. We show how to compute the LPnF table in linear time from the suffix array of the string when it is drawn from an integer alphabet. The algorithm is a non-immediate extension of the LPF computation and it does not require any other sophisticated data structure than the suffix array of the input string.