Multivariate Algorithmics for NP-Hard String Problems

Abstract : 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.
Complete list of metadatas

Cited literature [152 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01260610
Contributor : Laurent Bulteau <>
Submitted on : Friday, January 22, 2016 - 1:58:19 PM
Last modification on : Tuesday, March 5, 2019 - 1:50:07 PM
Long-term archiving on : Saturday, April 23, 2016 - 10:30:23 AM

File

BHKN-eatcs14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01260610, version 1

Collections

Citation

Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier. Multivariate Algorithmics for NP-Hard String Problems. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2014, 114. ⟨hal-01260610⟩

Share

Metrics

Record views

257

Files downloads

330