The fine-grained complexity of episode matching

DOI10.4230/LIPICS.CPM.2022.4MaRDI QIDQ6496830zbMATH OpenFDO

Authors Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann

Publication date 6 May 2024

zbMATH Keywords

longest common subsequencepattern matchingfine-grained complexity

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• Faster space-efficient STR-IC-LCS computation

This page was built for publication: The fine-grained complexity of episode matching

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