Parallel Suffix–Prefix-Matching Algorithm and Applications

DOI10.1137/S0097539792190157MaRDI QIDQ4714555zbMATH OpenFDO

Authors Gad M. Landau, Krishna Palem, Zvi Kedem

Publication date 7 November 1996

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539792190157

zbMATH Keywords

pattern matchingstring matchingmultidimensional pattern matchingpattern-occurrence detection

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorics on words (68R15) Distributed algorithms (68W15) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Fast parallel string prefix-matching
• Optimal parallel algorithms for Prefix Matching
• scientific article; zbMATH DE number 826061
• Optimal parallel pattern matching in strings

Cited in

(21)

• On minimizing pattern splitting in multi-track string matching
• Optimal prefix and suffix queries on texts
• Parallel computation for the all-pairs suffix-prefix problem
• N-cube string matching algorithm with long texts
• Optimal parallel suffix tree construction
• Parallel two dimensional witness computation
• Parallel pattern matching algorithm with sparse gap constraint
• Parallel construction and query of index data structures for pattern matching on square matrices
• scientific article; zbMATH DE number 826061 (Why is no real title available?)
• Finding all periods and initial palindromes of a string in parallel
• On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
• A fast algorithm for the all-pairs suffix-prefix problem
• Optimal parallel pattern matching in strings
• Efficient text fingerprinting via Parikh mapping
• Optimal parallel algorithms for Prefix Matching
• Scalable Suffix Sorting on a Multicore Machine
• Simple Optimal Parallel Multiple Pattern Matching
• 2D Lyndon words and applications
• scientific article; zbMATH DE number 826050 (Why is no real title available?)
• Fast parallel string prefix-matching
• scientific article; zbMATH DE number 2112398 (Why is no real title available?)

This page was built for publication: Parallel Suffix–Prefix-Matching Algorithm and Applications

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