<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis,
September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Simulation-Based Synthesis of Personalised Therapies for Colorectal Cancer</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marco Esposito</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Leonardo Picchiami</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Science Dept., Sapienza University of Rome</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>22</volume>
      <issue>2021</issue>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>In this short paper we present preliminary results on computing, in silico, personalised therapies for Colorectal Cancer (CRC), one of the deadliest form of tumour for adult humans. We exploit a recent SBML (Systems Biology Markup Language) model of the tumour growth, which also models the PharmacoKinetics/Pharmacodynamics (PK/PD) of two immunotherapic drugs that may be used in combination treatments.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;In Silico Clinical Trials</kwd>
        <kwd>Precision Medicine</kwd>
        <kwd>Personalised Therapies</kwd>
        <kwd>Automated Synthesis</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Modelling</title>
      <p>The automatic synthesis of therapies that may involve several drugs is a computationally
complex task. In fact, it is necessary to determine which drugs to use and their associated dosing
regimen, i.e., the drug amounts and the frequency of administration. Also, as it is the case
for most pathologies and drugs, not all possible therapies are actually feasible; most notably,
there exist known constraints that limit the quantity of drugs that may be administered in a
certain period, in order to deal with drug toxicity. In the general case, the number of possible
therapies is infinite. We study an approach to the problem that is based on the parametrisation of
therapies. In order for the approach to be both feasible and efective, the number of parameters
must be small enough to enable an eficient search over the possible therapies but still large
enough to allow the modelling of all (or most of) the therapies of interest. Our goal, then, is
the synthesis of therapies (assignment to the parameters) that meet a given set of constraints
and optimise a user-defined objective function, which usually combines a set of performance
metrics that include eficacy (i.e., how well the therapies cures the pathological condition) and
the total quantity of administered drugs (generally to be minimised, so to reduce costs and
health risks). We propose a method that uses VPH models described in the SBML language and
that defines the whole optimisation problem inside the model itself. In particular, the parameters
of the treatment will be modelled as additional parameters of the VPH model and the objective
function and the therapy constraints will be modelled as observable model outputs. The fact
that the whole problem is defined in pure SBML, a standard language supported by a large suite
of software and with a large community, has the goal of showing that computational methods
have the potential to be used in an easy and immediate way in clinical contexts.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Computing personalised therapies for Colorectal Cancer</title>
      <p>
        This section describes the steps we followed to set up an ISCT to evaluate the efectiveness of
our approach in the synthesis of personalised therapies for the CRC model proposed in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Generation of a virtual population. The starting point to perform an ISCT is the availability
of a complete and representative population of virtual patients (VPs), i.e., assignments to the
VPH model parameters. The CRC model presents 23 real-valued parameters that encode the
inter-patient variability. We used the approach described in [
        <xref ref-type="bibr" rid="ref2 ref3 ref4">2, 3, 4</xref>
        ] to generate a population of
VPs that are of interest (i.e., do actually develop a tumour) and show evolution of the model
observables that are physiologically admissible (i.e., do not violate the laws of biology).
Therapy modelling. We modelled 60-week-long therapies as assignments to a set of 32
parameters. For each of the two drugs, atezolizumab and cibisatamab, each one of 15 parameters
governs the amount of drug that can be administered during a 28-day period and one additional
parameter defines the number of weeks between two consecutive administrations of the drug.
Therapy constraints and objective function. We modelled two constraints, each of which
limits the total amount of each drug cumulatively administered in each 28-day period according
to known toxicity levels and past clinical trials (https://clinicaltrials.gov/ct2/show/NCT03866239).
The objective function combines the total amount of administered drug with a measure of
ineficacy of the treatment. This last measure is computed based on the volume of the tumour at
the end of the treatment and its initial volume. An high value for the ineficacy measure means
that the therapy is not able to keep the tumour growth under control.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Experimental results</title>
      <p>
        We chose to carry out the experimental evaluation of our approach using COPASI [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], one of
the most well-known software tools supporting both plain simulation and simulation-based
parameter optimisation of SBML models via iterative improving algorithms. The starting
point of our ISCT was the random sampling of 35 VPs from the previously computed complete
population. We compared the optimisation performance of 3 algorithms implemented in COPASI:
the standard Genetic Algorithm (GA), Particle Swarm Optimisation (PSO), and the
LevenbergMarquardt (LM) algorithm, a gradient-descent based method that combines Steepest Descent
and the Newton Method. The hyper-parameters of the algorithms were chosen as to perform
the optimisation in a reasonable time for every patient (within 2 hours on an Intel Xeon E5430
@ 2.66GHz (8 cores) 32GB RAM machine). In order to compare the quality of the personalised
therapies synthesised by each algorithm with a common baseline, we considered the dosing
regimen of [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] as a a reference. Given a therapy, we define the Drug Amount Percentage as
aammoouunntt × 100%, where amount and amount are the total amounts of drugs administered by the
given therapy and the reference one, respectively. For each VP, the Ineficacy Percentage for a
given therapy is defined as iinneeff × 100%, where inef and inef are the ineficacy values for the
given and the reference therapy, respectively. The objective function is a linear combination
of these two metrics, where the coeficients are chosen so to balance the search for efective
treatments and the minimisation of administered drug amounts. In our experiments, only 11
VPs out of 35 showed a response to the drugs. This is in agreement with the results from [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>For such 11 patients, LM was not able to find a therapy that improves the reference one,
while GA and PSO show, on average, good results. The average reduction of the amount of
administered drug is as high as 96.9% for GA and 98.62% for PSO, while the average reduction
of the ineficacy is around 35% for both algorithms. Nonetheless, such personalised therapies
still manage to reduce the tumour growth significantly.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Related Work</title>
      <p>
        Many attempts have been proposed in the literature to solve large optimisation problems defined
via logic-, automata- or constraint-based formalisms (e.g., [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref6 ref7 ref8 ref9">6, 7, 8, 9, 10, 11, 12</xref>
        ] among others).
However, such approaches cannot be applied when the problem model (a complex ODE-based
VPH model, as in our case) cannot be accurately defined within such formalisms and is available
only as a simulator. Indeed, although such VPH models are hybrid systems whose inputs are
discrete event sequences [
        <xref ref-type="bibr" rid="ref13">13, 14</xref>
        ], to find an optimal treatment means to find an optimal plan in
hybrid domains. Although symbolic approaches exist to model and solve planning problems in
hybrid domains [15, 16], the typical complexity of the ODEs of clinically-relevant VPH models
makes such models out of reach for them, and appoints numerical integration as the only viable
means to compute (black-box) the model evolutions under a given input function.
      </p>
      <p>The synthesis of personalised therapies exploiting black-box VPH models is addressed in, e.g.,
[17, 18]. In [19, 20] the authors propose a intelligent backtracking simulation-based algorithm
guided by multiple heuristics to seek, on a patient digital twin, an optimal robust personalised
treatment for assisted reproduction, an area with many factors hard to control [21, 22, 23] and
for which treatment personalisation is crucial for success.</p>
      <p>One of the main problems in system biology is the estimation of unknown model parameters
that fit a series of experimental data. Various optimisation algorithms are studied in [ 24, 25, 26]
and applied in real-world case studies in, e.g., [27, 28, 29]. Many of the available tools rely
on SBML simulators (see www.sbml.org). Among such simulators is SBML2Modelica [30],
which focuses on the interoperability between system biology and (hybrid) CPS domain by
translating SBML models to Modelica and the FMI/FMU open standard. This enables the
seamless exploitation of tools and methodologies already established for CPS optimisation and
verification, in particular backtracking-based search and optimisation via the eficient storing
and retrieval of intermediate simulator states [31], verification of closed-loop systems also in
presence of uncontrollable events (e.g., [32, 33, 34, 35, 36, 37, 38]).</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>The good results of the GA and PSO algorithms show the potential of the approach in the
synthesis of personalised therapies. We interpret the failure of the LM algorithm as a clue of
the fact that purely gradient-based optimisation is not suited for this problem, due to the strong
constraints enforced on the therapies. Conversely, population-based algorithms show good
results thanks to their ability to widen their focus throughout the search space.
[14] T. Mancini, et al., SyLVaaS: System level formal verification as a service, in: PDP 2015.
[15] M. Fox, et al., Modelling mixed discrete-continuous domains for planning., JAIR 27 (2006).
[16] S. Bogomolov, et al., PDDL+ planning with hybrid automata: Foundations of translating must
behavior., in: ICAPS 2015, AAAI, 2015.
[17] T. Cassidy, et al., Determinants of combination gm-csf immunotherapy and oncolytic virotherapy
success identified through in silico treatment personalization, PLoS Comp Biol 15 (2019).
[18] A. L. Jenner, et al., Optimising hydrogel release profiles for viro-immunotherapy using oncolytic
adenovirus expressing il-12 and gm-csf with immature dendritic cells, Appl Sci 10 (2020).
[19] T. Mancini, et al., Computing personalised treatments through in silico clinical trials. A case study
on downregulation in assisted reproduction, in: RCRA 2018, CEUR 2271, 2018.
[20] S. Sinisi, et al., Optimal personalised treatment computation through in silico clinical trials on
patient digital twins, Fund Inf 174(3–4) (2020).
[21] B. Leeners, et al., Lack of associations between female hormone levels and visuospatial working
memory, divided attention and cognitive bias across two consecutive menstrual cycles, Front
Behav Neur 11 (2017).
[22] M. Hengartner, et al., Negative afect is unrelated to fluctuations in hormone levels across the
menstrual cycle: Evidence from a multisite observational study across two successive cycles, J
Psychol Res 99 (2017).
[23] B. Leeners, et al.Associations between natural physiological and supraphysiological estradiol levels
and stress perception, Front Psycol 10 (2019).
[24] L. Schmiester, et al., Eficient gradient-based parameter estimation for dynamic models using
qualitative data, Bioinf (2021).
[25] A. F. Villaverde, et al., Benchmarking optimization methods for parameter estimation in large
kinetic models, Bioinf 35 (2019).
[26] A. Yazdani, et al., Systems biology informed deep learning for inferring parameters and hidden
dynamics, PLoS Comp Biol 16 (2020).
[27] O. D. Sánchez, et al., Parameter estimation of a meal glucose–insulin model for tidm patients from
therapy historical data, IET Sys Biol 13 (2019).
[28] T. Chen, et al., Optimal dosing of cancer chemotherapy using model predictive control and moving
horizon state/parameter estimation, Comp Meth Progr Biomed 108 (2012).
[29] M. Raissi, et al., On parameter estimation approaches for predicting disease transmission through
optimization, deep learning and statistical inference methods, Lett Biom 6 (2019).
[30] F. Maggioli, et al., SBML2Modelica: Integrating biochemical models within open-standard
simulation ecosystems, Bioinf 36 (2020).
[31] S. Sinisi, et al., Reconciling interoperability with eficient verification and validation within open
source simulation environments, Simul Model Pract Theory 109 (2021).
[32] T. Mancini, et al., SyLVaaS: System level formal verification as a service, Fund Inf 149(1–2) (2016).
[33] T. Mancini, et al., Anytime system level verification via parallel random exhaustive hardware in
the loop simulation, Micropr Microsys 41 (2016).
[34] T. Mancini, et al., On minimising the maximum expected verification time, Inf Proc Lett 122 (2017).
[35] T. Mancini, et al., User flexibility aware price policy synthesis for smart grids, in: DSD 2015.
[36] T. Mancini, et al., Demand-aware price policy synthesis and verification services for smart grids,
in: SmartGridComm 2014, IEEE, 2014.
[37] T. Mancini, et al., Parallel statistical model checking for safety verification in smart grids, in:</p>
      <p>SmartGridComm 2018, IEEE, 2018.
[38] T. Mancini, et al., Any-horizon uniform random sampling and enumeration of constrained
scenarios for simulation-based formal verification, IEEE TSE (2021). To appear.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ma</surname>
          </string-name>
          , et al.,
          <article-title>Combination therapy with t cell engager and pd-l1 blockade enhances the antitumor potency of t cells as predicted by a qsp model</article-title>
          ,
          <source>J Immun Cancer</source>
          <volume>8</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Tronci</surname>
          </string-name>
          , et al.,
          <article-title>Patient-specific models from inter-patient biological models and clinical records</article-title>
          ,
          <source>in: FMCAD</source>
          <year>2014</year>
          , IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mancini</surname>
          </string-name>
          , et al.,
          <article-title>Computing biological model parameters by parallel statistical model checking</article-title>
          ,
          <source>in: IWBBIO</source>
          <year>2015</year>
          , LNCS 9044, Springer,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sinisi</surname>
          </string-name>
          , et al.,
          <article-title>Complete populations of virtual patients for in silico clinical trials</article-title>
          ,
          <source>Bioinf</source>
          <volume>36</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Hoops</surname>
          </string-name>
          , et al.,
          <article-title>Copasi-a complex pathway simulator</article-title>
          ,
          <source>Bioinf</source>
          <volume>22</volume>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cadoli</surname>
          </string-name>
          , et al.,
          <article-title>Combining relational algebra, SQL, constraint modelling, and local search</article-title>
          ,
          <source>Theor Pract Logic Progr</source>
          <volume>7</volume>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cadoli</surname>
          </string-name>
          , et al.
          <article-title>SAT as an efective solving technology for constraint problems</article-title>
          ,
          <source>in: ISMIS</source>
          <year>2006</year>
          , LNCS 4203, Springer,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mancini</surname>
          </string-name>
          , et al.,
          <article-title>Combinatorial problem solving over relational databases: View synthesis through constraint-based local search</article-title>
          ,
          <source>in: SAC</source>
          <year>2012</year>
          , ACM,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mancini</surname>
          </string-name>
          , et al.,
          <article-title>An eficient algorithm for network vulnerability analysis under malicious attacks</article-title>
          ,
          <source>in: ISMIS 2018</source>
          , Springer,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mancini</surname>
          </string-name>
          , et al.,
          <article-title>Optimal fault-tolerant placement of relay nodes in a mission critical wireless network</article-title>
          ,
          <source>in: RCRA</source>
          <year>2018</year>
          , CEUR 2271,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.,
          <source>MILP</source>
          , pseudo
          <article-title>-boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks</article-title>
          ,
          <source>Fund Inf</source>
          <volume>174</volume>
          (
          <issue>3-4</issue>
          ) (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>I.</given-names>
            <surname>Melatti</surname>
          </string-name>
          , et al.,
          <article-title>A two-layer near-optimal strategy for substation constraint management via home batteries</article-title>
          ,
          <source>IEEE Trans Ind Elect</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mancini</surname>
          </string-name>
          , et al.,
          <article-title>Anytime system level verification via random exhaustive hardware in the loop simulation</article-title>
          ,
          <source>in: DSD</source>
          <year>2014</year>
          , IEEE,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>