Integer linear programming approaches for non-unique probe selection
From MaRDI portal
Publication:876483
DOI10.1016/J.DAM.2005.09.021zbMATH Open1143.90020DBLPjournals/dam/KlauRSVR07OpenAlexW2113416897WikidataQ57710067 ScholiaQ57710067MaRDI QIDQ876483FDOQ876483
Authors: Gunnar W. Klau, Sven Rahmann, Alexander Schliep, Martin Vingron, Knut Reinert 
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
Recommendations
- On the complexity of non-unique probe selection
- On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
- Integer Linear Programming in Computational Biology
- Optimal probe selection in diagnostic search
- An Integer Programming Approach for Linear Programs with Probabilistic Constraints
- An integer programming approach for linear programs with probabilistic constraints
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
Cites Work
Cited In (12)
- Combinatorial Pattern Matching
- Title not available (Why is that?)
- Integer Linear Programming in Computational Biology
- Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
- Integer linear programming approaches for non-unique probe selection
- Searching oligo sets of human chromosome 12 using evolutionary strategies
- Asynchronous teams for probe selection problems
- A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays
- On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
- On the complexity of non-unique probe selection
- Non-unique probe selection and group testing
- Mathematical programming in computational biology: an annotated bibliography
Uses Software
This page was built for publication: Integer linear programming approaches for non-unique probe selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876483)
