Conference paper
Computing regularities in strings
2009 2nd IEEE International Conference on Computer Science and Information Technology, pp.298-302
2nd IEEE International Conference Computer Science and Information Technology (ICCSIT 2009) (Beijing, China, 08/08/2009–11/08/2009)
2009
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.
Details
- Title
- Computing regularities in strings
- Authors/Creators
- W.F. Smyth (Author/Creator) - McMaster UniversityM. Yusufu (Author/Creator) - McMaster University
- Publication Details
- 2009 2nd IEEE International Conference on Computer Science and Information Technology, pp.298-302
- Conference
- 2nd IEEE International Conference Computer Science and Information Technology (ICCSIT 2009) (Beijing, China, 08/08/2009–11/08/2009)
- Identifiers
- 991005544891307891
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Conference paper
Metrics
138 File views/ downloads
96 Record Views