Abstract
It is shown that the Lyndon decomposition of a word ofn symbols can be computed by ann-processor CRCW PRAM inO(logn) time. Extensions of the basic algorithm convey, within the same time and processors bounds, efficient parallel solutions to problems such as finding the lexicographically minimum or maximum suffix for all prefixes of the input string, and finding the lexicographically least rotation of all prefixes of the input.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A. V., J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
Akl, A. G., and T. G. Toussaint, An Improved Algorithm To Check for Polygon Similarity,Information Processing Letters,7, 127–128 (1978).
Apostolico, A., M. J. Atallah, L. L. Larmore, and H. S. McFaddin, Efficient Parallel Algorithms for String Editing and Related Problems,Proceedings of the 26th Allerton Conference on Communications, Control, and Computing, Monticello, IL, Sept. 1988. Also inSIAM Journal on Computing,19, 968–988 (1990).
Apostolico, A., and M. Crochemore, Optimal Canonization of All Substrings of a String,Information and Computation,95, 76–95 (1991).
Apostolico, A., and Z. Galil (eds.),Combinatorial Algorithms on Words, NATO ASI Series F, Vol. 12, Springer-Verlag, New York, 1985.
Apostolico, A., C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin, Parallel Construction of a Suffix Tree, with Applications,Algorithmica,3, 347–365 (1988).
Beame, P., and J. Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM,Journal of the Association for Computing Machinery,36(3), 643–670 (1989).
Berkman, O., D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin, Highly Parallelizable Problems,Proceedings of the 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 309–319.
Chen, K. T., R. H. Fox, and R. C. Lyndon, Free Differential Calculus, IV,Annals of Mathematics,68, 81–95 (1958).
Crochemore, M., and D. Perrin, Two-Way String-Matching,Journal of the Association for Computing Machinery,38, 651–675 (1991).
Crochemore, M., and W. Rytter, Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays,Theoretical Computer Science,88, 59–82 (1991).
Duval, J. P., Factorizing Words over an Ordered Alphabet,Journal of Algorithms,4, 363–381 (1983).
Fich, F. E., R. L. Ragde, and A. Wigderson, Relations Between Concurrent-Write Models of Parallel Computation,SIAM Journal on Computing,17, 606–627 (1988).
Galil, Z., Optimal Parallel Algorithms for String Matching,Information and Control,67, 144–157 (1985).
Lothaire, M.,Combinatorics on Words, Addison-Wesley, Reading, MA, 1982.
Paige, R. R., R. Tarjan, and R. Bonic, A Linear Time Solution to the Single Function Coarsest Partition Problem,Theoretical Computer Science,40, 67–84 (1985).
Shiloach, Y., Fast Canonization of Circular Strings,Journal of Algorithms,2, 107–121 (1981).
Siromoney, R., and L. Mathew, A Public Key Cryptosystem Based on Lyndon Words,Information Processing Letters,35(1), 33–36 (1990).
Author information
Authors and Affiliations
Additional information
A. Apostolico's research was supported in part by the French and Italian Ministries of Education, by British Research Council Grant SERC-E76797, by NSF Grants CCR-89-00305 and CCR-9201078, by NIH Library of Medicine Grant R01 LM05118, by AFOSR Grant 89NM682, and by NATO Grant CRG 900293. M. Crochemore's research was supported in part by PRC “Mathématiques et Informatique” and by NATO Grant CRG 900293.
Rights and permissions
About this article
Cite this article
Apostolico, A., Crochemore, M. Fast parallel Lyndon factorization with applications. Math. Systems Theory 28, 89–108 (1995). https://doi.org/10.1007/BF01191471
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01191471