Skip to main content
Fig. 7 | Algorithms for Molecular Biology

Fig. 7

From: A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming

Fig. 7

An illustration of chemical acyclic graphs G with \(n(G)=50\), \({\text {bl}}_2(G)=2\) and \(d_\text {max}=4\) obtained in Stage 4 by solving an MILP: a \(y^*_{\text {Kow}}=9\), \(\text {dia}(G)=\lceil (2/5)n^*\rceil =20\); b \(y^*_{\text {Bp}}=880\), \(\text {dia}(G)= n^*/2 =25\); c \(y^*_{\text {Hc}}=25000\), \(\text {dia}(G)=\lceil (3/5)n^*\rceil =30\)

Back to article page