Back to Results
First PageMeta Content
Dynamic programming / Computational complexity theory / Analysis of algorithms / String matching algorithms / Approximate string matching / Pattern matching / String searching algorithm / Time complexity / Matching / Theoretical computer science / Applied mathematics / Mathematics


A filtering algorithm for k-mismatch with don’t cares Rapha¨el Clifford1 and Ely Porat2 1 2
Add to Reading List

Document Date: 2014-03-11 07:07:18


Open Document

File Size: 160,15 KB

Share Result on Facebook

City

Ramat-Gan / Bristol / /

Company

Kalai / Cambridge University Press / MIT Press / /

Country

Israel / /

/

Event

Reorganization / /

Facility

UK clifford@cs.bris.ac.uk Bar-Ilan University / University of Bristol / /

IndustryTerm

fundamental tools / image processing / naive algorithm / time pattern matching algorithm / biological applications / linear time solutions / search tool / cares algorithm / search algorithm / k-mismatch algorithm / folklore algorithm / non-naive algorithms / large scale data processing / /

Organization

Cambridge University / Bar-Ilan University / University of Bristol / MIT / /

Person

Proc / /

Position

editor / Prime Minister / /

PublishedMedium

SIAM journal on Computing / Theoretical Computer Science / Communications of the ACM / Theory of Computing / /

Technology

RAM / filtering algorithm / bioinformatics / facial recognition / search algorithm / time pattern matching algorithm / filtering algorithms / counting algorithm / time algorithm / string matching algorithm / k-mismatch algorithm / naive algorithm / J. Algorithms / cares algorithm / using Algorithm / image processing / algorithms The algorithm / non-naive algorithms / folklore algorithm / /

SocialTag