Home
Scholarly Works
Computing Regularities in Strings
Conference

Computing Regularities in Strings

Abstract

Regularities in strings model many phenomena and thus form the subject of extensive mathematical studies [23]. 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.

Authors

Smyth WF; Yusufu M

Pagination

pp. 298-302

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

January 1, 2009

DOI

10.1109/iccsit.2009.5234544

Name of conference

2009 2nd IEEE International Conference on Computer Science and Information Technology
View published work (Non-McMaster Users)

Contact the Experts team