EconPapers    
Economics at your fingertips  
 

DNA Sequencing by Hybridization via Genetic Search

Jacek Blazewicz (), Ceyda Oguz (), Aleksandra Swiercz () and Jan Weglarz ()
Additional contact information
Jacek Blazewicz: Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland, and the Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Poznań, Poland
Ceyda Oguz: Department of Industrial Engineering, Koç University, Istanbul, Turkey
Aleksandra Swiercz: Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland, and the Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Poznań, Poland
Jan Weglarz: Institute of Computing Science, Poznań University of Technology, Piotrowo 2, 60-965 Poznań, Poland, and the Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Poznań, Poland

Operations Research, 2006, vol. 54, issue 6, 1185-1192

Abstract: An innovative approach to DNA sequencing by hybridization utilizes isothermic oligonucleotide libraries. In this paper, we demonstrate the utility of a genetic algorithm for the combinatorial portion of this new approach by incorporating characteristics of DNA sequencing by hybridization in addition to isothermic oligonucleotide libraries. Specialized crossover and mutation operators were developed for this purpose. After initial experiments for parameter adjustment, the performance of the genetic algorithm approach was evaluated with respect to previous methods in the literature. The results indicate that the proposed new approach is superior to previous approaches. The proposed new crossover operator that inherits some features of the structured weighted combinations might also be of value for some other combinatorial problems, including the traveling salesman problem.

Keywords: analysis of algorithms: metaheuristics; health care: bioinformatics; health care: DNA sequencing; programming: integer; algorithms: heuristic (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1060.0324 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:54:y:2006:i:6:p:1185-1192

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:54:y:2006:i:6:p:1185-1192