Abstract
Given a text of length n and a pattern of length m over a finite alphabet Σ, we consider the string matching (SM) problem with variable length don't cares (VLDCs), where a VLDC (not in Σ) in the pattern can match any substring in the text. This paper presents a first time-optimal parallel SM algorithm with VLDCs. The proposed algorithm can be performed in O(1) time on an m × n mesh-connected computer with a reconfigurable bus system using O( nm) processors. The previous fastest known parallel SM algorithm takes O(log n) time on the EREW PRAM model with O( nm/log n) processors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
