Hybrid Genetic Algorithm for DNA Sequencing with Errors
Journal of Heuristics
Complexity of DNA sequencing by hybridization
Theoretical Computer Science
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Ant Colony Optimization
DNA Sequencing--Tabu and Scatter Search Combined
INFORMS Journal on Computing
New constructive heuristics for DNA sequencing by hybridization
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Multi-level ant colony optimization for DNA sequencing by hybridization
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Accurate Reconstruction for DNA Sequencing by Hybridization Based on a Constructive Heuristic
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An integer programming approach to DNA sequence assembly
Computational Biology and Chemistry
Personalised web search using ACO with information scent
International Journal of Knowledge and Web Intelligence
Mining association rules with single and multi-objective grammar guided ant programming
Integrated Computer-Aided Engineering
| Hi-index | 0.01 |
The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Several metaheuristics such as tabu search and evolutionary algorithms have been applied to this problem. However, the performance of existing metaheuristics is often inferior to the performance of recently proposed constructive heuristics. On the basis of these new heuristics we develop an ant colony optimization algorithm for DNA sequencing by hybridization. An important feature of this algorithm is the implementation in a so-called multi-level framework. The computational results show that our algorithm is currently a state-of-the-art method for the tackled problem.