Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization

Authors:
Eraldo R. Fernandes;Celso C. Ribeiro
Affiliations:
Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, Brazil;Department of Computer Science, Universidade Federal Fluminense, Niterói, Brazil
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 4
Cited 4

Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
Complexity of DNA sequencing by hybridization

Theoretical Computer Science
Probabilistic nucleotide assembling method for sequencing by hybridization

Bioinformatics

An ant colony optimization algorithm for DNA sequencing by hybridization

Computers and Operations Research
Multistart strategy using delta test for variable selection

ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
New constructive heuristics for DNA sequencing by hybridization

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Multi-level ant colony optimization for DNA sequencing by hybridization

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a multistart heuristic using an adaptive memory strategy for the problem of sequencing by hybridization. The memory-based strategy is able to significantly improve the performance of memoryless construction procedures, in terms of solution quality and processing time. Computational results show that the new heuristic obtains systematically better solutions than more involving and time consuming techniques such as tabu search and genetic algorithms.