TY - JOUR

T1 - The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences

AU - Maher, Stephen

AU - Murray, John

PY - 2016/1/16

Y1 - 2016/1/16

N2 - This paper presents a novel application of operations research techniques to the analysis of HIV Env gene sequences, aiming to identify key features that are possible vaccine targets. These targets are identified as being critical to the transmission of HIV by being present in early transmitted (founder) sequences and absent in later chronic sequences. Identifying the key features of Env involves two steps: first, calculating the covariance of amino acid combinations and positions to form a network of related and compensatory mutations; and second, developing an integer program to identify the smallest connected subgraph of the constructed covariance network that exhibits a set covering property. The integer program developed for this analysis, labelled the unrooted set covering connected subgraph problem (USCCSP), integrates a set covering problem and connectivity evaluation, the latter formulated as a network flow problem. The resulting integer program is very large and complex, requiring the use of Benders’ decomposition to develop an efficient solution approach. The results will demonstrate the necessity of applying acceleration techniques to the Benders’ decomposition solution approach and the effectiveness of these techniques and heuristic approaches for solving the USCCSP.

AB - This paper presents a novel application of operations research techniques to the analysis of HIV Env gene sequences, aiming to identify key features that are possible vaccine targets. These targets are identified as being critical to the transmission of HIV by being present in early transmitted (founder) sequences and absent in later chronic sequences. Identifying the key features of Env involves two steps: first, calculating the covariance of amino acid combinations and positions to form a network of related and compensatory mutations; and second, developing an integer program to identify the smallest connected subgraph of the constructed covariance network that exhibits a set covering property. The integer program developed for this analysis, labelled the unrooted set covering connected subgraph problem (USCCSP), integrates a set covering problem and connectivity evaluation, the latter formulated as a network flow problem. The resulting integer program is very large and complex, requiring the use of Benders’ decomposition to develop an efficient solution approach. The results will demonstrate the necessity of applying acceleration techniques to the Benders’ decomposition solution approach and the effectiveness of these techniques and heuristic approaches for solving the USCCSP.

KW - OR in medicine

KW - HIV Env sequence

KW - Benders’ decomposition

KW - Acceleration techniques

U2 - 10.1016/j.ejor.2015.07.011

DO - 10.1016/j.ejor.2015.07.011

M3 - Journal article

VL - 248

SP - 668

EP - 680

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -