Genomic feature selection by coverage design optimization

DOI10.1080/02664763.2018.1432577OpenAlexW2794049230WikidataQ57063545 ScholiaQ57063545MaRDI QIDQ5036376

Ash A. Alizadeh, Robert Tibshirani, Stephen Reid, Maximilian Diehn, Aaron M. Newman

Publication date: 23 February 2022

Published in: Journal of Applied Statistics (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc6173524

zbMATH Keywords

non-convex optimizationfeature selectiongenomicsmultinomial logistic regionmutation coverage

Mathematics Subject Classification ID

Applications of statistics (62Pxx)

Uses Software

• Bonmin
• FilMINT
• Dendrix

Cites Work

• Unnamed Item
• Prototype selection for interpretable classification
• An algorithmic framework for convex mixed integer nonlinear programs
• Least angle regression. (With discussion)
• A branch-and-cut method for 0-1 mixed convex programming
• Generalized Benders decomposition
• FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Regularization and Variable Selection Via the Elastic Net

This page was built for publication: Genomic feature selection by coverage design optimization