Parameterized algorithms for string matching to DAGs: funnels and beyond

DOI10.4230/LIPICS.CPM.2023.7MaRDI QIDQ6622011zbMATH OpenFDO

Authors Manuel O. Cáceres

Publication date 21 October 2024

zbMATH Keywords

graph algorithmsdirected acyclic graphsparameterized algorithmsstring matchingstring algorithmslabeled graphsfunnelsFPT inside P

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• Chaining of maximal exact matches in graphs

This page was built for publication: Parameterized algorithms for string matching to DAGs: funnels and beyond

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