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.
*Subscription may be required
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|
|Item Control Page|
Downloads per month over past year