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.



Related Items (22)

Hard problems in similarity searchingRNA multiple structural alignment with longest common subsequencesOn some optimization problems in molecular biologyThe selective fixing algorithm for the closest string problemAn improved integer linear programming formulation for the closest 0-1 string problemMathematical programming in computational biology: an annotated bibliographyOn the complexity of deriving position specific score matrices from positive and negative sequencesThe consensus string problem for a metric is NP-completeApproximation algorithms for Hamming clustering problemsThe approximate period problem for DNA alphabet.On the string consensus problem and the Manhattan sequence consensus problemOn the complexity of finding common approximate substrings.Distinguishing string selection problems.On some multiobjective optimization problems arising in biologyMultiple genome rearrangement by swaps and by element duplicationsParameterized complexity analysis for the closest string with wildcards problemAn efficient algorithm to detect common ancestor genes for non-overlapping inversion and applicationsEfficient solutions for the far from most string problemA GRASP algorithm for the closest string problem using a probability-based heuristicEfficient algorithms for consensus string problems minimizing both distance sum and radiusHeuristic approaches to the distinguishing substring selection problemParameterized resiliency problems




This page was built for publication: