Publication:4252342

zbMath0940.92011MaRDI QIDQ4252342

Bin Ma, J. Kevin Lanctot, Louxin Zhang, Shaojiu Wang, Ming Li

Publication date: 15 September 1999

zbMATH Keywords

Hamming distance; string algorithms; closest string problem; farthest string problem

Mathematics Subject Classification ID

92C40: Biochemistry, molecular biology

65Y20: Complexity and performance of numerical algorithms

92-08: Computational methods for problems pertaining to biology

Related Items

The selective fixing algorithm for the closest string problem, Parameterized complexity analysis for the closest string with wildcards problem, An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications, Efficient algorithms for consensus string problems minimizing both distance sum and radius, On the complexity of deriving position specific score matrices from positive and negative sequences, The consensus string problem for a metric is NP-complete, Approximation algorithms for Hamming clustering problems, The approximate period problem for DNA alphabet., On the complexity of finding common approximate substrings., Distinguishing string selection problems., An improved integer linear programming formulation for the closest 0-1 string problem, Mathematical programming in computational biology: an annotated bibliography, On the string consensus problem and the Manhattan sequence consensus problem, Efficient solutions for the far from most string problem, A GRASP algorithm for the closest string problem using a probability-based heuristic, Heuristic approaches to the distinguishing substring selection problem, Hard problems in similarity searching, Parameterized resiliency problems, RNA multiple structural alignment with longest common subsequences, Multiple genome rearrangement by swaps and by element duplications, On some optimization problems in molecular biology, On some multiobjective optimization problems arising in biology