<!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 />
    <article-meta>
      <title-group>
        <article-title>A geometric XAI approach to protein pocket detection.</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Giovanni Bocchi</string-name>
          <email>giovanni.bocchi1@unimi.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Patrizio Frosini</string-name>
          <email>patrizio.frosini@unibo.it</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandra Micheletti</string-name>
          <email>alessandra.micheletti@unimi.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alessandro Pedretti</string-name>
          <email>alessandro.pedretti@unimi.it</email>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gianluca Palermo</string-name>
          <email>gianluca.palermo@polimi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Davide Gadioli</string-name>
          <email>davide.gadioli@polimi.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carmen Gratteri</string-name>
          <email>carmen.gratteri@studenti.unicz.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Filippo Lunghini</string-name>
          <email>filippo.lunghini@dompe.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Rosario Beccari</string-name>
          <email>andrea.beccari@dompe.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anna Fava</string-name>
          <email>anna.fava@dompe.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Carmine Talarico</string-name>
          <email>carmine.talarico@dompe.com</email>
          <xref ref-type="aff" rid="aff5">5</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Electronics, Information and Bioengineering, Politecnico of Milano</institution>
          ,
          <addr-line>Via Ponzio 34/5, 20133</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Environmental Science and Policy, University of Milan</institution>
          ,
          <addr-line>Via Saldini 50, Milano, 20133</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Department of Health Sciences, University Magna Graecia di Catanzaro</institution>
          ,
          <addr-line>Viale Europa, Catanzaro, 88100</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Department of Mathematics, University of Bologna</institution>
          ,
          <addr-line>Piazza di Porta S.Donato 5, Bologna, 40126</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>Department of Pharmaceutical Sciences, University of Milan</institution>
          ,
          <addr-line>Via Mangiagalli 25, Milano, 20133</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff5">
          <label>5</label>
          <institution>Dompé Farmaceutici S.p.A.</institution>
          ,
          <addr-line>Via Tommaso de Amicis 95, Napoli, 80123</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Protein pocket detection is an essential step in structure-based virtual screening methods for identifying potential drug targets. To facilitate eficient molecular docking, an accurate determination of target binding sites is indispensable. In this study, we present GENEOnet, an innovative machine learning model based on Group Equivariant Non-Expansive Operators (GENEOs) for protein pocket detection. Our proposed method sets itself apart from other artificial intelligence techniques in the domain due to its reduced number of parameters, increased transparency, and integration of prior knowledge. The experimental assessment validates GENEOnet's eficacy with a limited training dataset, surpassing several established state-of-the-art methods based on multiple critical performance indicators computed using extensive public datasets of ligand-protein complexes. GENEOnet, the result of an ongoing collaborative efort between Italian universities and the pharmaceutical company Dompé Farmaceutici S.p.A., is accessible as a web service at https://geneonet.exscalate.eu to enable the scientific community to evaluate the pre-trained model for pocket detection.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Molecular Docking</kwd>
        <kwd>Protein Pocket Detection</kwd>
        <kwd>Equivariance</kwd>
        <kwd>GENEOs</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Molecular docking, a critical research area in both pharmaceuticals and academia, is a simulation
technique utilized to predict the binding mode of small molecules with respect to specific
target proteins based on their three-dimensional structures [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. This method plays a crucial
role in elucidating molecular interactions and has significant applications, particularly in
drug repurposing [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Repurposing existing and approved drugs involves identifying new
therapeutic uses and, bypassing the time-consuming and costly drug development process,
enables researchers to expedite the delivery of novel therapies to patients in an eficient and
afordable manner.
      </p>
      <p>Blind docking involves the tentative to accommodate the ligand trying anywhere on the
protein surface. However, blind docking comes with challenges like false positives, where
ligands may score well but have no experimental binding afinity to the target due to limitations
in scoring functions.</p>
      <p>
        To address these concerns, “informed” docking [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] is an alternative approach that restricts the
search only to promising areas of a protein’s surface, known as pockets. This method reduces
false positives and computational time needed for extensive virtual screening. Protein pocket
detection, which is the problem of identifying such pockets on a target protein, in recent years
has been addressed through machine learning and AI methods. However, explainability and
trustworthiness of these methods have been neglected.
      </p>
      <p>
        In this paper, we present some recent findings relative to GENEOnet [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] a simple and thus
quite explainable machine learning method for protein pocket detection which is built using
the mathematical theory of Group Equivariant Non-Expansive Operators.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Methods</title>
      <sec id="sec-2-1">
        <title>2.1. GENEOs</title>
        <p>
          In this study, we further investigate GENEOnet a shallow network composed of Group
Equivariant Non-Expansive Operator units, whose architecture is depicted in Figure 1a. For a
comprehensive understanding of GENEOs, we refer the reader to [
          <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
          ]. GENEOs possess good
mathematical properties that make them interesting for machine learning applications. Two
primary features of GENEOs are equivariance and non-expansivity.
        </p>
        <p>
          Equivariance [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] refers to the method’s ability to behave coherently with respect to the action
of specific groups of geometrical transformations of the data. The simplest form of equivariance
is called invariance: for instance, a rotation-invariant method must assign the same label to
an image of an elephant facing upwards as it does to the same image rotated 90 degrees left
independently on the correctness of the label.
        </p>
        <p>Non-expansivity means that the outputs of a GENEO should not be further apart than their
respective inputs with respect to an appropriate distance metric. This property can be read as a
form of theoretical stability, ensuring that small input perturbations result in minimal output
changes.</p>
        <p>
          In this regard, adversarial attacks [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] aim to assess deep learning methods’ robustness against
perturbations, such as rotations and noise perturbations of the inputs, and many others.
Regrettably, black box models have often been shown to be susceptible to these forms of deception,
which could hardly mislead human observers. Instead, by definition, GENEOs can be made
resilient to the two attacks mentioned above, making them an attractive option when seeking
robust and trustworthy results.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. GENEOnet</title>
        <p>GENEOnet, with a representative output displayed in Figure 2a, is broken down into six steps:
1. Data preprocessing: Given an input protein  , GENEOnet first computes a voxelization of
the space enclosed within a bounding box surrounding the protein surface. Subsequently,
eight potential functions are computed on the resulting voxel grid, each one
modeling essential aspects of the protein structure from geometrical, physical and chemical
viewpoints.
2. GENEO layer: A convolutional rigid motion equivariant operator (mostly based on
gaussian kernels), depending on a shape parameter  , is applied to each potential function.</p>
        <p>The resulting function is normalized between 0 and 1.
3. Convex combination: The eight GENEO outputs are combined via convex combination
with weights  . The resulting combination output, denoted as  , is normalized between
0 and 1 and encodes the probability that a voxel belongs to a pocket.
4. Thresholding: The final output is obtained by considering the connected components of
the set of voxels where the value of  is above a threshold parameter  .
5. Evaluation: If the ground truth (i.e., the co-crystallized ligand) is accessible, the output
can be compared against it using a volumetric accuracy function.
6. Scoring: Each predicted pocket is assigned a score, computed as a weighted average of
 within the spatial region identified by a pocket, enabling ranking of pockets from the
most promising to the least promising.</p>
        <p>F σ1</p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Training, model selection and comparison</title>
        <p>Our study employed PDBbind, a publicly accessible database of curated protein-ligand complexes
for binding afinity analysis, as the primary data source (available at http://pdbbind.org.cn/).
We retrieved 12330 complexes from the 2020 version for evaluation and analysis.</p>
        <p>Steps 1 through 5 were considered during the training process, with backpropagation used to
optimize parameters to optimize accuracy (introduced in Step 5). GENEOnet was trained on
a set of 200 molecules extracted from the retrieved complexes. However, this method did not
address the challenge of identifying true pockets within high-ranked predictions (as per Step 6).</p>
        <p>To tackle this issue, we generated multiple models by repeating the optimization process while
maintaining the same initial parameter settings but varying the training sets (each comprising
of 200 complexes). The final model was selected based on maximizing its ability to identify true
pockets at the highest rank using a Validation set consisting of nearly 3000 complexes.</p>
        <p>
          Moreover, we compared GENEOnet’s performance against other state-of-the-art methods
(see [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] for results) in terms of scoring precision, volumetric matching, and shape similarity on a
Test set containing approximately 9000 complexes. In all experiments, GENEOnet outperformed
the others, which was unexpected due to its unique transparency, explainability, and robustness
features not shared by the other methods. We will further explore some of these properties in
the following section.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Analysis</title>
      <p>In this section, our aim is to provide an additional in-depth analysis that underscores the
explainability and robustness characteristics of GENEOnet, many of which can be attributed to
the adoption of GENEOs as building blocks.</p>
      <sec id="sec-3-1">
        <title>3.1. Prior knowledge</title>
        <p>In the context of developing GENEO-based models, the selection and design of an appropriate
pool of operators can be considered as a crucial step of information engineering for the problem
at hand.</p>
        <p>In the case of GENEOnet, experts in molecular docking identified lipophilicity, hydrophilicity,
hydrogen bond acceptor or donor atoms, etc. (see Table 1b) as essential features to identify
potential pockets. For example, regarding the lipophilicity potential, it was argued that a
favorable pocket candidate should exhibit an average high value of this quantity. Thus, a
GENEO from the family of convolutional operators with a Gaussian kernel was chosen to
process this potential. The tunable shape parameter in this case is linked to the shape of the
Gaussian. Analogous considerations were used to select the remaining seven GENEOs for the
other potentials.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Parameters investigation</title>
        <p>GENEOnet, as described in Section 2.2, includes a total of seventeen trainable parameters: eight
shape coeficients for operator kernels, eight coeficients for the convex combination, and one
threshold coeficient.</p>
        <p>
          We believe that Equivariance is a primary factor contributing to GENEOnet’s relatively
few trainable parameters versus other CNN-based methods like DeepSite[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] (844529) and
DeepPocket[
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] (665122). Indeed the requirement for equivariance necessitated the adoption
of rotation-invariant kernels, limiting the kernel search to radial functions chosen to depend
on only one shape parameter. This leads to a greater understanding and interpretability of
GENEOnet’s kernel parameters as opposed to standard CNNs. Moreover, while not directly
responsible for reducing the number of parameters, the convex constraint promotes sparsity in
the combination coeficients, akin to Lasso regularisation. This may result in some biologically
relevant GENEOs having small coeficients due to their correlation with other operators.
        </p>
        <p>Indeed, GENEOnet’s limited trainable parameters facilitate precise interpretation of each
of them: shape parameters influence operator kernels; convex combination coeficients serve
as feature importances for potentials (Table 1b); and the threshold coeficient determines
the significance of voxel activation. The convex combination coeficients warrant further
exploration. The lipophilic potential, essential for pockets due to their need to exhibit lipophilic
properties, receives the highest score. Surprisingly, potentials linked to hydrogen bonds, despite
being biologically significant, have very low scores. As already noticed, this may be a result of
the convex constraint: indeed, these potentials tend to be more concentrated in small regions
surrounding acceptor or donor atoms, and thus other potentials, such as the polar potential,
which might be strongly correlated with hydrogen bonds, are preferred. This could be the case
with the selected model where the polar operator has a convex combination weight which is
the third highest.</p>
        <p>During the model selection process, parameter sensitivity analyses were performed as
byproducts when generating 200 models from diferent training sets (Figure 2b shows boxplots of the
convex combination coeficients). The findings largely confirm the conclusions of the previous
paragraphs: on average, hydrogen bonds play a role but are outweighed by other operators,
such as lipophilicity, which exhibit a coeficients distribution with a box containing higher
values ( 4). If this analysis confirms the importance of potentials like those related to hydrogen
bonds, it also reveals that the Gravitational and Hydrophilic potentials are given very little
importance, a result that was somewhat anticipated given the nature of these potentials in
connection to pocket detection.</p>
        <p>(a) The input protein is depicted in white, while
predicted pockets with colors. A zoom shows
the true pocket containing the ligand.</p>
        <p>(b) Sensitivity analysis of convex combination
coeficients. Lines indicate median values,
whereas stars represent means. The order is
the same as in Table 1b.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Robustness test</title>
        <p>Here we tested robustness to perturbations. In our context, robustness is strictly related to
the Non-Expansivity property of GENEOs, and it is very important for pocket identification
since proteins may exhibit extremely dynamic shapes, while in the data, they are frozen until
crystallizing to capture an image of the structure. To test robustness, six proteins were selected:
two belonging to the set of those whose true pocket was matched by the top-ranked prediction
(proteins 2IGV, 4B0C), another two from the set of pockets matched by the second-ranked
prediction (proteins 1L83, 3PCB), and the remaining two from those matched by the
thirdranked predicted pocket (proteins 1IIH, 4TIM). White noise was introduced by summing i.i.d.
Gaussian r.v.  (0, 2) with zero mean and variance 2 to every voxel. Although i.i.d. noise is
not realistic, as perturbations in the protein conformation are likely correlated because of atom
interactions, it serves as a global test for robustness. We conducted multiple experiments by
varying the standard deviation  in the set {0.01, 0.03, 0.05}, each time generating 200 diferent
perturbations. Figure 3 shows that overlaps and scores distributions of perturbations exhibit
great robustness for all values of standard deviation . Figure 4 indicates greater robustness for
rankings of top and second-ranked pockets while a mildly lower degree of stability is showed
for third-ranked pockets.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Discussion</title>
      <p>The analysis presented in the preceding section provides an initial understanding of GENEOnet’s
explainability and trustworthiness, summarised as follows:
• GENEOnet can incorporate prior knowledge not only during feature selection but also
in operator pool selection. Although feature selection is common in machine learning
algorithms, this second step is less frequently considered, making the choice of operators
more complex and less stable for methods like Convolutional Neural Networks.
• GENEOnet has a smaller number of parameters than other protein pocket detection
methods based on deep learning architectures. This attribute allows us to perform
sensitivity analysis and provides interpretability by design rather than using post hoc
explanation techniques.
• GENEOnet’s equivariance with respect to rigid motions allows us to overlook the input
protein’s spatial pose and helps to reduce the number of parameters.
• GENEOnet’s non-expansivity provides the model with a reasonable degree of robustness
against small physiological modifications in the input protein’s spatial conformation.
The model shows great robustness for lower noise standard deviations when analysing
the identifications made by the first or second predicted pockets. However, larger input
changes may influence the final prediction. We leave this study to subsequent work.
• The reduced data requirements for training GENEOnet (200 complexes) compared to deep
learning methods help decrease computational costs and processing times. This attribute
is not directly related to explainability but makes the model more accessible as fewer
resources are needed to reproduce its results or delve deeper into its analysis.</p>
      <p>
        In conclusion, GENEOs hold promise for building explainable and robust models such as
GENEOnet. Future work includes creating more instances of GENEO-based models [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and
further evaluation of GENEOnet. A promising advancement could be the use of GENEOnet
for analyzing molecular dynamics data. In molecular dynamics simulations, tracking the
progression of GENEOnet scores for pockets jointly with techniques that identify breakpoints
(see e.g. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) may help pinpoint optimal frames for bond formation.
This research was financially supported by Dompé Farmaceutici S.p.A. Additional scientific
support is acknowledged to the Italian GNAMPA - INDAM group. Computational resources
were partially provided by the INDACO core facility for HPC at Università degli Studi di Milano.
      </p>
      <p>Availability: GENEOnet can be tested at the following URL: https://geneonet.exscalate.eu</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Anderson</surname>
          </string-name>
          ,
          <article-title>The process of structure-based drug design</article-title>
          ,
          <source>Chem. Biol</source>
          .
          <volume>10</volume>
          (
          <year>2003</year>
          )
          <fpage>787</fpage>
          -
          <lpage>797</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.chembiol.
          <year>2003</year>
          .
          <volume>09</volume>
          .002.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Chen</surname>
          </string-name>
          , et al.,
          <article-title>A review of recent developments and progress in computational drug repositioning</article-title>
          ,
          <source>Curr. Pharm. Design</source>
          <volume>26</volume>
          (
          <year>2020</year>
          )
          <fpage>3059</fpage>
          -
          <lpage>3068</lpage>
          . doi:
          <volume>10</volume>
          .2174/ 1381612826666200116145559.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Ghersi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sanchez</surname>
          </string-name>
          ,
          <article-title>Improving accuracy and eficiency of blind protein-ligand docking by focusing on predicted binding sites</article-title>
          ,
          <source>Proteins</source>
          <volume>74</volume>
          (
          <year>2009</year>
          )
          <fpage>417</fpage>
          -
          <lpage>424</lpage>
          . doi:
          <volume>10</volume>
          .1002/prot. 22154.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>G.</given-names>
            <surname>Bocchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Frosini</surname>
          </string-name>
          , et al.,
          <article-title>GENEOnet: A new machine learning paradigm based on group equivariant non-expansive operators. an application to protein pocket detection</article-title>
          ,
          <year>2022</year>
          . arXiv:
          <volume>2202</volume>
          .
          <fpage>00451</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Bergomi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Frosini</surname>
          </string-name>
          , et al.,
          <article-title>Towards a topological-geometrical theory of group equivariant non-expansive operators for data analysis and machine learning</article-title>
          ,
          <source>Nat. Mach. Intell</source>
          .
          <volume>1</volume>
          (
          <year>2019</year>
          )
          <fpage>423</fpage>
          -
          <lpage>433</lpage>
          . doi:
          <volume>10</volume>
          .1038/s42256-019-0087-3.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>G.</given-names>
            <surname>Bocchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Botteghi</surname>
          </string-name>
          , et al.,
          <article-title>On the finite representation of linear group equivariant operators via permutant measures</article-title>
          , Ann. Math. Artif. Intell.
          <volume>91</volume>
          (
          <year>2023</year>
          )
          <fpage>465</fpage>
          -
          <lpage>487</lpage>
          . doi:
          <volume>10</volume>
          . 1007/s10472-022-09830-1.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T. S.</given-names>
            <surname>Cohen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Welling</surname>
          </string-name>
          , Group equivariant convolutional networks,
          <source>in: ICML</source>
          <year>2016</year>
          , volume
          <volume>48</volume>
          ,
          <year>2016</year>
          , pp.
          <fpage>2990</fpage>
          -
          <lpage>2999</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Alcorn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Li</surname>
          </string-name>
          , et al.,
          <article-title>Strike (with) a pose: Neural networks are easily fooled by strange poses of familiar objects</article-title>
          ,
          <source>in: CVPR</source>
          <year>2019</year>
          ,
          <year>2019</year>
          , pp.
          <fpage>4840</fpage>
          -
          <lpage>4849</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2019</year>
          .
          <volume>00498</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Jimenez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Doerr</surname>
          </string-name>
          , et al.,
          <article-title>Deepsite: protein-binding site predictor using 3d-convolutional neural networks</article-title>
          ,
          <source>Bioinformatics</source>
          <volume>33</volume>
          (
          <year>2017</year>
          )
          <fpage>3036</fpage>
          -
          <lpage>3042</lpage>
          . doi:
          <volume>10</volume>
          .1093/bioinformatics/ btx350.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>R.</given-names>
            <surname>Aggarwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          , et al.,
          <article-title>Deeppocket: Ligand binding site detection and segmentation using 3d convolutional neural networks</article-title>
          ,
          <source>J. Chem Inf. Model</source>
          .
          <volume>62</volume>
          (
          <year>2022</year>
          )
          <fpage>5069</fpage>
          -
          <lpage>5079</lpage>
          . doi:
          <volume>10</volume>
          . 1021/acs.jcim.1c00799.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lavado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Soares</surname>
          </string-name>
          , et al.,
          <article-title>Low-resource white-box semantic segmentation of supporting towers on 3d point clouds via signature shape identification</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2306</volume>
          .
          <fpage>07809</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Micheletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Aletti</surname>
          </string-name>
          , et al.,
          <article-title>A weighted  2 test to detect the presence of a major change point in non-stationary markov chains</article-title>
          ,
          <source>Stat. Method. Appl</source>
          .
          <volume>29</volume>
          (
          <year>2020</year>
          )
          <fpage>899</fpage>
          -
          <lpage>912</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10260-020-00510-0.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>