Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/15758
Appears in Collections:Computing Science and Mathematics Journal Articles
Peer Review Status: Refereed
Title: A hyper-heuristic approach to sequencing by hybridization of DNA sequences
Authors: Blazewicz, Jacek
Burke, Edmund
Kendall, Graham
Mruczkiewicz, Wojciech
Oguz, Ceyda
Swiercz, Aleksandra
Contact Email: e.k.burke@stir.ac.uk
Keywords: Hyper-heuristics
Simulated annealing
Tabu search
Choice function
Sequencing by hybridization
Issue Date: Aug-2013
Publisher: Springer
Citation: Blazewicz J, Burke E, Kendall G, Mruczkiewicz W, Oguz C & Swiercz A (2013) A hyper-heuristic approach to sequencing by hybridization of DNA sequences, Annals of Operations Research, 207 (1), pp. 27-41.
Abstract: In this paper we investigate the use of hyper-heuristic methodologies for predicting DNA sequences. In particular, we utilize Sequencing by Hybridization. We believe that this is the first time that hyper-heuristics have been investigated in this domain. A hyper-heuristic is provided with a set of low-level heuristics and the aim is to decide which heuristic to call at each decision point. We investigate three types of hyper-heuristics. Two of these (simulated annealing and tabu search) draw their inspiration from meta-heuristics. The choice function hyper-heuristic draws its inspiration from reinforcement learning. We utilize two independent sets of low-level heuristics. The first set is based on a previous tabu search method, with the second set being a significant extension to this basic set, including utilizing a different representation and introducing the definition of clusters. The datasets we use comprises two randomly generated datasets and also a publicly available biological dataset. In total, we carried out experiments using 70 different combinations of heuristics, using the three datasets mentioned above and investigating six different hyper-heuristic algorithms. Our results demonstrate the effectiveness of a hyper-heuristic approach to this problem domain. It is necessary to provide a good set of low-level heuristics, which are able to both intensify and diversify the search but this approach has demonstrated very encouraging results on this extremely difficult and important problem domain.
Type: Journal Article
URI: http://hdl.handle.net/1893/15758
DOI Link: http://dx.doi.org/10.1007/s10479-011-0927-y
Rights: The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.
Affiliation: Poznan University of Technology
Deputy Principal's Office
University of Nottingham
Poznan University of Technology
Koc University
Poznan University of Technology

Files in This Item:
File Description SizeFormat 
A hyper-heuristic approach to sequencing by hybridization.pdf624.68 kBAdobe PDFUnder Embargo until 31/12/2999     Request a copy

Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.

This item is protected by original copyright



Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.