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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 115; číslo 6-8; s. 643 - 647
Hlavní autori:	Flouri, Tomas, Giaquinta, Emanuele, Kobert, Kassian, Ukkonen, Esko
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.06.2015 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!