Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Tabu Search
Genetic Algorithms
Handling long targets and errors in sequencing by hybridization
Proceedings of the sixth annual international conference on Computational biology
Hybrid Genetic Algorithm for DNA Sequencing with Errors
Journal of Heuristics
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Complexity of DNA sequencing by hybridization
Theoretical Computer Science
Bioinformatics and Management Science: Some Common Tools and Techniques
Operations Research
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)
Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries
Computational Biology and Chemistry
Algorithm: Dealing with repetitions in sequencing by hybridization
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
Highly efficient parallel approach to the next-generation DNA sequencing
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
Hi-index | 0.00 |
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.