Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2003: Computing and Combinatorics pp 222–231Cite as

A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions

  • Conference paper
  • First Online:

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

Abstract

This paper addresses the extended regular expression matching problem: given an extended regular expression (a regular expression with intersection and complement) r of length m and a text string x = a 1 ··· a n of length n, find all occurrences of substrings which m r. We will present a new bit-parallel pattern matching algorithm which runs in O((mn 2 + ex(r)n 3)/W) time and O((mn + ex(r)n 2)/W) space, where ex(r) is the number of extended operators (intersection and complement) occurring in r, and W is word-length of a computer. In addition, we actually implement the proposed algorithm and evaluate the performance.

This research has been supported by the REFEC

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, Algorithms for finding patterns in strings, In J.V. Leeuwen, ed. Handbook of theoretical computer science, Elsevier Science Pub., 1990.

    Google Scholar 

  2. A. Apostolico, Z. Galil ed., Pattern Matching Algorithms, Oxford University Press, 1997.

    Google Scholar 

  3. R. Baeza-Yates and G. Gonnet, Fast Text Searching for Regular Expressions or Automaton Searching on Tries, J. of the ACM, 43,6, 915–936, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, Addison Wesley, 1999.

    Google Scholar 

  5. J.R. Knight and E.W. Myers, Super-Pattern matching, Algorithmica, 13,1–2, 211–243, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  6. S.C. Hirst, A New Algorithm Solving Membership of Extended Regular Expressions, Tech. Report, The University of Sydney, 1989.

    Google Scholar 

  7. J.E. Hopcroft and J.D. Ullman, Introduction to automata theory language and computation, Addison Wesley, Reading Mass, 1979.

    Google Scholar 

  8. G. Myers, A Four Russians Algorithm for Regular Expression Pattern Matching, J. of the ACM, 39,4, 430–448, 1992.

    MATH  MathSciNet  Google Scholar 

  9. E. Myers and W. Miller, Approximate Matching of Regular Expressions, Bull. of Mathematical Biology, 51,1, 5–37, 1989.

    MATH  MathSciNet  Google Scholar 

  10. G. Navarro and M. Raffinot, Compact DFA Representation for Fast Regular Expression Search, Proc. WAE2001, LNCS 2141, 1–12, 2001.

    Google Scholar 

  11. S. Wu, U. Manber and E. Myers, A Sub-Quadratic Algorithm for Approximate Regular Expression Matching, J. of Algorithm, 19, 346–360, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  12. H. Yamamoto, A New Recognition Algorithm for Extended Regular Expressions, Proc. ISAAC2001, LNCS 2223, 267–277, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering, Shinshu University, 4-17-1 Wakasato, Nagano-shi, 380-8553, Japan

    Hiroaki Yamamoto

  2. Nagano National College of Technology, 716 Tokuma, Nagano-shi, 381-8550, Japan

    Takashi Miyazaki

Authors
  1. Hiroaki Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Miyazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamoto, H., Miyazaki, T. (2003). A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation