Faster algorithms for string matching with k mismatches

The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the text T. Currently, the fastest algorithms for this problem are the following. The Galil–Giancarlo algorithm finds all locations where the patte...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of algorithms Jg. 50; H. 2; S. 257 - 275
Hauptverfasser:	Amir, Amihood, Lewenstein, Moshe, Porat, Ely
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 01.02.2004 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximate string matching Combinatorial algorithms on words Computer science; control theory; systems Design and analysis of algorithms Exact sciences and technology Hamming distance Theoretical computing Hamming distance Approximate string matching Combinatorial algorithms on words Design and analysis of algorithms Error estimation Computer theory Algorithm Mismatching String matching
ISSN:	0196-6774, 1090-2678
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!