An ant colony optimization algorithm for DNA sequencing by hybridization

DOI10.1016/j.cor.2007.03.007zbMath1167.92011OpenAlexW1991912317MaRDI QIDQ2483507

Maria J. Blesa, Christian Blum, Mateu Yábar Vallès

Publication date: 28 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.007

zbMATH Keywords

multi-level techniques

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items (6)

Solving the minimum common string partition problem with the help of ants ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ Unimodular hypergraph for DNA sequencing: a polynomial time algorithm ⋮ An integer programming approach to DNA sequence assembly ⋮ Linear and nonlinear constructions of DNA codes with Hamming distance \(d\) and constant \(GC\)-content ⋮ On the Reynolds Equation and the Load Problem in Lubrication: Literature Review and Mathematical Modelling

Cites Work

• Unnamed Item
• Multilevel refinement for combinatorial optimisation problems
• Evolutionary approaches to DNA sequencing with errors
• Complexity of DNA sequencing by hybridization.
• Tabu search for DNA sequencing with false negatives and false positives
• Hybrid genetic algorithm for DNA sequencing with errors
• DNA Sequencing—Tabu and Scatter Search Combined
• Experimental and Efficient Algorithms

This page was built for publication: An ant colony optimization algorithm for DNA sequencing by hybridization