Fundamentals of Computation Theory
From MaRDI portal
Publication:5900797
DOI10.1007/b11926zbMath1278.68351MaRDI 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
computational biology; approximation algorithms; parameterized complexity; exact algorithms; algorithms and complexity
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
92-08: Computational methods for problems pertaining to biology
68W32: Algorithms on strings
Related Items
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems, Slightly Superexponential Parameterized Problems, Randomized fixed-parameter algorithms for the closest string problem, On the ordered list subgraph embedding problems, Time series shapelets: a novel technique that allows accurate, interpretable and fast classification, A three-string approach to the closest string problem, Strong computational lower bounds via parameterized complexity, A GRASP algorithm for the closest string problem using a probability-based heuristic, Parameterized computation and complexity: a new approach dealing with NP-hardness, Parameterized Complexity and Subexponential-Time Computability