Faster algorithms for computing the hairpin completion distance and minimum ancestor

DOI10.4230/LIPICS.CPM.2023.5MaRDI QIDQ6622008zbMATH OpenFDO

Authors Itai Boneh, Dvir Fried, Adrian Miclăuş, Alexandru Popa

Publication date 21 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2023.5

zbMATH Keywords

dynamic programmingexact algorithmincremental trees

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• Hairpin completion distance lower bound

This page was built for publication: Faster algorithms for computing the hairpin completion distance and minimum ancestor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622008)