Integer linear programming approaches for non-unique probe selection

DOI10.1016/j.dam.2005.09.021zbMath1143.90020OpenAlexW2113416897WikidataQ57710067 ScholiaQ57710067MaRDI QIDQ876483

Sven Rahmann, Knut Reinert, Gunnar W. Klau, Martin Vingron, Alexander Schliep

Publication date: 18 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.021

zbMATH Keywords

designinteger linear programminggroup testingmicroarrayoligonucleotideprobe

Mathematics Subject Classification ID

Integer programming (90C10) Protein sequences, DNA sequences (92D20)

Related Items (4)

Mathematical programming in computational biology: an annotated bibliography ⋮ Integer linear programming approaches for non-unique probe selection ⋮ On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix ⋮ Integer Linear Programming in Computational Biology

Uses Software

• CPLEX
• OligoPicker

Cites Work

• Integer linear programming approaches for non-unique probe selection
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer linear programming approaches for non-unique probe selection