pdfformat: 

@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 = {{LinearTime Algorithm for Long LCF with k Mismatches}}, booktitle = {Annual Symposium on Combinatorial Pattern Matching (CPM 2018)}, pages = {23:123:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770743}, ISSN = {18688969}, year = {2018}, volume = {105}, editor = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2018/8686}, URN = {urn:nbn:de:0030drops86869}, doi = {10.4230/LIPIcs.CPM.2018.23}, annote = {Keywords: longest common factor, longest common substring, Hamming distance, heavylight decomposition, difference cover} }
Keywords:  longest common factor, longest common substring, Hamming distance, heavylight decomposition, difference cover  
Seminar:  Annual Symposium on Combinatorial Pattern Matching (CPM 2018)  
Issue date:  2018  
Date of publication:  18.05.2018 