Catalog Home Page

Computing regularities in strings

Smyth, W.F. and Yusufu, M. (2009) Computing regularities in strings. In: 2nd IEEE International Conference Computer Science and Information Technology (ICCSIT 2009), 8 - 11 Aug 2009, Beijing, China pp. 298-302.

[img]
Preview
PDF - Published Version
Download (148kB)
Link to Published Version: http://dx.doi.org/10.1109/ICCSIT.2009.5234544
*Subscription may be required

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.

Publication Type: Conference Paper
URI: http://researchrepository.murdoch.edu.au/id/eprint/27953
Item Control Page Item Control Page

Downloads

Downloads per month over past year