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

Research output: Contributions to collected editions/worksArticle in conference proceedingsResearchpeer-review

Authors

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 memory less 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.

Original languageEnglish
Title of host publicationExperimental and Efficient Algorithms : 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005; Proceedings
EditorsSotiris E. Nikoletseas
Number of pages12
Place of PublicationBerlin
PublisherSpringer
Publication date01.01.2005
Pages4-15
ISBN (print)978-3-540-25920-6
ISBN (electronic)978-3-540-32078-4
DOIs
Publication statusPublished - 01.01.2005
Externally publishedYes
Event4th International Workshop on Experimental and Efficient Algorithms, WEA 2005 - Santorini Island, Greece
Duration: 10.05.200513.05.2005
Conference number: 4

DOI