On some optimization problems in molecular biology

DOI10.1016/j.mbs.2006.11.012zbMath1117.92026WikidataQ30361805 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 optimization; computational biology; molecular structure prediction; protein and sequence alignment

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C27: Combinatorial optimization

92C40: Biochemistry, molecular biology

Related Items

An optimization modelling for string selection in molecular biology using Pareto optimality, Improved optimization modelling for the closest string and related problems, Efficient solutions for the far from most string problem, A GRASP algorithm for the closest string problem using a probability-based heuristic, On some multiobjective optimization problems arising in biology

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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