Work

String Cadences

Year: 2016

Type: preprint

Abstract: We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We give a sub-quadratic algorithm for determining whether a string has any cadence consisting of at least three occurrences of a character, and a nearly linear algorithm for finding all anchored cadences.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1610.03337

Authors: Amir, Amihood, Apostolico, Alberto, Gagie, Travis, Landau, Gad M.

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4394671375

Cites:

Cited by:

Related to: 10