Optimization in Sanger sequencing

DOI10.1016/J.COR.2019.05.011zbMATH Open1458.90669OpenAlexW2946092221MaRDI QIDQ2003583FDOQ2003583

Authors: Luisa Carpente, Ana Cerdeira-Pena, S. Lorenzo-Freire, Ángeles S. Places 

Publication date: 9 July 2019

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

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

Recommendations

• Publication:4952645
• scientific article; zbMATH DE number 1305536
• A hybrid algorithm for the DNA sequencing problem
• An ant colony optimization algorithm for DNA sequencing by hybridization
• scientific article; zbMATH DE number 2119751

zbMATH Keywords

optimizationsimulated annealinginteger linear programmingSanger sequencing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Protein sequences, DNA sequences (92D20) Integer programming (90C10)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Computing the initial temperature of simulated annealing
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• New heuristics for one-dimensional bin-packing
• Simulated annealing: A tool for operational research

This page was built for publication: Optimization in Sanger sequencing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003583)