Skip to main content
Springer Nature Link
Log in

Alternative Algorithms for Bit-Parallel String Matching

  • Conference paper
String Processing and Information Retrieval (SPIRE 2003)

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

Included in the following conference series:

  • 598 Accesses

Abstract

We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme for long patterns. We also study a different bit-parallel algorithm, which keeps the history of examined characters in a bit-vector and where shifting is based on this bit-vector. We report experiments where we compared the new algorithms with existing ones. The simplified BNDM is the most promising of the new algorithms in practice.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

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. Arndt, J.: Jörgs useful and ugly BIT WIZARDRY page, http://www.jjj.de/bitwizardry/bitwizardrypage.html

  2. Boyer, R.S., Moore, J.S.: A Fast String Searching Algorithm. Communications of the ACM 20(10), 762–772 (1977)

    Article  Google Scholar 

  3. Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)

    MATH  Google Scholar 

  4. Galil, Z.: On Improving the Worst Case Running Time of the Boyer–Moore String Matching Algorithm. Communications of the ACM 22(9), 505–508 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Horspool, R.N.: Practical Fast Searching in Strings. Software — Practice and Experience 10(6), 501–506 (1980)

    Article  Google Scholar 

  6. Hume, A., Sunday, D.: Fast String Searching. Software — Practice and Experience 21(11), 1221–1248 (1991)

    Article  Google Scholar 

  7. Kytöjoki, J., Salmela, L., Tarhio, J.: Tuning string matching for huge pattern sets. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 211–224. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Navarro, G., Raffinot, M.: A Bit-parallel Approach to Suffix Automata: Fast Extended String Matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol. 1448, pp. 14–33. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Navarro, G., Raffinot, M.: Fast and Flexible String Matching by Combining Bitparallelism and Suffix automata. ACM Journal of Experimental Algorithms 5(4), 1–36 (2000)

    MathSciNet  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. Tarhio, J., Peltola, H.: String Matching in the DNA Alphabet. Software — Practice and Experience 27(7), 851–861 (1997)

    Article  Google Scholar 

  12. Vishkin, U.: Deterministic Sampling—a New Technique for Fast Pattern Matching. SIAM Journal of Computing 20(1), 22–40 (1991)

    Article  MathSciNet  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, FIN-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

Editors and Affiliations

  1. Department of Computing Science, University of Alberta, Canada

    Mario A. Nascimento

  2. Universidade Federal do Amazonas, Manaus, AM, Brasil

    Edleno S. de Moura

  3. INESC-ID/IST, R. Alves Redol 9, 1000, Lisboa, Portugal

    Arlindo L. Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peltola, H., Tarhio, J. (2003). Alternative Algorithms for Bit-Parallel String Matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2003. Lecture Notes in Computer Science, vol 2857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39984-1_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39984-1_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20177-9

  • Online ISBN: 978-3-540-39984-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics