Genetic Design of Drugs Without Side-Effects

DOI10.1137/S0097539701397825zbMath1029.68159MaRDI 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 algorithms; computational molecular biology; distinguishing substring selection

Mathematics Subject Classification ID

90C27: Combinatorial optimization

92D20: Protein sequences, DNA sequences

68W25: Approximation algorithms

Related Items

Unnamed Item, Efficient Algorithms for the Closest String and Distinguishing String Selection Problems, Randomized fixed-parameter algorithms for the closest string problem, Generalized closest substring encryption, On approximating string selection problems with outliers, A three-string approach to the closest string problem, Strong computational lower bounds via parameterized complexity, Mathematical programming in computational biology: an annotated bibliography, Consensus strings with small maximum distance and small distance sum, Parameterized computation and complexity: a new approach dealing with NP-hardness, LP-based heuristics for the distinguishing string and substring selection problems, Parameterized Complexity and Subexponential-Time Computability