Genomic feature selection by coverage design optimization
From MaRDI portal
Recommendations
- On the optimal design of genetic variant discovery studies
- A novel and efficient algorithm for de novo discovery of mutated driver pathways in cancer
- Pattern-based feature selection in genomics and proteomics
- Improved Tag Set Design and Multiplexing Algorithms for Universal Arrays
- Computational Science – ICCS 2005
Cites work
- A branch-and-cut method for 0-1 mixed convex programming
- An algorithmic framework for convex mixed integer nonlinear programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Generalized Benders decomposition
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle regression. (With discussion)
- Prototype selection for interpretable classification
- Regularization and Variable Selection Via the Elastic Net
Cited in
(2)
This page was built for publication: Genomic feature selection by coverage design optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5036376)
