Genetic Design of Drugs Without Side-Effects

DOI10.1137/S0097539701397825zbMath1029.68159OpenAlexW1964502706MaRDI QIDQ4429675

Bin Ma, Zimao Li, Guo Jun Li, Lusheng Wang, Xiaotie Deng

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539701397825

zbMATH Keywords

approximation algorithmscomputational molecular biologydistinguishing substring selection

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)

Related Items (12)

Generalized closest substring encryption ⋮ Parameterized Complexity and Subexponential-Time Computability ⋮ Strong computational lower bounds via parameterized complexity ⋮ Mathematical programming in computational biology: an annotated bibliography ⋮ Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ On approximating string selection problems with outliers ⋮ LP-based heuristics for the distinguishing string and substring selection problems ⋮ A three-string approach to the closest string problem ⋮ Unnamed Item ⋮ Consensus strings with small maximum distance and small distance sum ⋮ 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: Genetic Design of Drugs Without Side-Effects