By Topic

A genetic algorithm to sequence DNA using sequencing by hybridisation experimental data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Spalding, J.D. ; Western Australia Univ., Crawley, WA, Australia ; MacNish, C.

Recent advancements in the biological sciences have created new problems for computational biology. One such problem is determining the sequence of DNA. One of the options for speeding up this process is to exploit the parallel nature of a 'sequencing by hybridisation' experiment to obtain the information from the physical structure of DNA. Various methods have been proposed to reconstruct DNA sequences from SBH data, including hybrid genetic algorithms. We describe a genetic algorithm which is more robust than previous methods, and gives results with a similar level of accuracy to alternative methods. The performance of the genetic algorithm is compared to alternative hybrid genetic algorithms, and improvements in the time the algorithm takes to return a result are recorded. We conclude by arguing that robust genetic methods may offer techniques to further improve on current methods.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003