Parallel String Matching Algorithms

DOI10.1108/EB005791MaRDI QIDQ3814826zbMATH OpenOpenAlexFDO

Authors Souad Ghanemi, D. J. Evans

Publication date 1988

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/eb005791

zbMATH Keywords

MIMD parallel computer systemsparallel algorithmpattern matchingstring searching

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to computer science (68-04) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 826050
• Parallel String Matching
• scientific article; zbMATH DE number 3911754
• Optimal parallel pattern matching in strings
• Faster Parallel String Matching via Larger Deterministic Samples

Cites work

• A fast string searching algorithm
• Efficient string matching
• Fast Pattern Matching in Strings
• On improving the worst case running time of the Boyer-Moore string matching algorithm

Cited in

(12)

• Algorithms for pattern matching
• Parallel Algorithms for Term Matching
• A constant-time optimal parallel string-matching algorithm
• Constant-Time Randomized Parallel String Matching
• scientific article; zbMATH DE number 1984233 (Why is no real title available?)
• Parallel algorithms to align multiple strings in the context of web data extraction
• scientific article; zbMATH DE number 1911105 (Why is no real title available?)
• scientific article; zbMATH DE number 826050 (Why is no real title available?)
• Heterogeneous parallel string matching algorithm based on mobile platform
• On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
• Parallel String Matching
• Fast parallel string prefix-matching

This page was built for publication: Parallel String Matching Algorithms

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