Fundamentals of Computation Theory

DOI10.1007/b11926zbMath1278.68351OpenAlexW2249105474MaRDI QIDQ5900797

Jiong Guo, Rolf Niedermeier, Jens Gramm

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11926

zbMATH Keywords

computational biologyapproximation algorithmsparameterized complexityexact algorithmsalgorithms and complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08) Algorithms on strings (68W32)

Related Items (10)

On the ordered list subgraph embedding problems ⋮ Parameterized Complexity and Subexponential-Time Computability ⋮ Strong computational lower bounds via parameterized complexity ⋮ Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ Time series shapelets: a novel technique that allows accurate, interpretable and fast classification ⋮ A three-string approach to the closest string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ Slightly Superexponential Parameterized Problems ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness ⋮ Randomized fixed-parameter algorithms for the closest string problem

This page was built for publication: Fundamentals of Computation Theory