Restricted and swap common superstring: a multivariate algorithmic perspective
From MaRDI portal
Publication:494787
Recommendations
- Restricted and swap common superstring: a parameterized view
- Restricted common superstring and restricted common supersequence
- More on the complexity of common superstring and supersequence problems
- Solving 3-superstring in \(3^{n/3}\) time
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1420898 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithms on Strings, Trees and Sequences
- Algorithms – ESA 2004
- Color-coding
- Cross-composition: a new technique for kernelization lower bounds
- Efficient special cases of pattern matching with swaps
- Infeasibility of instance compression and succinct PCPs for NP
- Kernel bounds for disjoint cycles and disjoint paths
- Linear approximation of shortest superstrings
- Mathematical Foundations of Computer Science 2005
- On problems without polynomial kernels
- Parametrized complexity theory.
- Pattern Matching with Swaps
- Reflections on multivariate algorithmics and problem parameterization
- Restricted and swap common superstring: a parameterized view
- Restricted common superstring and restricted common supersequence
- Some APX-completeness results for cubic graphs
- Swap and mismatch edit distance
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
Cited in
(3)
This page was built for publication: Restricted and swap common superstring: a multivariate algorithmic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494787)
