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...
| Main Authors: | , , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Elsevier
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/48986 |