Covering problems for partial words and for indeterminate strings

DOI10.1007/978-3-319-13075-0_18MaRDI QIDQ6827548zbMATH OpenFDO

Authors Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń

Publication date 11 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://kclpure.kcl.ac.uk/portal/en/publications/55770656-4c9d-4cc3-aa2b-cb92d3cc361c

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

This page was built for publication: Covering problems for partial words and for indeterminate strings

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