Parallel pattern matching algorithm with sparse gap constraint

DOI10.13328/J.CNKI.JOS.005326MaRDI QIDQ5382004zbMATH OpenFDO

Authors Kailai Zhou, Hong Chen, Ziyi Xiong, Cuiping Li, Hui Sun

Publication date 21 June 2019

zbMATH Keywords

parallel algorithmpattern matchingwildcardssuffix automatonsparse gaps constraint

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• Multi-pattern matching algorithm with wildcards based on bit-parallelism
• Pattern matching with arbitrary-length wildcards
• New algorithms for pattern matching with wildcards and length constraints
• Parallel String Matching
• Parallel Suffix–Prefix-Matching Algorithm and Applications

Cited in

(2)

• Pattern matching with arbitrary-length wildcards
• Multi-pattern matching algorithm with wildcards based on bit-parallelism

This page was built for publication: Parallel pattern matching algorithm with sparse gap constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382004)