scientific article; zbMATH DE number 1305456
From MaRDI portal
Publication:4252342
zbMath0940.92011MaRDI QIDQ4252342
Bin Ma, J. Kevin Lanctot, Louxin Zhang, Shaojiu Wang, Ming Li
Publication date: 15 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Related Items (22)
Hard problems in similarity searching ⋮ RNA multiple structural alignment with longest common subsequences ⋮ On some optimization problems in molecular biology ⋮ The selective fixing algorithm for the closest string problem ⋮ An improved integer linear programming formulation for the closest 0-1 string problem ⋮ Mathematical programming in computational biology: an annotated bibliography ⋮ 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 string consensus problem and the Manhattan sequence consensus problem ⋮ On the complexity of finding common approximate substrings. ⋮ Distinguishing string selection problems. ⋮ On some multiobjective optimization problems arising in biology ⋮ Multiple genome rearrangement by swaps and by element duplications ⋮ 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 solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ Heuristic approaches to the distinguishing substring selection problem ⋮ Parameterized resiliency problems
This page was built for publication:
