Repetitive perhaps, but certainly not boring

W.F. Smyth

doi:10.1016/S0304-3975(00)00067-0

Back

Repetitive perhaps, but certainly not boring

Journal article

Peer reviewed

Repetitive perhaps, but certainly not boring

W.F. Smyth

Theoretical Computer Science, Vol.249(2), pp.343-355

2000

DOI: https://doi.org/10.1016/S0304-3975(00)00067-0

Files and links (1)

url

Link to Published Version *Subscription may be requiredView

Abstract

In this paper some of the work done on repetitions in strings is surveyed, especially that of an algorithmic nature. Several open problems are described and conjectures formulated about some of them.

Details

Title: Repetitive perhaps, but certainly not boring
Authors/Creators: W.F. Smyth (Author/Creator) - McMaster University
Publication Details: Theoretical Computer Science, Vol.249(2), pp.343-355
Publisher: Elsevier BV
Identifiers: 991005543577807891
Murdoch Affiliation: Murdoch University
Language: English
Resource Type: Journal article

Metrics

80 Record Views

20 Times Cited - Web of Science

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Citation topics: 4 Electrical Engineering, Electronics & Computer Science; 4.182 Data Structures, Algorithms & Complexity; 4.182.1103 Efficient Algorithms
Web Of Science research areas: Computer Science, Theory & Methods
ESI research areas: Computer Science