scientific article; zbMATH DE number 2081011

MaRDI QIDQ4474112zbMATH OpenFDO

Authors Jens Gramm, Rolf Niedermeier, Peter Rossmanith

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230441.htm

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Fixed-parameter algorithms for CLOSEST STRING and related problems
• More efficient algorithms for closest string and substring problems
• On the closest string and substring problems
• Closest Substring Problems with Small Distances
• A three-string approach to the closest string problem

Cited in

(22)

• Consensus string problem for multiple regular languages
• On the hardness of the consensus string problem
• Configurations and minority in the string consensus problem
• Enumerating Neighbour and Closest Strings
• A basic parameterized complexity primer
• On the kernelization complexity of string problems
• On the kernelization complexity of string problems
• Hard problems in similarity searching
• Configurations and minority in the string consensus problem
• Efficient algorithms for consensus string problems minimizing both distance sum and radius
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• More efficient algorithms for closest string and substring problems
• A GRASP algorithm for the closest string problem using a probability-based heuristic
• Consensus string problem for multiple regular languages
• On approximating string selection problems with outliers
• Optimum Solution of the Closest String Problem via Rank Distance
• Exact algorithm and heuristic for the closest string problem
• Improved optimization modelling for the closest string and related problems
• An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
• A recursive exact algorithm for the closest string problem
• On the complexity of finding common approximate substrings.
• Efficient solutions for the far from most string problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474112)