Skip to main content
SpringerLink
Log in

Unit route upper bound for string-matching on hypercube

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 807))

Included in the following conference series:

  • 153 Accesses

Abstract

We give here an algorithm of string matching on an hypercube with constant memory in time [log n]+5/2[log m]+5 counted in number of unit routes and with a constant number of operations by communication. This algorithm is very close to the lower bound of the problem for this architecture. It uses 2nm processors and it is based on combinatorial properties on the hypercube network such as the constant time shift of line for a length power of two and constructions of arrays.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.S. Boyer et J.S. Moore. A fast string searching algorithm. Comm of the ACM, 1977.

    Google Scholar 

  2. D. Breslauer et Z. Galil. An optimal O(log log n) parallel string matching algorithm. SIAM J. Comput, 1990.

    Google Scholar 

  3. D. Breslauer et Z. Galil. An lower bound for parallel string matching. In Proc. of the 23rd Ann ACM Symp on theory of computing, 1991.

    Google Scholar 

  4. KL. Chung. A randomized parallel algorithm for string matching on hypercube. Pattern Recognition, 1992.

    Google Scholar 

  5. M. Crochemore et D. Perrin. Two-Way String-Matching. Journal of the ACM, Juillet 91.

    Google Scholar 

  6. R. Cypher et C.G. Plaxton. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Proc of the 22nd Ann Symp on theory of computing, 1990.

    Google Scholar 

  7. Z. Galil. Optimal parallel algorithms for string matching. Inform. and Control, 1985.

    Google Scholar 

  8. Z. Galil. A constant-time Optimal Parallel string-matching algorithm. Proc of the 24th ACM symp. on Theory of Comput., 1992.

    Google Scholar 

  9. A. Gibbons et W. Rytter. Efficient parallel algorithms. Cambridge University Press, 1988.

    Google Scholar 

  10. R.M. Karp et M.O. Rabin. Efficient randomized pattern matching algorithms. IBM J. Res. Dev., 1987.

    Google Scholar 

  11. D.E. Knuth, J.H. Morris et U.R. Pratt. Fast Pattern Matching in strings. SIAM J. Comput, 1977.

    Google Scholar 

  12. D. Nassimi et S. Sahni. Data broadcasting in SIMD computers. IEEE Trans. on Comp, 1981.

    Google Scholar 

  13. S. Ranka et S. Sahni. Hypercube Algorithms. Springer-Verlag, 1990.

    Google Scholar 

  14. U. Vishkin. Optimal parallel pattern matching in strings. ICALP, 1985.

    Google Scholar 

  15. A. Wu. Embedding of tree networks into hypercubes. J. of Parallel and Distributed Computing, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.T.P, Université Paris 7, 2 Place Jussieu, Paris Cedex 05

    L. Lestré

Authors
  1. L. Lestré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Maxime Crochemore Dan Gusfield

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lestré, L. (1994). Unit route upper bound for string-matching on hypercube. In: Crochemore, M., Gusfield, D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58094-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-58094-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58094-2

  • Online ISBN: 978-3-540-48450-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation