Computing maximal-exponent factors in an overlap-free word
- Submitting institution
-
Goldsmiths' College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1972
- Type
- D - Journal article
- DOI
-
10.1016/j.jcss.2015.11.007
- Title of journal
- Journal of Computer and System Sciences
- Article number
- -
- First page
- 477
- Volume
- 82
- Issue
- 3
- ISSN
- 0022-0000
- Open access status
- Out of scope for open access requirements
- Month of publication
- May
- Year of publication
- 2015
- URL
-
http://research.gold.ac.uk/id/eprint/22721/
- 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
-
1
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Redundancies in text is the backbone of designing compression techniques. This paper presents a linear-time algorithm that computes all of the significant redundancies in a text. The technique exploits a sophisticated data structure as well as combinatorial properties of repeats which were discovered during this research. Furthermore, it utilises a factorisation invented by Lempel and Ziv in 1977, which is the nucleus of gzip. The preliminary version of this article received a best paper award from the 19th International Symposium of String Processing and Information Retrieval; a specialized conference for string processing.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -