An efficient algorithm for online square detection

Authors:
H. F. Leung;Z. S. Peng;H. F. Ting
Affiliations:
Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
Theoretical Computer Science - Computing and combinatorics
Year:
2006

Citing 13
Cited 2

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

Journal of Algorithms
An infinite square-free co-CFL

Information Processing Letters
Transducers and repetitions

Theoretical Computer Science
Applications of an infinite square-free co-CFL

Theoretical Computer Science
Data compression: methods and theory

Data compression: methods and theory
Efficient parallel algorithms to test square-freeness and factorize strings

Information Processing Letters
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

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

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Simple and flexible detection of contiguous repeats using a suffix tree

Theoretical Computer Science
Performance of a Comprehensive and Efficient Constraint Library Based on Local Search

AI '98 Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence
Extending GENET for Non-Binary Constraint Satisfaction Problems

TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Linear time algorithms for finding and representing all the tandem repeats in a string

Journal of Computer and System Sciences

Efficient on-line repetition detection

Theoretical Computer Science
A fast algorithm for finding the positions of all squares in a run-length encoded string

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A square is a string that can be divided into two identical substrings. The problem of square detection has found applications in areas such as bioinformatics and data compression. There are many offline algorithms for the problem. In this paper, we give the first online algorithm for deciding whether a string contains a square. Our algorithm runs in total O(h log2 h) time where h is the length of the longest prefix of the input string that does not contain a square.