Pattern matching with wildcards using words of shorter length

Zhang, Meng; Zhang, Yi; Hu, Liang

doi:10.1016/j.ipl.2010.09.011

Information Processing Letters

2010

DOI: 10.1016/j.ipl.2010.09.011

|View full text |Cite

Pattern matching with wildcards using words of shorter length

Meng Zhang

Yi Zhang

Liang Hu

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2017

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

Zhang

2017

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

We give faster methods to compute discrete convolutions. We assume that all the inputs are packed, that is, strings are packed into words such that each word is packed with [Formula: see text] characters, where w is the length of a machine word and ∑ is the alphabet. The output of our methods is also packed, that is, each word of the output contains more than one element of the result. The approach is based on the word-level parallelism and the FFT. Given two strings with m and n ( n ≥ m ) characters that are packed into [Formula: see text] and [Formula: see text] words respectively, the convolution of them can be computed in [Formula: see text] time, where [Formula: see text] by the FFT. Experiments show that our method is three times faster than the convolution using the standard trick. We consider the problem of pattern matching with wildcards on packed strings. It finds all the occurrences of a pattern in a text, both of which may contain wildcards. By the convolution of packed strings, we present algorithms that are faster than the previous [Formula: see text]-time algorithm, where m is the length of the pattern and n the length of the text. The algorithm runs in [Formula: see text] time, where occ is the number of occurrences of the pattern in the input. Experiments show that the method is faster than the bit-parallel wildcard matching algorithm for long patterns.

show abstract

Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

Zhang

2017

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Pattern matching with wildcards using words of shorter length

Cited by 1 publication

References 9 publications

Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

Fast Convolutions of Packed Strings and Pattern Matching with Wildcards

Contact Info

Product

Resources

About