Longest common substrings with k mismatches

The longest common substring with k-mismatches problem is to find, given two strings S1 and S2, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is ≤k. We introduce a practical O(nm) time and O(1) space solution for this problem, where n and m are the length...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 115; H. 6-8; S. 643 - 647
Hauptverfasser:	Flouri, Tomas, Giaquinta, Emanuele, Kobert, Kassian, Ukkonen, Esko
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.06.2015 Elsevier Sequoia S.A
Schlagworte:	Algorithms Combinatorial problems Hamming distance Longest common substring Mathematical problems String algorithms Studies Vector space String algorithms Combinatorial problems Longest common substring Hamming distance
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!