Multivariate Algorithmics for NP-Hard String Problems
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...