Counting Maximal-Exponent Factors in Words
- Submitting institution
-
Goldsmiths' College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1970
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2016.02.035
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 27
- Volume
- 658(A)
- Issue
- -
- ISSN
- 0304-3975
- Open access status
- Out of scope for open access requirements
- Month of publication
- January
- Year of publication
- 2016
- URL
-
http://research.gold.ac.uk/id/eprint/23335/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The problem of counting maximal repeats remained unsolved for over fifty years, despite fierce attempts of renowned researchers in this field. This paper gives an upper bound (1.8 n) and a lower bound (5/6 n) on the number of occurrences of the most significant repeats (the size of the input is n). The paper was selected for presentation at DACS: Days of Computer Science, University of Bucharest (2016). This research was an output from (i) PRIME program of DAAD, co-funded by BMBF and EU 7th Framework (ii) a Newton International Fellowship, with funds from the Royal Society and British Academy.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -