Article

A fast bit-parallel algorithm for matching extended regular expressions

Authors:

Hiroaki Yamamoto,

Takashi MiyazakiAuthors Info & Claims

COCOON'03: Proceedings of the 9th annual international conference on Computing and combinatorics

Pages 222 - 231

Published: 25 July 2003 Publication History

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₁ ... a_n of length n, find all occurrences of substrings which match r. We will present a new bit-parallel pattern matching algorithm which runs in O((mn² + ex(r)n³)/W) time and O((mn + ex(r)n²)/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.

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.

Digital Library

Google Scholar

[2]

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

Digital Library

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.

Digital Library

Google Scholar

[4]

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

Digital Library

Google Scholar

[5]

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

Crossref

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.

Digital Library

Google Scholar

[8]

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

Digital Library

Google Scholar

[9]

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

Crossref

Google Scholar

[10]

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

Digital Library

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.

Digital Library

Google Scholar

[12]

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

Digital Library

Google Scholar

Cited By

View all

Roşu G(2007)An effective algorithm for the membership problem for extended regular expressionsProceedings of the 10th international conference on Foundations of software science and computational structures10.5555/1760037.1760063(332-345)Online publication date: 24-Mar-2007
https://dl.acm.org/doi/10.5555/1760037.1760063

Recommendations

Fast bit-parallel matching for network and regular expressions
SPIRE'10: Proceedings of the 17th international conference on String processing and information retrieval

In this paper, we extend the SHIFT-AND approach by Baeza-Yates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expressions without Kleene-closure and useful in applications such as bioinformatics and ...
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs

The aim of the paper is to design efficient bit-parallel algorithms for translating regular expressions into nondeterministic finite automata (NFAs). Let r be a regular expression over an alphabet Σ, and let n be the length of r and let m be the number ...
A fast bit-parallel multi-patterns string matching algorithm for biological sequences
ISB '10: Proceedings of the International Symposium on Biocomputing

The problem of searching occurrences of a pattern P[0...m-1] in the text T[0...n-1>with m ≤ n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact string matching problem. In the present day, pattern matching is a ...

Comments

Information & Contributors

Information

Published In

COCOON'03: Proceedings of the 9th annual international conference on Computing and combinatorics

July 2003

560 pages

ISBN:3540405348

Editors:
Tandy Warnow
University of Texas at Austin, Department of Computer Science, Austin, TX
,
Binhai Zhu
Montana State University, Department of Computer Science, Bozeman, MT

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 25 July 2003

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Roşu G(2007)An effective algorithm for the membership problem for extended regular expressionsProceedings of the 10th international conference on Foundations of software science and computational structures10.5555/1760037.1760063(332-345)Online publication date: 24-Mar-2007
https://dl.acm.org/doi/10.5555/1760037.1760063

Abstract

References

Cited By

Recommendations

Fast bit-parallel matching for network and regular expressions

Bit-Parallel Algorithms for Translating Regular Expressions into NFAs

A fast bit-parallel multi-patterns string matching algorithm for biological sequences

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations