@InProceedings{boneh_et_al:LIPIcs.CPM.2023.5,
author = {Boneh, Itai and Fried, Dvir and Micl\u{a}u\c{s}, Adrian and Popa, Alexandru},
title = {{Faster Algorithms for Computing the Hairpin Completion Distance and Minimum Ancestor}},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},
pages = {5:1--5:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-276-1},
ISSN = {1868-8969},
year = {2023},
volume = {259},
editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.5},
URN = {urn:nbn:de:0030-drops-179592},
doi = {10.4230/LIPIcs.CPM.2023.5},
annote = {Keywords: dynamic programming, incremental trees, exact algorithm}
}