On some optimization problems in molecular biology

DOI10.1016/j.mbs.2006.11.012zbMath1117.92026OpenAlexW2067419406WikidataQ30361805 ScholiaQ30361805MaRDI QIDQ2643356

Paola Festa

Publication date: 23 August 2007

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mbs.2006.11.012

zbMATH Keywords

combinatorial optimizationcomputational biologymolecular structure predictionprotein and sequence alignment

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Biochemistry, molecular biology (92C40)

Related Items (10)

Metric intersection problems in Cayley graphs and the Stirling recursion ⋮ A nonmonotone GRASP ⋮ On approximating string selection problems with outliers ⋮ Application of negative learning ant colony optimization to the far from most string problem ⋮ An optimization modelling for string selection in molecular biology using Pareto optimality ⋮ Improved optimization modelling for the closest string and related problems ⋮ On some multiobjective optimization problems arising in biology ⋮ Efficient solutions for the far from most string problem ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ Hybridizations of GRASP with path relinking for the far from most string problem

Uses Software

• GRASP

Cites Work

• On covering problems of codes
• A probabilistic heuristic for a computationally difficult set covering problem
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Distinguishing string selection problems.
• A polyhedral approach to sequence alignment problems
• Greedy randomized adaptive search procedures
• Metaheuristics: A bibliography
• Finding similar regions in many strings
• Sorting Permutations by Reversals Through Branch-and-Price
• Opportunities for Combinatorial Optimization in Computational Biology
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On some optimization problems in molecular biology