Efficient algorithms for three variants of the LPF table
Authors:
- Maxime CrochemoreMCMaxime Crochemore
- Costas S. IliopoulosCICostas S. Iliopoulos
- Marcin KubicaMKMarcin Kubica
- Wojciech RytterWRWojciech Rytter
- Tomasz WaleńTWTomasz Waleń
- 1 February 2012
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 11, 51-61
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Lempel–Ziv Factorization Using Less Time & SpaceMathematics in Computer Science, 2008
- Computing Longest Previous Factor in linear time and applicationsInformation Processing Letters, 2008
- Succinct data structures for flexible text retrieval systemsJournal of Discrete Algorithms, 2007
- Finding maximal repetitions in a word in linear time2003
- Compression of DNA sequences2002
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- Detecting leftmost maximal periodicitiesDiscrete Applied Mathematics, 1989
- Transducers and repetitionsTheoretical Computer Science, 1986
- Scaling and related techniques for geometry problems1984
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a StringJournal of the ACM, 1975