Approximate Periods of Strings

Authors:
Jeong Seop Sim;Costas S. Iliopoulos;Kunsoo Park;William F. Smyth
Affiliations:
-;-;-;-
Venue:
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Year:
1999

Citing 15
Cited 1

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Optimal superprimitivity testing for strings

Information Processing Letters
An on-line string superprimitivity test

Information Processing Letters
Efficient detection of quasiperiodicities in strings

Theoretical Computer Science
Testing string superprimitivity in parallel

Information Processing Letters
More on the complexity of common superstring and supersequence problems

Theoretical Computer Science
A correction to “An optimal algorithm to compute all the covers of a string”

Information Processing Letters
The subtree max gap problem with application to parallel string covering

Information and Computation
A work-time optimal algorithm for computing all string covers

Theoretical Computer Science
An Optimal O(log log n)-Time Parallel Algorithm for Detecting all Squares in a String

SIAM Journal on Computing
Incremental String Comparison

SIAM Journal on Computing
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

SIAM Journal on Computing
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
An Algorithm for Approximate Tandem Repeats

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching

A Dynamic Edit Distance Table

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study different forms of approximate periodicity under a variety of distance rules.We consider three related problems, for two of which we derive polynomial-time algorithms; we then show that the third problem is NP-complete.