Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
Hybrid Genetic Algorithm for DNA Sequencing with Errors
Journal of Heuristics
Ant Colony Optimization
DNA Sequencing--Tabu and Scatter Search Combined
INFORMS Journal on Computing
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
An ant colony optimization algorithm for DNA sequencing by hybridization
Computers and Operations Research
| Hi-index | 0.00 |
Deoxyribonucleic acid (DNA) sequencing is an important task 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. This led to the development of several metaheuristic approaches such as tabu search and evolutionary algorithms. In this work we propose an ant colony algorithm to resolve this problem. In addition, we apply our algorithm within a multi-level framework which helps in significantly reducing the computation time. The results show that our algorithm is currently among the state-of-the-art methods for this problem.