Parallel Suffix–Prefix-Matching Algorithm and Applications
From MaRDI portal
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Combinatorics on words (68R15) Pattern recognition, speech recognition (68T10) Computing methodologies for text processing; mathematical typography (68U15) Distributed algorithms (68W15)
Recommendations
Cited in
(22)- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Parallel construction and query of index data structures for pattern matching on square matrices
- A fast algorithm for the all-pairs suffix-prefix problem
- Parallel computation for the all-pairs suffix-prefix problem
- Efficient text fingerprinting via Parikh mapping
- Parallel two dimensional witness computation
- Finding all periods and initial palindromes of a string in parallel
- On minimizing pattern splitting in multi-track string matching
- Optimal parallel pattern matching in strings
- Optimal parallel algorithms for Prefix Matching
- scientific article; zbMATH DE number 2112398 (Why is no real title available?)
- scientific article; zbMATH DE number 826050 (Why is no real title available?)
- scientific article; zbMATH DE number 826061 (Why is no real title available?)
- Simple Optimal Parallel Multiple Pattern Matching
- Scalable Suffix Sorting on a Multicore Machine
- 2D Lyndon words and applications
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
- Parallel pattern matching algorithm with sparse gap constraint
- Optimal parallel suffix tree construction
- N-cube string matching algorithm with long texts
- Fast parallel string prefix-matching
- Optimal prefix and suffix queries on texts
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)
