by Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Reference:
Linear-Time Algorithm for Long LCF with k Mismatches (Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen), In Annual Symposium on Combinatorial Pattern Matching (CPM 2018) (Gonzalo Navarro, David Sankoff, Binhai Zhu, eds.), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, volume 105, 2018.
Bibtex Entry:
@InProceedings{charalampopoulos_et_al:LIPIcs:2018:8686,
author = {Panagiotis Charalampopoulos and Maxime Crochemore and Costas S. Iliopoulos and Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen},
title = {{Linear-Time Algorithm for Long LCF with k Mismatches}},
booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
doi = {10.4230/LIPIcs.CPM.2018.23},
annote = {Keywords: longest common factor, longest common substring, Hamming distance, heavy-light decomposition, difference cover}
}