Journal article
A correction to “An optimal algorithm to compute all the covers of a string”
Information Processing Letters, Vol.54(2), pp.101-103
1995
Abstract
This note corrects an error in a paper recently published in this journal (An optimal algorithm to compute all the covers of a string, Inform. Process. Lett. 50 (5) (1994) 239–246). The correction consists primarily of a new subalgorithm which is called by COMPUTE-COVERS, the main algorithm presented in the paper referenced. It turns out that the new subalgorithm is itself sufficient to solve the original problem — that is, to compute all the covers of a given string in time linear in the string length — and so it is presented here as a self-contained algorithm in its own right.
Details
- Title
- A correction to “An optimal algorithm to compute all the covers of a string”
- Authors/Creators
- D. Moore (Author/Creator) - Curtin UniversityW.F. Smyth (Author/Creator) - McMaster University
- Publication Details
- Information Processing Letters, Vol.54(2), pp.101-103
- Publisher
- Elsevier BV
- Identifiers
- 991005545279707891
- Copyright
- © 1995 Published by Elsevier B.V.
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
179 File views/ downloads
72 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- 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, Information Systems
- ESI research areas
- Computer Science