![Dynamic programming / Computational complexity theory / Approximate string matching / Pattern matching / Time complexity / Fast Fourier transform / String searching algorithm / Matching / Knuth–Morris–Pratt algorithm / Theoretical computer science / Applied mathematics / Mathematics Dynamic programming / Computational complexity theory / Approximate string matching / Pattern matching / Time complexity / Fast Fourier transform / String searching algorithm / Matching / Knuth–Morris–Pratt algorithm / Theoretical computer science / Applied mathematics / Mathematics](https://www.pdfsearch.io/img/fa9ba25d3cd3c354bbd72d9399bc0a7b.jpg) Date: 2014-03-11 07:07:17Dynamic programming Computational complexity theory Approximate string matching Pattern matching Time complexity Fast Fourier transform String searching algorithm Matching Knuth–Morris–Pratt algorithm Theoretical computer science Applied mathematics Mathematics | | A black box for online approximate pattern matching Rapha¨el Clifforda,∗, Klim Efremenkob , Benny Poratc , Ely Poratc a Department of Computer Science, University of Bristol,UK University, Dept. of Computer Science, 5Add to Reading ListSource URL: www.cs.bris.ac.ukDownload Document from Source Website File Size: 268,49 KBShare Document on Facebook
|