Parallel Suffix–Prefix-Matching Algorithm and Applications
From MaRDI portal
Publication:4714555
DOI10.1137/S0097539792190157zbMath0858.68089MaRDI QIDQ4714555
Krishna V. Palem, Gad M. Landau, Zvi M. Kedem
Publication date: 7 November 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Pattern recognition, speech recognition (68T10) Distributed algorithms (68W15) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (8)
Parallel two dimensional witness computation ⋮ Finding all periods and initial palindromes of a string in parallel ⋮ Optimal parallel algorithms for Prefix Matching ⋮ 2D Lyndon words and applications ⋮ Optimal parallel suffix tree construction ⋮ Optimal prefix and suffix queries on texts ⋮ Efficient text fingerprinting via Parikh mapping ⋮ Parallel construction and query of index data structures for pattern matching on square matrices
This page was built for publication: Parallel Suffix–Prefix-Matching Algorithm and Applications
