Integer linear programming approaches for non-unique probe selection
From MaRDI portal
(Redirected from Publication:876483)
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
(13)- Non-unique probe selection and group testing
- Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
- On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
- A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays
- Randomized probe selection algorithm for microarray design
- Integer linear programming approaches for non-unique probe selection
- scientific article; zbMATH DE number 1945182 (Why is no real title available?)
- Mathematical programming in computational biology: an annotated bibliography
- Asynchronous teams for probe selection problems
- Integer Linear Programming in Computational Biology
- Searching oligo sets of human chromosome 12 using evolutionary strategies
- On the complexity of non-unique probe selection
- Combinatorial Pattern Matching
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)