TY  -  
T1  - Longest common substrings with k mismatches 
SN  -  /  
UR  - http://hdl.handle.net/10138/203401 
T3  -  
A1  - Flouri, Tomas; Giaquinta, Emanuele; Kobert, Kassian; Ukkonen, Esko 
A2  -  
PB  -  
Y1  - 2015 
LA  - eng 
AB  - The longest common substring with k-mismatches problem is to find, given two strings S-1 and S-2, a longest substring A(1) of S-1 and A(2) of S-2 such that the Hamming distance between A(1) and A(2) is... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - Combinatorial problems; String algorithms; Hamming distance; Longest common substring; 113 Computer and information sciences 
N1  -   
PP  -  
ER  -