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 frame-work 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Blum, C., & Yábar Vallés, M. (2006). Multi-level ant colony optimization for DNA sequencing by hybridization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4030 LNCS, pp. 94–109). Springer Verlag. https://doi.org/10.1007/11890584_8
Mendeley helps you to discover research relevant for your work.