Modern heuristic techniques for combinatorial problems
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Discrete Applied Mathematics - Special volume: viewpoints on optimization
On the power of universal bases in sequencing by hybridization
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
On some properties of DNA graphs
Discrete Applied Mathematics
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Hybrid Genetic Algorithm for DNA Sequencing with Errors
Journal of Heuristics
Reconstruction of DNA Sequence Information from a Simulated DNA Chip Using Evolutionary Programming
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Complexity of DNA sequencing by hybridization
Theoretical Computer Science
DNA Sequencing--Tabu and Scatter Search Combined
INFORMS Journal on Computing
Sequencing by hybridization with isothermic oligonucleotide libraries
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
DNA Sequencing by Hybridization via Genetic Search
Operations Research
Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries
Computational Biology and Chemistry
Brief Communication: Whole genome assembly from 454 sequencing output via modified DNA graph concept
Computational Biology and Chemistry
A math-heuristic algorithm for the DNA sequencing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
Computers and Operations Research
Hi-index | 0.00 |
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, involving repetitions in the probes of the target sequence. A good method for solving SBH problems must deal with both types of errors. In this work we propose a new hybrid genetic algorithm for isothermic and standard sequencing that incorporates the concept of structured combinations. The algorithm is then compared with other methods designed for handling errors that arise in standard and isothermic SBH approaches. DNA sequences used for testing are taken from GenBank. The set of instances for testing was divided into two groups. The first group consisted of sequences containing positive and negative errors in the spectrum, at a rate of up to 20%, excluding errors coming from repetitions. The second group consisted of sequences containing repeated oligonucleotides, and containing additional errors up to 5% added into the spectra. Our new method outperforms the best alternative procedures for both data sets. Moreover, the method produces solutions exhibiting extremely high degree of similarity to the target sequences in the cases without repetitions, which is an important outcome for biologists. The spectra prepared from the sequences taken from GenBank are available on our website http://bio.cs.put.poznan.pl/.