A LAD-based method for selecting short oligo probes for genotyping applications
From MaRDI portal
Publication:2481571
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3493838 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- A Heuristic Method for the Set Covering Problem
- MILP approach to pattern generation in logical analysis of data
- On the complexity of polyhedral separability
- Support-vector networks
Cited in
(9)- MILP approach to pattern generation in logical analysis of data
- Efficient feature selection for logical analysis of large-scale multi-class datasets
- Graph, clique and facet of Boolean logical polytope
- On Pareto-optimal Boolean logical patterns for numerical data
- scientific article; zbMATH DE number 1953218 (Why is no real title available?)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- Spherical classification of data, a new rule-based learning method
- Strong valid inequalities for Boolean logical pattern generation
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
This page was built for publication: A LAD-based method for selecting short oligo probes for genotyping applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481571)