Landau-Vishkin k-mismatch string matching

Jacob Engelbrecht engel at
Tue Aug 24 09:52:50 EST 1993

Has anyone knowledge of an implementaion of Landau-Vishkin Approximate
string matching.

In other words, I want to search sequence databases for short patterns
(~10 bases) allowing for mismatches.  I am after a C-code
implementation of a fast algorithm doing that.

I have the understanding that the Landau-Vishkin algortihm represent
the state of the art ?

Jacob Engelbrecht

Center for Biological Sequence Analysis
Technical University of Denmark

email engel at

More information about the Bio-soft mailing list