@InProceedings{boneh_et_al:LIPIcs.CPM.2024.11,
author = {Boneh, Itai and Fried, Dvir and Golan, Shay and Kraus, Matan},
title = {{Hairpin Completion Distance Lower Bound}},
booktitle = {35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-326-3},
ISSN = {1868-8969},
year = {2024},
volume = {296},
editor = {Inenaga, Shunsuke and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.11},
URN = {urn:nbn:de:0030-drops-201215},
doi = {10.4230/LIPIcs.CPM.2024.11},
annote = {Keywords: Fine-grained complexity, Hairpin completion, LCS}
}