Skip to main content
SpringerLink
Log in

Fast string matching algorithms for run-length coded strings

Schnelle Algorithmen zum Auffinden runlängen-codierter Zeichenketten

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Given a run-length coded text of length 2n and a run-length coded pattern of length 2m,m≪n commonly, this paper first presents anO(n+m) time sequential algorithm for string matching, then presents anO(1) time parallel algorithm on a two-dimensionalm×n mesh with a reconfigurable bus system.

Zusammenfassung

Gegeben seien ein runlängen-codierter Text der Länge 2n sowie ein runlängen-codiertes Muster der Länge 2m, wobei üblicherweisem≪n gilt. Wir geben zuerst einen zeit-sequentiellenO(n+m)-Suchalgorithmus an und dann einen parallelenO(1)-Algorithmus. Dieser läuft auf einemm×n-Gitter mit rekonfigurierbarem Bus-System.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A. V., Corasick, M. J.: Efficient string matching: an aid to bibliographic search. Comm. ACM.18, 333–340 (1975).

    Google Scholar 

  2. Bell, T. C., Cleary, J. G., Witten, I. H.: Text compression. Englewood Cliffs: Prentice Hall 1990.

    Google Scholar 

  3. Bunke, H., Csirik, J.: An algorithm for matching run-length coded strings. Computing50, 297–314 (1993).

    Google Scholar 

  4. Boyer, R. S., Moore, J. S.: A fast string searching algorithm. Comm. ACM.20, 762–772 (1977).

    Google Scholar 

  5. Chen, G. H.: AnO(1) time algorithm for string matching. Int. J. Comput. Math.42, 185–191 (1992).

    Google Scholar 

  6. Chung, K. L.: An improvedO(1) time algorithm for string matching. Research Report, Dept. of Information Mgmt., National Taiwan Institute of Technology, Dec. 1993.

  7. Galil, Z.: Optimal parallel algorithms for string matching. Inf. Control67, 144–157 (1985).

    Google Scholar 

  8. Karp, R. M., Rabin, M. O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.31, 249–260 (1987).

    Google Scholar 

  9. Knuth, D. E., Morris, J. H., Pratt, V. R.: Fast pattern matching in string. SIAM J. Comput.6, 323–350 (1977).

    Google Scholar 

  10. Miller, R., Prasanna-Kumar, V. K., Reisis, D. I., Stout, Q. F.: Parallel computations on reconfigurable meshes. IEEE Trans. Comput.42, 678–692 (1993).

    Google Scholar 

  11. Rothstein, J.: Bus automata, brains, and mental models. IEEE Trans. Systems Man Cybernet.18, 522–531 (1988).

    Google Scholar 

  12. Vishkin, U.: Optimal parallel pattern matching in strings. Inf. Control67, 91–113 (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, National Taiwan Institute of Technology, 10672, Taipei, Taiwan Republic of China

    K. -L. Chung

Authors
  1. K. -L. Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chung, K.L. Fast string matching algorithms for run-length coded strings. Computing 54, 119–125 (1995). https://doi.org/10.1007/BF02238127

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02238127

AMS Subject Classifications

Key words

Search

Navigation