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.
This work of both authors was partially supported by the GR/E 75752 grant of the Science and Engineering Reserch Council of the UK. The first author was supported in part by the UK SERC GR/F 00898 grant and a Royal Society grant. The work of the second author was partially supported by grant No A8180 of the Natural Sciences and Engineering Council of Canada
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
6. References
Akl, A. G., Toussaint, G. T., An improved algorithmic check for polygon similarity, Inf. Proc. Lett., 7–3 (1978) 127–128
Apostolico A., Iliopoulos, C., Unpublished manuscript.
Apostolico, A., Iliopoulos, C., Landau, G.M., Schieber, B., Vishkin, U., Parallel construction of a suffix tree with applications,Acta Algorithmica (1988)3: 347–365
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–76
Booth, K.S., Lexicographically least circular substrings, Inf. Proc. Letters, 10, 4, (1980) pp240–242
Knuth, D., Morris, J., Pratt, V., Fast pattern maching in strings, SIAM J. Computing, 6 (2) (1977) pp 323–350
Shiloach, Y., Fast canonization of circular strings, J. Algorithms 2 (1981) 107–121
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iliopoulos, C.S., Smyth, W.F. (1989). PRAM algorithms for identifying polygon similarity. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive