We propose a couple of oracle construction methods for quantum pattern matching. One of the constructs is based upon the conventional string comparison method. This, along with a unique input state preparation, when combined with the Grover’s search algorithm, results in a deterministic exact and partial pattern matching logic. The other method generates a superposition of Hamming distances between the searched pattern and all the substrings formed from the input string. The measurement statistics from a large ensemble would provide data on the closest match. We show that this method can leverage parallel computing for enhanced performance. Alternatively, it can also be combined with the minimum finding algorithm for a deterministic outcome.