Computation of squares in a string

Preliminary version
  • S. Rao Kosaraju
Conference paper

DOI: 10.1007/3-540-58094-8_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 807)
Cite this paper as:
Kosaraju S.R. (1994) Computation of squares in a string. In: Crochemore M., Gusfield D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg

Abstract

We design a linear time algorithm for computing a square substring from each position of a given string over a finite alphabet. The algorithm exploits several subtle properties of suffix trees for strings.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • S. Rao Kosaraju
    • 1
  1. 1.Department of Computer ScienceThe Johns Hopkins UniversityBaltimore

Personalised recommendations