Extracting powers and periods in a word from its runs structure

Extracting powers and periods in a word from its runs structure

A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number of runs in a word of length n is O(n) and that they can all be computed in O(n) time. We study some applications of this result. New simpler O(n) time algorithms are presented for classical textual p...

Full description

Bibliographic Details
Main Authors: Crochemore, M., Iliopoulos, Costas, Kubica, M., Radoszewski, J., Rytter, W., Walen, T.
Format: Journal Article
Published: Elsevier 2014
Online Access:http://hdl.handle.net/20.500.11937/48986

Similar Items

Similar Items