Computing longest previous factor in linear time and applications
type: Item
instance of: scholarly article
title: Computing longest previous factor in linear time and applications
zbMATH Open document ID: 1186.68591
author: Maxime Crochemore
author: Lucian Ilie
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5694910
zbMATH Keywords: design of algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: strings
zbMATH Keywords: suffix array
zbMATH Keywords: longest common prefix
zbMATH Keywords: longest previous factor
zbMATH Keywords: Lempel-Ziv factorization
zbMATH Keywords: repetitions
zbMATH Keywords: runs
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.10.006
OpenAlex ID: W1965743524
Wikidata QID: Q56767309
cites work: Replacing suffix trees with enhanced suffix arrays
cites work: Fast and Practical Algorithms for Computing All the Runs in a String
cites work: Transducers and repetitions
cites work: Algorithms on Strings
cites work: Linear-time computation of local periods
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Q4449231
cites work: Q4547749
cites work: Constructing suffix arrays in linear time
cites work: Space efficient linear time construction of suffix arrays
cites work: On the Complexity of Finite Sequences
cites work: Detecting leftmost maximal periodicities
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A universal algorithm for sequential data compression
DOI: 10.1016/J.IPL.2007.10.006
description: scientific article; zbMATH DE number 5694910