Sub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach

author: Nagaraj T. Janakiraman, Department of Electrical and Computer Engineering, Texas A&M University
published: Dec. 1, 2017,   recorded: August 2017,   views: 809

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


We consider the problem of querying a string (or, a database) of length N bits to determine all the locations where a substring (query) of length M appears either exactly or is within a Hamming distance of K from the query. We assume that sketches of the original signal can be computed offline and stored. Using a sparse Fourier transform computation based approach, we show that all such matches can be determined with high probability in sub-linear time.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: