The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
DOI10.1016/J.EJOR.2015.07.011zbMATH Open1346.90852OpenAlexW815683020MaRDI QIDQ320748FDOQ320748
Authors: Stephen J. Maher, John M. Murray 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10871/39958
Recommendations
- Optimizing experimental design in genetics
- A scalable engineering combination therapies for evolutionary dynamic of macrophages
- Some statistical methods for phylogenetic trees with application to HIV disease
- Branch and cut methods for network optimization
- Efficient Haplotype Inference with Pseudo-boolean Optimization
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Genetics and epigenetics (92D10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Decomposition algorithms for stochastic programming on a computational grid
- A stochastic programming approach for supply chain network design under uncertainty
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Optimal Selection of a Connected Reserve Network
- Solving Connected Subgraph Problems in Wildlife Conservation
- Connections in Networks: Hardness of Feasibility Versus Optimality
- Wildlife corridors as a connected subgraph problem
- The rooted maximum node-weight connected subgraph problem
- Imposing Connectivity Constraints in Forest Planning Models
- A graph theory approach for designing conservation reserve networks with minimal fragmentation
This page was built for publication: The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320748)
