CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Computing the antiperiod(s) of a string
Authors
Hayam Alamro
G. Badkobeh
+3 more
D. Belazzougui
C.S. Iliopoulos
S.J. Puglisi
Publication date
1 January 2019
Publisher
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Doi
Cite
Abstract
A string S[1, n] is a power (or repetition or tandem repeat) of order k and period n/k, if it can be decomposed into k consecutive identical blocks of length n/k. Powers and periods are fundamental structures in the study of strings and algorithms to compute them efficiently have been widely studied. Recently, Fici et al. (Proc. ICALP 2016) introduced an antipower of order k to be a string composed of k distinct blocks of the same length, n/k, called the antiperiod. An arbitrary string will have antiperiod t if it is prefix of an antipower with antiperiod t. In this paper, we describe efficient algorithm for computing the smallest antiperiod of a string S of length n in O(n) time. We also describe an algorithm to compute all the antiperiods of S that runs in O(n log n) time. © Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, and Simon J. Puglisi.Peer reviewe
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
King's Research Portal
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:kclpure.kcl.ac.uk:publicat...
Last time updated on 28/09/2023
Helsingin yliopiston digitaalinen arkisto
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:helda.helsinki.fi:10138/32...
Last time updated on 16/04/2021
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:1050...
Last time updated on 08/07/2019
Goldsmiths Research Online
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:eprints.gold.ac.uk:28017
Last time updated on 20/01/2020