Optimal parallel algorithms for string matching

DOI10.1016/S0019-9958(85)80031-0zbMath0588.68022MaRDI QIDQ3716298

Zvi Galil

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

parallel computationPRAMWRAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (25)

On two-dimensional pattern matching by optimal parallel algorithms ⋮ Multidimensional period recovery ⋮ Finding all periods and initial palindromes of a string in parallel ⋮ Fast string matching with k differences ⋮ Finding the cyclic covers of a string ⋮ Fast parallel Lyndon factorization with applications ⋮ On the lower bound for parallel string matching ⋮ Towards optimal packed string matching ⋮ Parallel tree pattern matching ⋮ Efficient string matching on packed texts ⋮ Closest periodic vectors in \(L_p\) spaces ⋮ Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays ⋮ Optimal parallel algorithms for Prefix Matching ⋮ Parallel detection of all palindromes in a string ⋮ Fast parallel string prefix-matching ⋮ Real-Time Streaming String-Matching ⋮ A string-matching algorithm for the CREW PRAM ⋮ Efficient CRCW-PRAM algorithms for universal substring searching ⋮ Forty Years of Text Indexing ⋮ Fast parallel and serial multidimensional approximate array matching ⋮ Parallel finding all initial palindromes and periods of a string on reconfigurable meshes ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Approximate periodicity ⋮ Parallel String Matching ⋮ Finding approximate palindromes in strings

This page was built for publication: Optimal parallel algorithms for string matching