View Item 

Computing regularities in strings

Access Status
Open access
Authors
Smyth, William
Yusufu, M.
Date
2009
Type
Conference Paper

Metadata
Show full item record
Citation
Smyth, W and Yusufu, Munina. 2009. Computing regularities in strings, in Kettani, H. and Mahadevan, V. and Sandhu, P. S. and Bhadra Chaudhuri, S.R. and Jianhong, Z. (ed), 2nd IEEE International Conference on Computer Science and Information Technology, Aug 8 2009, pp. 298-302. Beijing, China: IEEE.
Source Title
Proceedings of the 2nd IEEE international conference on computer science and information technology (ICCSIT)
Source Conference
2nd IEEE International Conference on Computer Science and Information Technology
DOI
ISBN
Faculty
Curtin Business School
The Digital Ecosystems and Business Intelligence Institute (DEBII)
School
Digital Ecosystems and Business Intelligence Institute (DEBII)
Remarks

Copyright © 2009 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
Abstract

Regularities in strings model many phenomena and thus form the subject of extensive mathematical studies . Perhaps the most conspicuous regularities in strings are those that manifest themselves in the form of repeated subpatterns. In this paper, we study several forms of regularities of strings, that is, repeats, multirepeats, repetitions and runs. We present their similarities and differences by discussing their forms and properties and we explore the existing computation algorithms. We also discuss several data structures useful for computing regularities.