Efficient Computation of Maximal Anti-Exponent in Palindrome-Free Strings
- Submitting institution
-
Goldsmiths' College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1971
- Type
- D - Journal article
- DOI
-
10.1016/j.tcs.2016.02.014
- Title of journal
- Theoretical Computer Science
- Article number
- -
- First page
- 241
- Volume
- 656
- Issue
- B
- ISSN
- 0304-3975
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2016
- URL
-
http://research.gold.ac.uk/id/eprint/22723/
- 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
-
3
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Palindromic structure is significant in nucleic acid sequences (RNA, DNA) and in other areas of molecular biology. These kinds of palindromes form a stem-loop intra-molecular base pairing structure. This paper presents the first linear time algorithm that detects all the significant gapped palindromes occurring in the text. The algorithm involves an intricate manipulation of the reverse longest common factor array twinned with the suffix automaton. This paper was selected for oral presentation at the IEEE International Conference on Digital Information and Communication Technology and its Applications (2015).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -