A hybrid algorithm for the DNA sequencing problem
From MaRDI portal
Publication:406500
DOI10.1016/j.dam.2012.08.025zbMath1352.92110OpenAlexW2011220932MaRDI QIDQ406500
Publication date: 8 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.025
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Protein sequences, DNA sequences (92D20)
Related Items (4)
On the role of metaheuristic optimization in bioinformatics ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ MODELING AND OPTIMIZATION OF GENETIC SCREENS VIA RNA INTERFERENCE AND FACS ⋮ Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The transform likelihood ratio method for rare event simulation with heavy tails
- A survey of very large-scale neighborhood search techniques
- Dealing with repetitions in sequencing by hybridization
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- Complexity of DNA sequencing by hybridization.
- Local branching
- Tabu search for DNA sequencing with false negatives and false positives
- Hybrid genetic algorithm for DNA sequencing with errors
- A tutorial on the cross-entropy method
- DNA Sequencing—Tabu and Scatter Search Combined
- Integer Programming Formulation of Traveling Salesman Problems
- DNA Sequencing by Hybridization via Genetic Search
- Locating a cycle in a transportation or a telecommunications network
- Matheuristics
- Solving the Orienteering Problem through Branch-and-Cut
This page was built for publication: A hybrid algorithm for the DNA sequencing problem
