DNA Sequencing--Tabu and Scatter Search Combined

Authors:
Jacek Blazewicz;Fred Glover;Marta Kasprzak
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
2004

Citing 0
Cited 11

DNA Sequencing by Hybridization via Genetic Search

Operations Research
Sequencing by hybridization: an enhanced crossover operator for a hybrid genetic algorithm

Journal of Heuristics
An ant colony optimization algorithm for DNA sequencing by hybridization

Computers and Operations Research
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

Computers and Operations Research
Algorithm: Dealing with repetitions in sequencing by hybridization

Computational Biology and Chemistry
A math-heuristic algorithm for the DNA sequencing problem

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
New constructive heuristics for DNA sequencing by hybridization

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries

Computers and Operations Research
Multi-level ant colony optimization for DNA sequencing by hybridization

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
A hybrid algorithm for the DNA sequencing problem

Discrete Applied Mathematics
Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a tabu-search algorithm enhanced by scatter search is presented. The algorithm solves the DNA sequencing problem with negative and positive errors, yielding outcomes of high quality. We compare the new method with two other metaheuristic approaches: a previous tabu-search method and a hybrid genetic algorithm, and also with an old branch-and-bound approach.