Advertisement

PRAM algorithms for identifying polygon similarity

  • Costas S. Iliopoulos
  • W. F. Smyth
Conference paper
  • 159 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

Abstract

The computation of the least lexicographic rotation of a string leads to the identification of polygon similarity. An O(logn) time CRCW PRAM algorithm for computing the least lexicographic rotation of a circular string (of length n) over a fixed alphabet is presented here. The logarithmic running time is achieved by using O(n/logn) processors and its space complexity is linear. A second algorithm for unbounded alphabets requires O(lognloglogn) units of time, uses O(n/logn) processors.

Keywords

Suffix Tree Input String Full Binary Tree Circular String Pram Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [AT]
    Akl, A. G., Toussaint, G. T., An improved algorithmic check for polygon similarity, Inf. Proc. Lett., 7–3 (1978) 127–128CrossRefGoogle Scholar
  2. [AI]
    Apostolico A., Iliopoulos, C., Unpublished manuscript.Google Scholar
  3. [AILSV]
    Apostolico, A., Iliopoulos, C., Landau, G.M., Schieber, B., Vishkin, U., Parallel construction of a suffix tree with applications,Acta Algorithmica (1988)3: 347–365CrossRefGoogle Scholar
  4. [AIP]
    Apostolico, A., Iliopoulos, C.S., Paige, R., An O(nlogn) cost parallel algorithm for the one function partitioning problem, Proc. of Int. Conf. on Parallel architectures, ed.Jung and Mehlhorn, Academie-Verlag, (1987) pp70–76Google Scholar
  5. [B]
    Booth, K.S., Lexicographically least circular substrings, Inf. Proc. Letters, 10, 4, (1980) pp240–242CrossRefGoogle Scholar
  6. [KMP]
    Knuth, D., Morris, J., Pratt, V., Fast pattern maching in strings, SIAM J. Computing, 6 (2) (1977) pp 323–350CrossRefGoogle Scholar
  7. [S]
    Shiloach, Y., Fast canonization of circular strings, J. Algorithms 2 (1981) 107–121CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Costas S. Iliopoulos
    • 1
  • W. F. Smyth
    • 2
  1. 1.Department of Computer ScienceRoyal Holloway College, University of LondonEghamEngland
  2. 2.Department of Computer Science and SystemsMcMaster UniversityHamiltonCanada

Personalised recommendations