Computing regularities in strings
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, t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE
2009
|
| Online Access: | http://hdl.handle.net/20.500.11937/22291 |
| _version_ | 1848750829161414656 |
|---|---|
| author | Smyth, William Yusufu, M. |
| author2 | Houssain Kettani |
| author_facet | Houssain Kettani Smyth, William Yusufu, M. |
| author_sort | Smyth, William |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:43:03Z |
| format | Conference Paper |
| id | curtin-20.500.11937-22291 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:43:03Z |
| publishDate | 2009 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-222912022-12-09T06:09:40Z Computing regularities in strings Smyth, William Yusufu, M. Houssain Kettani Venkatesh Mahadevan Parvinder S. Sandhu S.R.Bhadra Chaudhuri Zhou Jianhong 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. 2009 Conference Paper http://hdl.handle.net/20.500.11937/22291 10.1109/ICCSIT.2009.5234544 IEEE fulltext |
| spellingShingle | Smyth, William Yusufu, M. Computing regularities in strings |
| title | Computing regularities in strings |
| title_full | Computing regularities in strings |
| title_fullStr | Computing regularities in strings |
| title_full_unstemmed | Computing regularities in strings |
| title_short | Computing regularities in strings |
| title_sort | computing regularities in strings |
| url | http://hdl.handle.net/20.500.11937/22291 |