Tatiana A. Starikovskaya. Longest Common Substring with Approximately k Mismatches. In Roberto Grossi, Moshe Lewenstein, editors, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. Volume 54 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Starikovskaya16, title = {Longest Common Substring with Approximately k Mismatches}, author = {Tatiana A. Starikovskaya}, year = {2016}, doi = {10.4230/LIPIcs.CPM.2016.21}, url = {http://dx.doi.org/10.4230/LIPIcs.CPM.2016.21}, researchr = {https://researchr.org/publication/Starikovskaya16}, cites = {0}, citedby = {0}, booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel}, editor = {Roberto Grossi and Moshe Lewenstein}, volume = {54}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-012-5}, }