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, 5

First Page		Document Content
Date: 2014-03-11 07:07:17 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		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, 5 Add to Reading List Source URL: www.cs.bris.ac.uk Download Document from Source Website File Size: 268,49 KB Share Document on Facebook

	Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK DocID: 1xVgx - View Document
	SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2 DocID: 1vgge - View Document
	Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, France DocID: 1v6Pd - View Document
	LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression Grammars DocID: 1utvV - View Document
	Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID# DocID: 1uq9c - View Document