Restricted and Swap Common Superstring: A Parameterized View
From MaRDI portal
Publication:4899240
DOI10.1007/978-3-642-33293-7_7zbMath1318.68207OpenAlexW119125763WikidataQ57518479 ScholiaQ57518479MaRDI QIDQ4899240
Riccardo Dondi, Giancarlo Mauri, Italo Zoppis, Paola Bonizzoni
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_7
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Related Items (1)
This page was built for publication: Restricted and Swap Common Superstring: A Parameterized View