scientific article; zbMATH DE number 2081011
From MaRDI portal
Publication:4474112
zbMath1077.68659MaRDI QIDQ4474112
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)
Related Items (12)
Configurations and minority in the string consensus problem ⋮ Hard problems in similarity searching ⋮ A Basic Parameterized Complexity Primer ⋮ On the hardness of the consensus string problem ⋮ Improved optimization modelling for the closest string and related problems ⋮ On the complexity of finding common approximate substrings. ⋮ An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ Consensus String Problem for Multiple Regular Languages ⋮ Exact algorithm and heuristic for the closest string problem ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Consensus string problem for multiple regular languages
This page was built for publication:
