Multivariate Algorithmics for NP-Hard String Problems

@article{Bulteau2014MultivariateAF,
  title={Multivariate Algorithmics for NP-Hard String Problems},
  author={Laurent Bulteau and Falk H{\"u}ffner and Christian Komusiewicz and Rolf Niedermeier},
  journal={Bulletin of the EATCS},
  year={2014},
  volume={114}
}
String problems arise in various applications ranging from text mining to biological sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed-parameter) tractable special cases of these problems. We survey parameterized and multivariate algorithmics results for NP-hard string problems and identify challenges for future research.