journal article
oaidoi:10.1016/0304-3975(86)90178-7

Efficient string matching with k mismatches

Authors
Publication date
31 December 1986
Publisher
Published by Elsevier B.V.
Doi

    Abstract

    AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches. The algorithm runs in O(k(m log m + n)) time

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0304-3975(86)90178...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.