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

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

zbMATH Keywords

directed acyclic graphsFPT inside Pfunnelsgraph algorithmslabeled graphsparameterized algorithmsstring algorithmsstring matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(2)

• Chaining of maximal exact matches in graphs
• Co-lexicographically ordering automata and regular languages. I

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)