On String Matching in Chunked Texts

  • Hannu Peltola
  • Jorma Tarhio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4783)


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.


string matching experimental comparison Horspool algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baeza-Yates, R.: Improved string searching. Software: Practice and Experience 19(3), 257–271 (1989)CrossRefMathSciNetGoogle Scholar
  2. 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. 3.
    Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM 20(10), 762–772 (1977)CrossRefGoogle Scholar
  4. 4.
    Horspool, R.N.: Practical fast searching in strings. Software: Practice and Experience 10(6), 501–506 (1980)CrossRefGoogle Scholar
  5. 5.
    Hume, A., Sunday, D.: Fast string searching. Software: Practice and Experience 21(11), 1221–1248 (1991)CrossRefGoogle Scholar
  6. 6.
    Kim, J.Y., Shawe-Taylor, J.: Fast string matching using an n-gram algorithm. Software: Practice and Experience 24(1), 79–88 (1994)CrossRefGoogle Scholar
  7. 7.
    Lecroq, T.: Experiments on string matching in memory structures. Software: Practice and Experience 28(5), 561–568 (1998)CrossRefGoogle Scholar
  8. 8.
    Navarro, G., Raffinot, M.: Flexible pattern matching in strings. Cambridge University Press, Cambridge (2002)zbMATHGoogle Scholar
  9. 9.
    Raita, T.: Tuning the Boyer–Moore–Horspool string searching algorithm. Software: Practice and Experience 22(10), 879–884 (1992)CrossRefGoogle Scholar
  10. 10.
    Sunday, D.M.: A very fast substring search algorithm. Communications of the ACM 33(8), 132–142 (1990)CrossRefGoogle Scholar
  11. 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)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Hannu Peltola
    • 1
  • Jorma Tarhio
    • 1
  1. 1.Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FI-02015 HUTFinland

Personalised recommendations