Parameterized Complexity Analysis for the Closest String with Wildcards Problem

DOI10.1007/978-3-319-07566-2_15zbMath1407.68225OpenAlexW1499807604MaRDI QIDQ5165600

Liat Rozenberg, Danny Hermelin

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07566-2_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (1)

Periodicity in data streams with wildcards

This page was built for publication: Parameterized Complexity Analysis for the Closest String with Wildcards Problem