Skip to main content
Springer Nature Link
Log in

On String Matching in Chunked Texts

  • Conference paper
Implementation and Application of Automata (CIAA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4783))

Included in the following conference series:

  • 618 Accesses

Abstract

We study exact string matching in special texts, which consist of consecutive fixed-length chunks where each position of a chunk has a character distribution of its own. This kind of setting can also be interpreted so that a chunk represents a character of a larger alphabet. If texts and patterns are of this kind, it may ruin the efficiency of common algorithms. We examine anomalies related to the Horspool and Sunday algorithms in this setting. In addition we present two new algorithms.

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.

Similar content being viewed by others

References

  1. Baeza-Yates, R.: Improved string searching. Software: Practice and Experience 19(3), 257–271 (1989)

    Article  MathSciNet  Google Scholar 

  2. Berry, T., Ravindran, S.: A fast string matching algorithm and experimental results. In: Proc. of the Prague Stringology Club Workshop 1999, Czech Technical University, Prague, Czech Republic, Collaborative Report DC-99-05, pp. 16–28 (1999)

    Google Scholar 

  3. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM 20(10), 762–772 (1977)

    Article  Google Scholar 

  4. Horspool, R.N.: Practical fast searching in strings. Software: Practice and Experience 10(6), 501–506 (1980)

    Article  Google Scholar 

  5. Hume, A., Sunday, D.: Fast string searching. Software: Practice and Experience 21(11), 1221–1248 (1991)

    Article  Google Scholar 

  6. Kim, J.Y., Shawe-Taylor, J.: Fast string matching using an n-gram algorithm. Software: Practice and Experience 24(1), 79–88 (1994)

    Article  Google Scholar 

  7. Lecroq, T.: Experiments on string matching in memory structures. Software: Practice and Experience 28(5), 561–568 (1998)

    Article  Google Scholar 

  8. Navarro, G., Raffinot, M.: Flexible pattern matching in strings. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  9. Raita, T.: Tuning the Boyer–Moore–Horspool string searching algorithm. Software: Practice and Experience 22(10), 879–884 (1992)

    Article  Google Scholar 

  10. Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM 33(8), 132–142 (1990)

    Article  Google Scholar 

  11. Zhu, R.F., Takaoka, T.: On improving the average case of the Boyer–Moore string matching algorithm. Journal of Information Processing 10(3), 173–177 (1987)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FI-02015 HUT, Finland

    Hannu Peltola & Jorma Tarhio

Authors
  1. Hannu Peltola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorma Tarhio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Holub Jan Žďárek

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peltola, H., Tarhio, J. (2007). On String Matching in Chunked Texts. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76336-9_16

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics