Restricted and swap common superstring: a parameterized view

DOI10.1007/978-3-642-33293-7_7MaRDI QIDQ4899240zbMATH OpenOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• Restricted and swap common superstring: a multivariate algorithmic perspective
• Restricted common superstring and restricted common supersequence
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Cited in

(1)

• Restricted and swap common superstring: a multivariate algorithmic perspective

This page was built for publication: Restricted and swap common superstring: a parameterized view

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