PRAM algorithms for identifying polygon similarity
- 159 Downloads
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.
KeywordsSuffix Tree Input String Full Binary Tree Circular String Pram Algorithm
Unable to display preview. Download preview PDF.
- [AI]Apostolico A., Iliopoulos, C., Unpublished manuscript.Google Scholar
- [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