Parallel computations on strings and arrays

  • Maxime Crochemore
  • Wojciech Rytter
Conference paper

DOI: 10.1007/3-540-52282-4_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 415)
Cite this paper as:
Crochemore M., Rytter W. (1990) Parallel computations on strings and arrays. In: Choffrut C., Lengauer T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg

Abstract

We present several new parallel algorithms in the field of string and array processing. We give almost optimal algorithms for pattern matching in arrays and for related problem: longest common subarray, longest repeated subarray and longest symmetric subarray. We also give almost optimal algorithms for problems on strings: finding squares, testing even palstars, computing Lyndon factorizations and building pattern matching automata. In the PRAM model without concurrent writes, the parallel time is log(n)2 with n processors and, in the PRAM model with concurrent writes, the time, for most of the problems, is log(n) with n processors. All the algorithms have in common the use of a parallel version of the Karp, Miller and Rosenberg's algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Maxime Crochemore
    • 1
  • Wojciech Rytter
    • 2
  1. 1.LITP, Université de Paris 7Paris Cedex 05France
  2. 2.Institute of InformaticsWarsaw University, PKiN 8p.WarsawPoland

Personalised recommendations