<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article article-type="review-article" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" dtd-version="1.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Digit. Health</journal-id>
<journal-title-group>
<journal-title>Frontiers in Digital Health</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Digit. Health</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2673-253X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdgth.2025.1644291</article-id>
<article-version article-version-type="Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Review</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Technical and legal aspects of federated learning in bioinformatics: applications, challenges and opportunities</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Malpetti</surname><given-names>Daniele</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="author-notes" rid="an1"><sup>&#x2020;</sup></xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role></contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Scutari</surname><given-names>Marco</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x002A;</xref>
<xref ref-type="author-notes" rid="an1"><sup>&#x2020;</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/13385/overview"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
</contrib>
<contrib contrib-type="author">
<name><surname>Gualdi</surname><given-names>Francesco</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="author-notes" rid="an1"><sup>&#x2020;</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/3219092/overview" />
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
</contrib>
<contrib contrib-type="author">
<name><surname>van Setten</surname><given-names>Jessica</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/599454/overview" />
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role></contrib>
<contrib contrib-type="author">
<name><surname>van der Laan</surname><given-names>Sander</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<xref ref-type="aff" rid="aff5"><sup>5</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/149155/overview" />
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role></contrib>
<contrib contrib-type="author">
<name><surname>Haitjema</surname><given-names>Saskia</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/1154498/overview" />
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role></contrib>
<contrib contrib-type="author">
<name><surname>Lee</surname><given-names>Aaron Mark</given-names></name>
<xref ref-type="aff" rid="aff6"><sup>6</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/1001379/overview" />
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role></contrib>
<contrib contrib-type="author">
<name><surname>Hering</surname><given-names>Isabelle</given-names></name>
<xref ref-type="aff" rid="aff7"><sup>7</sup></xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
</contrib>
<contrib contrib-type="author">
<name><surname>Mangili</surname><given-names>Francesca</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role></contrib>
</contrib-group>
<aff id="aff1"><label>1</label><institution>Istituto Dalle Molle di Studi sull&#x2019;Intelligenza Artificiale (IDSIA), USI-SUPSI, Polo Universitario Lugano</institution>, <city>Lugano</city>, <country country="ch">Switzerland</country></aff>
<aff id="aff2"><label>2</label><institution>Swiss Institute of Bioinformatics (SIB)</institution>, <city>Lugano</city>, <country country="ch">Switzerland</country></aff>
<aff id="aff3"><label>3</label><institution>Department of Cardiology, University Medical Center Utrecht, University of Utrecht</institution>, <city>Utrecht</city>, <country country="nl">Netherlands</country></aff>
<aff id="aff4"><label>4</label><institution>Central Diagnostics Laboratory, University Medical Center Utrecht, University of Utrecht</institution>, <city>Utrecht</city>, <country country="nl">Netherlands</country></aff>
<aff id="aff5"><label>5</label><institution>Department of Genome Sciences, University of Virginia</institution>, <city>Charlottesville, VA</city>, <country country="us">United States</country></aff>
<aff id="aff6"><label>6</label><institution>William Harvey Research Institute, NIHR Barts Biomedical Research Centre, Queen Mary University of London</institution>, <city>London</city>, <country country="gb">United Kingdom</country></aff>
<aff id="aff7"><label>7</label><institution>&#x00C9;tude Hering, DPO Associates SARL</institution>, <city>Nyon</city>, <country country="ch">Switzerland</country></aff>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label><bold>Correspondence:</bold> Marco Scutari <email xlink:href="mailto:scutari@bnlearn.com">scutari@bnlearn.com</email></corresp>
<fn id="an1" fn-type="equal"><label>&#x2020;</label><p>These authors have contributed equally to this work</p></fn>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2025-11-18"><day>18</day><month>11</month><year>2025</year></pub-date>
<pub-date publication-format="electronic" date-type="collection"><year>2025</year></pub-date>
<volume>7</volume><elocation-id>1644291</elocation-id>
<history>
<date date-type="received"><day>10</day><month>06</month><year>2025</year></date>
<date date-type="accepted"><day>30</day><month>10</month><year>2025</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 Malpetti, Scutari, Gualdi, van Setten, van der Laan, Haitjema, Lee, Hering and Mangili.</copyright-statement>
<copyright-year>2025</copyright-year><copyright-holder>Malpetti, Scutari, Gualdi, van Setten, van der Laan, Haitjema, Lee, Hering and Mangili</copyright-holder><license><ali:license_ref start_date="2025-11-18">https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
<license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p></license>
</permissions>
<abstract>
<p>Federated learning leverages data across institutions to improve clinical discovery while complying with data-sharing restrictions and protecting patient privacy. This paper provides a gentle introduction to this approach in bioinformatics, and is the first to review key applications in proteomics, genome-wide association studies (GWAS), single-cell and multi-omics studies in their legal as well as methodological and infrastructural challenges. As the evolution of biobanks in genetics and systems biology has proved, accessing more extensive and varied data pools leads to a faster and more robust exploration and translation of results. More widespread use of federated learning may have a similar impact in bioinformatics, allowing academic and clinical institutions to access many combinations of genotypic, phenotypic and environmental information that are undercovered or not included in existing biobanks.</p>
</abstract>
<kwd-group>
<kwd>federated machine learning</kwd>
<kwd>exposome</kwd>
<kwd>secure distributed analysis</kwd>
<kwd>data privacy</kwd>
<kwd>collaborative genomics</kwd>
</kwd-group><funding-group>
<funding-statement>The author(s) declare financial support was received for the research and/or publication of this article. This work was supported by the European Union Horizon 2020 programme [101136962]; UK Research and Innovation (UKRI) under the UK Government&#x2019;s Horizon Europe funding guarantee [10098097, 10104323] and the Swiss State Secretariat for Education, Research and Innovation (SERI).</funding-statement>
</funding-group>
<counts>
<fig-count count="4"/>
<table-count count="3"/><equation-count count="73"/><ref-count count="120"/><page-count count="17"/><word-count count="23121313"/></counts><custom-meta-group><custom-meta><meta-name>section-at-acceptance</meta-name><meta-value>Health Informatics</meta-value></custom-meta></custom-meta-group>
</article-meta>
</front>
<body><sec id="s1" sec-type="intro"><label>1</label><title>Introduction</title>
<p>Sharing personal information has been increasingly regulated in both the EU [with the GDPR and the AI act; (<xref ref-type="bibr" rid="B1">1</xref>, <xref ref-type="bibr" rid="B2">2</xref>)] and the US [with HIPAA and the National AI Initiative Act; (<xref ref-type="bibr" rid="B3">3</xref>, <xref ref-type="bibr" rid="B4">4</xref>)] to mitigate the personal and societal risks associated with their use, particularly in connection with machine learning and AI models (<xref ref-type="bibr" rid="B5">5</xref>). These regulations make multi-centre studies and similar endeavours more challenging, impacting biomedical and clinical research.</p>
<p>Federated learning [FL; (<xref ref-type="bibr" rid="B6">6</xref>, <xref ref-type="bibr" rid="B7">7</xref>)] is a technical solution intended to reduce the impact of these restrictions. FL allows multiple parties to collaboratively train a global machine learning model using their respective data without sharing it themselves, and without any meaningful model performance degradation. Instead, parties only share model updates, making it impractical to reconstruct personal information when the appropriate secure computational measures are implemented (<xref ref-type="bibr" rid="B8">8</xref>).</p>
<p>This approach strengthens <italic>security</italic> by keeping sensitive information local, improves <italic>privacy</italic> by minimising data exposure even between the parties involved, and limits <italic>risk</italic> of data misuse by allowing each party to retain complete control over its data (<xref ref-type="bibr" rid="B9">9</xref>). If enough parties are involved, FL may access larger and more varied data pools than centralised biobanks can provide. This is particularly true if there are legal (or other) barriers to data centralisation, resulting in more accurate and robust models than those produced by any individual party.</p>
<p>FL has proven to be a valuable tool for biomedical research and is expected to gain further traction in the years to come. Its use has improved breast density classification models [accuracy up by 6&#x0025;, generalisability up by 46&#x0025;; (<xref ref-type="bibr" rid="B10">10</xref>)], COVID-19 outcome prediction at both 24h and 72h [up 16&#x0025; and 38&#x0025;; (<xref ref-type="bibr" rid="B11">11</xref>)] and rare tumour segmentation [up by 23&#x0025;&#x2013;33&#x0025; and 15&#x0025;; (<xref ref-type="bibr" rid="B12">12</xref>)] compared to single-party analyses. A consortium of ten pharmaceutical companies found that FL improved structure-activity relationship (QSAR) models for drug discovery [both up 12&#x0025; (<xref ref-type="bibr" rid="B13">13</xref>)]. Early-stage applications building predictive models from electronic health records (<xref ref-type="bibr" rid="B14">14</xref>) have also confirmed no practical performance degradation compared to pooling data from all parties.</p>
<p>To achieve such results, a real-world implementation of FL must overcome several methodological, infrastructural and legal issues. However, biomedical FL literature reviews (<xref ref-type="bibr" rid="B15">15</xref>, <xref ref-type="bibr" rid="B16">16</xref>, among others) are predominantly high-level and considered simulated rather than real-world implementations. Here, we will cover federated methods designed explicitly for bioinformatics and discuss the infrastructure they require, as well as how they meet legal requirements. While various legal frameworks may apply depending on jurisdiction, we place particular emphasis on the European General Data Protection Regulation (GDPR). This focus reflects not only our EU-based perspective but also the GDPR&#x2019;s comprehensive scope, stringent requirements, and influence as a global benchmark for data protection in research and technology. In reviewing the literature, we selected papers that study practical analysis problems (as opposed to proposing methodologies in the abstract) for proteomics, genome-wide association studies (GWAS), and single-cell and multi-omics data. We also considered papers that discuss their feasibility, trade-offs, and performance compared to centralised analyses, and were published after 2016. We used Google Scholar to find and retrieve them.</p>
<p>To this end, we have structured the remainder of the paper as follows: We first review the fundamental concepts and design decisions of FL in <xref ref-type="sec" rid="s2">Section 2</xref>, including different topologies (<xref ref-type="sec" rid="s2a">Section 2.1</xref>), hardware and software (<xref ref-type="sec" rid="s2b">Section 2.2</xref>), data layouts in different parties (<xref ref-type="sec" rid="s2c">Sections 2.3</xref> and <xref ref-type="sec" rid="s2d">2.4</xref>), security (<xref ref-type="sec" rid="s2e">Section 2.5</xref>) and privacy concerns (<xref ref-type="sec" rid="s2f">Section 2.6</xref>). In <xref ref-type="sec" rid="s3">Section 3</xref>, we contrast and compare bioinformatics FL methods for proteomics and differential expression (<xref ref-type="sec" rid="s3a">Section 3.1</xref>), genome-wide association studies (GWAS; <xref ref-type="sec" rid="s3b">Section 3.2</xref>), single-cell RNA sequencing (<xref ref-type="sec" rid="s3c">Section 3.3</xref>), multiomics (<xref ref-type="sec" rid="s3d">Section 3.4</xref>) and medical imaging (<xref ref-type="sec" rid="s3e">Section 3.5</xref>) applications. We conclude the section with notable examples of ready-to-use software tools (<xref ref-type="sec" rid="s3f">Section 3.6</xref>). <xref ref-type="sec" rid="s4">Section 4</xref> provides examples of federated operations common in bioinformatics. Finally, we discuss the legal implications of using FL (<xref ref-type="sec" rid="s5">Section 5</xref>) before summarising our perspective in <xref ref-type="sec" rid="s7">Section 7</xref>.</p>
</sec>
<sec id="s2"><label>2</label><title>Federated learning</title>
<p>FL is a collaborative approach to machine learning model training, where multiple institutions form a consortium to jointly train a shared model by exchanging model updates rather than individual patient data. Typically, FL involves data holders (called &#x201C;clients&#x201D;) sharing their local contributions with a server (<xref ref-type="bibr" rid="B6">6</xref>) as outlined in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref>. The server then creates and shares back a global model, inviting the data holders to update and resubmit their contributions. This process is iterative and involves several rounds of model update exchanges. Unlike traditional centralised computing, FL does not store patient data in a central location. Instead, patient data remain under the control of the respective data owners at their sites, enhancing privacy.</p>
<fig id="F1" position="float"><label>Figure&#x00A0;1</label>
<caption><p>Overview of a typical federated learning (FL) workflow. (1) The central server initialises a <italic>global model</italic>. (2) The server shares the <italic>global model</italic> parameters with consortium parties, referred to as clients. (3) Each client initialises a <italic>local model</italic> from the global model parameters and updates it by training it on its local data. (4) Clients send their updated <italic>local model</italic> parameters back to the server. (5) The server aggregates local model parameters it collected to construct a new <italic>global model</italic>. (6) The server redistributes the updated <italic>global model</italic> parameters to clients to start the next training round. Steps (3)&#x2013;(6) are repeated iteratively until a predefined stopping criterion is met. Active parties in each step are in green, and the arrows show the direction of information flow within the consortium.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-07-1644291-g001.tif"><alt-text content-type="machine-generated">Diagram depicting the six stages of a federated learning process. 1: Global model initialization with a server and three clients, server is active. 2: Initial global model sharing, active server sending data to all clients. 3: Local models training, clients active. 4: Local models sharing, clients send data back to inactive server. 5: Local models aggregation, server active, clients inactive. 6: Updated global model sharing, server active, sending data to all clients. Black circles indicate inactive parties, green circles indicate active parties, with arrows showing information flow.</alt-text>
</graphic>
</fig>
<p>FL has similarities with <italic>distributed computing</italic>, <italic>meta-analysis</italic>, and <italic>trusted research environments</italic> (TREs), but also has key differences, which we highlight below. <xref ref-type="table" rid="T1">Table&#x00A0;1</xref> provides a comparative overview of these approaches.</p>
<table-wrap id="T1" position="float"><label>Table&#x00A0;1</label>
<caption><p>Methodological comparison of centralised learning, federated learning, distributed computing, meta-analysis, and trusted research environments.</p></caption>
<table>
<thead>
<tr>
<th valign="top" align="left">Aspect</th>
<th valign="top" align="center">Centralised learning</th>
<th valign="top" align="center">Federated learning</th>
<th valign="top" align="center">Distributed computing</th>
<th valign="top" align="center">Meta-analysis</th>
<th valign="top" align="center">Trusted research environments (TRE)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Primary goal</td>
<td valign="top" align="left">Aggregate all individual data into one place and train or analyse centrally.</td>
<td valign="top" align="left">Collaborative model training across parties without sharing individual data.</td>
<td valign="top" align="left">Increase speed and scalability; job parallelisation.</td>
<td valign="top" align="left">Combine evidence from completed studies.</td>
<td valign="top" align="left">Provide secure, auditable access to sensitive data for research.</td>
</tr>
<tr>
<td valign="top" align="left">Where individual data live</td>
<td valign="top" align="left">Single central repository.</td>
<td valign="top" align="left">Stay local at each device/institution.</td>
<td valign="top" align="left">Centrally stored, sharded across nodes.</td>
<td valign="top" align="left">Remain with original studies; not pooled.</td>
<td valign="top" align="left">In a secure environment or under local (federated) control (only relevant data are transferred).</td>
</tr>
<tr>
<td valign="top" align="left">How learning happens</td>
<td valign="top" align="left">Training/analysis is run on pooled data in one environment.</td>
<td valign="top" align="left">Participants compute local model updates and send them for secure aggregation in iterative rounds.</td>
<td valign="top" align="left">Tasks are partitioned and executed in parallel; results are combined centrally.</td>
<td valign="top" align="left">Study-level results are aggregated.</td>
<td valign="top" align="left">Researchers run code/queries inside the TRE; outputs are checked before release.</td>
</tr>
<tr>
<td valign="top" align="left">Participation</td>
<td valign="top" align="left">All data contributors must share data with the central site beforehand.</td>
<td valign="top" align="left">Multiple data holders, dynamic participation possible (devices can join/leave).</td>
<td valign="top" align="left">Centrally managed workers/nodes with data partitions.</td>
<td valign="top" align="left">Fixed set of completed/published studies.</td>
<td valign="top" align="left">Approved users/projects with strict governance and access control.</td>
</tr>
<tr>
<td valign="top" align="left">Data assumptions</td>
<td valign="top" align="left">No inherent assumption; depends on chosen analysis method.</td>
<td valign="top" align="left">Must handle non-IID data and uneven sample sizes.</td>
<td valign="top" align="left">Often assumes roughly IID, evenly partitioned data.</td>
<td valign="top" align="left">Models between-study heterogeneity (fixed/random effects).</td>
<td valign="top" align="left">No inherent assumption; depends on chosen analysis method.</td>
</tr>
<tr>
<td valign="top" align="left">What moves across parties</td>
<td valign="top" align="left">Individual data sent to the central site.</td>
<td valign="top" align="left">Model updates (gradients/weights), possibly in shares (SMPC), encrypted or differentially private.</td>
<td valign="top" align="left">Data blocks and intermediate results.</td>
<td valign="top" align="left">Study-level summary statistics.</td>
<td valign="top" align="left">Code/queries go in; vetted results come out.</td>
</tr>
<tr>
<td valign="top" align="left">Privacy posture</td>
<td valign="top" align="left">Highest data exposure (requires trust in central data custodian).</td>
<td valign="top" align="left">Designed to avoid individual data sharing; can support privacy-enhancing techniques.</td>
<td valign="top" align="left">Not privacy-focused (single trust domain).</td>
<td valign="top" align="left">Only summary results shared.</td>
<td valign="top" align="left">Via technical or organisational controls.</td>
</tr>
<tr>
<td valign="top" align="left">Output artefact</td>
<td valign="top" align="left">Single trained model or analysis result from pooled data.</td>
<td valign="top" align="left">Global or personalised model held by each participant.</td>
<td valign="top" align="left">Finished job outputs.</td>
<td valign="top" align="left">Summary results with uncertainty estimates.</td>
<td valign="top" align="left">Analysis outputs are released after disclosure control.</td>
</tr>
<tr>
<td valign="top" align="left">Typical examples</td>
<td valign="top" align="left">Central data warehouse, pooled data in a multi-centre study.</td>
<td valign="top" align="left">Cross-hospital FL; edge device FL.</td>
<td valign="top" align="left">Spark, Hadoop, Ray, HPC clusters.</td>
<td valign="top" align="left">Cochrane-style meta-analyses.</td>
<td valign="top" align="left">UK Biobank RAP, Federated EGA.</td>
</tr>
<tr>
<td valign="top" align="left">Legal responsibilities</td>
<td valign="top" align="left">The central data controller has the responsibility for legal compliance and security.</td>
<td valign="top" align="left">Data controllers retain responsibility for legal compliance and security; data processors have contractual responsibilities linked to that.</td>
<td valign="top" align="left">Depends on data origin: same as centralised learning for single-centre studies, or as federated learning when data comes from multiple centres.</td>
<td valign="top" align="left">Data controllers retain responsibility; data processors must ensure original data use agreements permit meta-analysis.</td>
<td valign="top" align="left">The operator is responsible for TRE security and governance. Data controllers retain legal responsibility for sharing the data.</td>
</tr>
<tr>
<td valign="top" align="left">Legal basis in addition to data subjects&#x2019; consent</td>
<td valign="top" align="left">Only data subjects&#x2019; informed consent is needed.</td>
<td valign="top" align="left">Data sharing agreements for pseudo-anonymised data.</td>
<td valign="top" align="left">Data sharing agreement for individual data in case data from multiple centres are aggregated.</td>
<td valign="top" align="left">No personal data involved if the data are sufficiently aggregated (anonymised); otherwise, same as federated learning.</td>
<td valign="top" align="left">Access agreements between TREs and data controllers: permitted uses, audit, and security protocols. Data processors&#x2019; agreements with TRE.</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="TF1"><p>Consent from data subjects is assumed for data use.</p></fn>
</table-wrap-foot>
</table-wrap>
<p>Distributed computing (DC) (<xref ref-type="bibr" rid="B17">17</xref>) divides a computational task among multiple machines to enhance processing speed and efficiency. Typically, DC starts from a centrally managed data set spread across multiple machines, which is assumed to contain independent and identically distributed observations. Each machine is tasked to process a comparable quantity of data. In contrast, clients independently join FL with their locally held data, which may vary significantly in quantity and distribution. While sharing some techniques with FL, distributed computing aims for computational efficiency and lacks its privacy focus.</p>
<p>On the other hand, meta-analyses (<xref ref-type="bibr" rid="B18">18</xref>) aggregate results across previously completed studies using statistical methods to account for their variations, thus allowing researchers to synthesise findings without accessing personal data and preserve the privacy of individual data sets. Here, FL collaboratively trains a joint model using distributed data to iteratively update it while meta-analysis constructs it in a single step from the pre-existing results. Multiple studies on sequencing data have demonstrated that FL produces results closer to centralised analysis than from meta-analysis (<xref ref-type="bibr" rid="B19">19</xref>, <xref ref-type="bibr" rid="B20">20</xref>).</p>
<p>TREs (<xref ref-type="bibr" rid="B21">21</xref>) provide access to data within a controlled, secure computing environment for conducting analyses, almost always disallowing data sharing. Some TREs have a centralised data location and governance; an example is the Research Analysis Platform (RAP), the TRE for the UK Biobank [UKB; (<xref ref-type="bibr" rid="B22">22</xref>)]. Others, such as FEGA (<xref ref-type="bibr" rid="B23">23</xref>), are decentralised. Each institution maintains its data locally; only the relevant data are securely transferred to the computing environment when the analysis is authorised. Unlike FL, the learning process is not distributed across the data holders. Thus, the trade-off between TREs and FL is between a centralised, trusted entity with extensive computational facilities that can place substantial restrictions on the analysis, and a consortium that requires all parties to apply governance guidelines and provide compute, but can scale both data access and privacy guarantees.</p>
<sec id="s2a"><label>2.1</label><title>Topologies</title>
<p>The <italic>topology</italic> of the FL consortium is determined by the number of participating parties and their defined interactions. Some examples are illustrated in <xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref>. The most common is the <italic>centralised</italic> topology, where multiple data-holding parties (the <italic>clients</italic>) collaboratively train a shared machine learning model through a central server (the <italic>aggregator</italic>) that iteratively collects model updates from each client, updates the global model, and redistributes it back to the clients. Typically, clients do not communicate directly; they only communicate with the central server. In contrast, a <italic>decentralised</italic> topology (<xref ref-type="bibr" rid="B24">24</xref>) lacks a dedicated aggregation server. All consortium parties can potentially serve as model trainers and aggregators, interacting through peer-to-peer communication. Hybrid configurations include, for instance, using two servers: one server handles aggregation of noisy local models, while the other performs auxiliary tasks, such as noise aggregation (<xref ref-type="bibr" rid="B25">25</xref>). Clients can communicate with the servers, and servers can communicate with each other, but clients cannot communicate with each other.</p>
<fig id="F2" position="float"><label>Figure&#x00A0;2</label>
<caption><p>Different FL topologies. In centralised topologies, the data holders are typically referred to as <italic>clients</italic>, reflecting their interaction with a central server. In decentralised topologies, where no central entity exists, the participants are often called <italic>parties</italic>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-07-1644291-g002.tif"><alt-text content-type="machine-generated">Diagram comparing three network topologies. The centralized topology shows a server connected to three clients. The decentralized topology depicts a triangle connection among three parties. The two-server centralized topology includes two servers, marked as aggregator and auxiliary, connecting to three clients. A legend indicates roles with colors: gray for data holder, red for aggregator, and blue for auxiliary role.</alt-text>
</graphic>
</fig>
<p>We will focus on the standard centralised topology and its two-server variant here because, to our knowledge, no bioinformatics applications use decentralised topologies.</p>
</sec>
<sec id="s2b"><label>2.2</label><title>Hardware and software</title>
<p>Hardware, software and models should be chosen with knowledge of the data and inputs from domain and machine learning specialists to design an effective machine learning pipeline (<xref ref-type="bibr" rid="B26">26</xref>).</p>
<p>In terms of infrastructure, FL requires computational resources for each client and server. The optimal hardware configuration depends on the models to be trained; at a minimum, each client must be able to produce model updates from local data, and each server must be able to aggregate those updates and manage the consortium. Connection bandwidth is not necessarily critical: to date, client-server communications contain only a few megabytes of data, reaching 150MB only for large computer vision models, and can be made more compact through compression and model quantisation (<xref ref-type="bibr" rid="B27">27</xref>). On the other hand, latency may be a bottleneck if it limits the hardware utilisation.</p>
<p>As for software, several dedicated FL frameworks, many of which are comparatively analysed in (<xref ref-type="bibr" rid="B28">28</xref>), provide structured tools and environments for developing, deploying, and managing federated machine learning models. While some frameworks, such as Tensorflow Federated [TFF; (<xref ref-type="bibr" rid="B29">29</xref>)], specialise in particular models, others support a broader range of approaches. Notable open-source examples include PySyft (<xref ref-type="bibr" rid="B30">30</xref>) and Flower (<xref ref-type="bibr" rid="B31">31</xref>). Both are supported by active communities and integrate with PyTorch to train complex models. PySyft is a multi-language library focusing on advanced privacy-preserving techniques, including differential privacy and homomorphic encryption. Flower is an FL framework: its modular design and ease of customisation make it particularly useful for large-scale and multi-omics studies involving heterogeneous devices and clients. We will provide examples using these frameworks in <xref ref-type="sec" rid="s3">Section 3</xref> before discussing frameworks explicitly designed for bioinformatics in <xref ref-type="sec" rid="s3f">Section 3.6</xref>.</p>
<p>Other frameworks target healthcare and biomedical applications, but not bioinformatics specifically. For instance, OpenFL (<xref ref-type="bibr" rid="B32">32</xref>) is designed to facilitate FL on sensitive EHRs and medical imaging data; it supports different data partitioning schemes (<xref ref-type="sec" rid="s2d">Section 2.4</xref>) but struggles with heterogeneous cross-device FL (<xref ref-type="sec" rid="s2c">Section 2.3</xref>). NVIDIA Clara, which was used in Dayan et al. (<xref ref-type="bibr" rid="B11">11</xref>), has similar limitations.</p>
</sec>
<sec id="s2c"><label>2.3</label><title>Usage scenarios: cross-device and cross-silo</title>
<p>FL applications take different forms in different domains. Many small, low-powered clients, such as wearable medical devices from the Internet of Things, may produce the data needed to train the federated machine learning model. Such <italic>cross-device</italic> communications are often unreliable: passing lightweight model updates instead of individual data largely addresses connectivity issues and privacy risks.</p>
<p>FL may also involve a small number of parties, each possessing large amounts of sensitive data (<xref ref-type="bibr" rid="B33">33</xref>), stored within their &#x201C;data silos&#x201D;. This setting, often called the emphcross-silo scenario, is common in healthcare and bioinformatics. Here, the main priority is to minimise the privacy risks associated with data sharing and comply with regulations. Additionally, minimising large data transfers is also computationally advantageous when modelling large volumes of information, such as whole-genome sequences.</p>
<p>These two scenarios differ in how they handle model updates. In the cross-silo scenario, all (few) data holders in the consortium must participate in each update. In contrast, we can rely on a subset of (the many) data holders in the cross-device scenario because each holds a smaller share of the overall data. This article focuses on the cross-silo scenario, as nearly all bioinformatics applications fall within this framework.</p>
</sec>
<sec id="s2d"><label>2.4</label><title>Data partitioning and heterogeneity</title>
<p>Data may be partitioned along two axes: each party may record the same features for different samples or features describing the same samples (<xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref>). In the first scenario, known as <italic>horizontal</italic> FL, different parties may each possess genomic sequencing data from different individuals. In contrast, in <italic>vertical</italic> FL, one party may hold data from one omic type (say, genomic data), while another may have data from a different phenotype or omic type (say, proteomic data) for the same individuals. Horizontal FL is by far the most prevalent approach in bioinformatics.</p>
<fig id="F3" position="float"><label>Figure&#x00A0;3</label>
<caption><p>Horizontal and vertical data partitioning in FL. In horizontal FL (left), clients hold data sets with the same features (<italic>c1&#x2013;c3</italic>) but different subsets of samples (<italic>r1&#x2013;r8</italic>). In vertical FL (right), clients hold data sets with different features (<italic>c1&#x2013;c6</italic>) but the same set of samples (<italic>r1&#x2013;r4</italic>).</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-07-1644291-g003.tif"><alt-text content-type="machine-generated">Two diagrams illustrate data partitioning methods. The left shows horizontal partitioning with rows r1-r4 for Client 1 and r5-r8 for Client 2. The right shows vertical partitioning with columns c1-c3 for Client 1 and c4-c6 for Client 2. Both diagrams depict colored squares representing data segments.</alt-text>
</graphic>
</fig>
<p>Significant variations in sample size and feature distributions between data holders often exist. This heterogeneity allows FL to better capture the variability of the underlying population, resulting in transferable models that generalise well (<xref ref-type="bibr" rid="B34">34</xref>). Clearly, if data holders collect observations from distinct populations, any federated model trained from them must be correctly specified to capture population structure and avoid bias in inference and prediction. If the populations are known, we can train targeted population-specific models alongside the global one (<xref ref-type="bibr" rid="B35">35</xref>). Otherwise, we can use clustering to identify them from the available data (<xref ref-type="bibr" rid="B36">36</xref>). Accounting for variations in measurements, definitions and distributions to harmonise data across parties is also fundamental but is much more challenging because access to data is restricted, even more so than in meta-analysis (<xref ref-type="bibr" rid="B27">27</xref>).</p>
</sec>
<sec id="s2e"><label>2.5</label><title>Security and privacy</title>
<p>FL reduces some privacy and security risks by design by passing model updates between parties instead of centralising data in a single location. However, it does not eliminate them completely.</p>
<p>In terms of privacy, deep learning models are the most problematic in machine learning because of their ability to memorise training data. They leak individual observations during training [through model updates; (<xref ref-type="bibr" rid="B37">37</xref>)], after training [through their parameters; (<xref ref-type="bibr" rid="B38">38</xref>)] and during inference [membership attacks; (<xref ref-type="bibr" rid="B39">39</xref>, <xref ref-type="bibr" rid="B40">40</xref>)]. More broadly, individual reidentification is an issue for genetic data (<xref ref-type="bibr" rid="B41">41</xref>) and all the models learned from them. For instance, (<xref ref-type="bibr" rid="B42">42</xref>) has demonstrated that it is possible to identify an individual from the linear model learned in an association study from just 25 genes. However, such works make unrealistic assumptions on the level of access to the models and the data (<xref ref-type="bibr" rid="B43">43</xref>): even basic infrastructure security measures and the distributed nature of the data will make such identification difficult under the best circumstances. The privacy-enhancing techniques discussed in <xref ref-type="sec" rid="s2f">Section 2.6</xref> can make such efforts wholly impractical.</p>
<p>As for security, we must consider different <italic>threat models</italic>, understanding what information requires protection, their vulnerabilities, and how to mitigate or respond to threats. Internal and external threats to the consortium should be treated equally with <italic>security in depth</italic> design and implementation decisions that consider parties untrusted. Security threats, such as membership attacks and model inversion attacks (<xref ref-type="bibr" rid="B44">44</xref>), can originate equally from parties and external adversaries that seek to abuse the model inference capabilities to extract information about the data. On the other hand, adversarial attacks are more likely to originate from consortium parties that seek to introduce carefully crafted data or model updates into the training process to produce a global model with undesirable behaviour. Some examples are data poisoning (<xref ref-type="bibr" rid="B45">45</xref>), manipulation (<xref ref-type="bibr" rid="B46">46</xref>) and Byzantine attacks (<xref ref-type="bibr" rid="B47">47</xref>).</p>
<p>Encrypting communication channels, implementing strict authentication (to verify each party&#x2019;s identity) and authorisation (to control which information and resources each party has access to or shares) schemes, and keeping comprehensive access logs for audit can secure any machine learning pipeline, including federated ones. Similarly, using an experiment tracking platform makes it possible to track data provenance, audit both the data and the training process and ensure the reproducibility of results (<xref ref-type="bibr" rid="B26">26</xref>). These measures must be complemented by federated models resistant to these threats at training and inference time, as thoroughly discussed in Yin et al. (<xref ref-type="bibr" rid="B48">48</xref>).</p>
</sec>
<sec id="s2f"><label>2.6</label><title>Privacy-enhancing techniques</title>
<p>Privacy-enhancing techniques improve the confidentiality of sensitive information during training. We summarise the most relevant below, illustrating them in <xref ref-type="fig" rid="F4">Figure&#x00A0;4</xref>.</p>
<fig id="F4" position="float"><label>Figure&#x00A0;4</label>
<caption><p>Example of privacy-preserving sum computation in FL using three different techniques. Note that although differential privacy is described in <xref ref-type="sec" rid="s2f">Section 2.6</xref>, it is not included in this example, as it would not be suitable for such a calculation.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-07-1644291-g004.tif"><alt-text content-type="machine-generated">Example text describing a privacy-preserving sum in federated learning with three techniques: homomorphic encryption, secure multiparty computation, and a two-server approach. Each method outlines steps for securely calculating the sum of values held by three clients.</alt-text>
</graphic>
</fig>
<p>Homomorphic encryption [HE; (<xref ref-type="bibr" rid="B49">49</xref>)] is a cryptographic technique that enables computations to be performed directly on encrypted data (ciphertexts) without requiring decryption. The outcome of operations on ciphertexts matches the result of performing the same operations on the corresponding non-encrypted values (plaintexts) when decrypted. HE can be either <italic>fully homomorphic</italic> (FHE), which allows for arbitrary computations, or <italic>partially homomorphic</italic> (PHE), which supports only a specific subset of mathematical operations. For instance, the Paillier PHE scheme (<xref ref-type="bibr" rid="B50">50</xref>) only supports additive operations on encrypted data. FHE requires considerable computational resources for encryption and decryption. PHE is less flexible but computationally more efficient, making it a common choice in practical applications.</p>
<p>Secure multiparty computation [SMPC; (<xref ref-type="bibr" rid="B51">51</xref>)] is a peer-to-peer protocol allowing multiple parties to compute a function over their data collaboratively, similarly to <xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref> (centre). Each data holder divides their data into random shares and distributes them among all parties in the consortium, thus ensuring that no single party can access the complete data set. The shares are then combined during the computation process, often with the assistance of a server, to produce the correct result while preserving data privacy. SMPC ensures high security with exact results and keeps data private throughout the computation process. However, SMPC is computationally intensive and requires peer-to-peer communication, leading to high communication overhead. Its complexity also increases with the number of participants, limiting scalability.</p>
<p>Another approach to securing FL is using an aggregator and a compensator server in a centralised two-server topology [<xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref>, right; (<xref ref-type="bibr" rid="B25">25</xref>)]. Each client adds a noise pattern to their local data, sharing the former with the compensator (which aggregates all noise patterns) and the latter with the aggregator (which aggregates the noisy data and trains the model). The aggregator then obtains the overall noise pattern from the compensator and removes it from the aggregated noisy data, allowing for denoised model training. This two-server approach is efficient: it requires neither extensive computation in the clients nor peer-to-peer communication. However, it makes infrastructure more complex and requires trust in both servers not to collude to compromise the privacy of individual contributions.</p>
<p>Unlike the above methods, which are encryption-based methods ensuring data confidentiality during transmission or storage, differential privacy, another popular technique for data-protection in federated learning, is not an encryption system but rather a technique that focuses on privacy by ensuring that the output of data analysis does not leak sensitive information about the underlying dataset. Differential privacy [DP; (<xref ref-type="bibr" rid="B52">52</xref>)] achieves this through a mathematical framework designed to ensure analyses remain statistically consistent, regardless of whether any specific individual&#x2019;s data is included or excluded. This property guarantees that sensitive information about individuals cannot be inferred from the results up to a preset &#x201C;privacy budget&#x201D; worth of operations. DP is typically implemented by introducing noise into the data (<xref ref-type="bibr" rid="B53">53</xref>, <xref ref-type="bibr" rid="B54">54</xref>), weight clipping in the training process (<xref ref-type="bibr" rid="B55">55</xref>, <xref ref-type="bibr" rid="B56">56</xref>) or predictions (<xref ref-type="bibr" rid="B57">57</xref>, <xref ref-type="bibr" rid="B58">58</xref>) to obfuscate individual contributions. The amount of noise must be carefully calibrated to balance predictive accuracy and privacy within the analysis: too little noise undermines privacy, and too much reduces performance. This effect is more pronounced within specific subgroups underrepresented in the training set (<xref ref-type="bibr" rid="B59">59</xref>).</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Federated learning in bioinformatics</title>
<p>Most FL literature focuses on general algorithms and is motivated by applications other than bioinformatics, such as digital twins for smart cities (<xref ref-type="bibr" rid="B60">60</xref>), smart industry (<xref ref-type="bibr" rid="B61">61</xref>) and open banking and finance (<xref ref-type="bibr" rid="B62">62</xref>). Even the clinical literature mainly focuses on different types of data and issues (<xref ref-type="bibr" rid="B11">11</xref>, <xref ref-type="bibr" rid="B63">63</xref>). Here, we highlight and discuss notable examples of FL designed specifically for bioinformatics, summarised in <xref ref-type="table" rid="T2">Table&#x00A0;2</xref>. They are all in the early stages of development, so their reliability, reproducibility, and scalability are open questions. However, they hint at the potential of FL to perform better than meta-analysis and single-client analyses on real-world data, comparing favourably to centralised data analyses where data are pooled in a central location while addressing data sharing and use concerns (<xref ref-type="bibr" rid="B15">15</xref>, <xref ref-type="bibr" rid="B20">20</xref>).</p>
<table-wrap id="T2" position="float"><label>Table&#x00A0;2</label>
<caption><p>Summary of key federated learning applications in bioinformatics.</p></caption>
<table>
<thead>
<tr>
<th valign="top" align="left">Field</th>
<th valign="top" align="center">Application</th>
<th valign="top" align="center">FL methods</th>
<th valign="top" align="center">Data</th>
<th valign="top" align="center">References</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Proteomics and differential gene expression</td>
<td valign="top" align="left">Variance estimation, gene expression, cell type classification</td>
<td valign="top" align="left">FedDEqMS, FedProt, HyFed with limma voom, DL with Flower and TFF</td>
<td valign="top" align="left">Mass spectrometry, RNA-seq, 1&#x2013;10 k individuals and 10&#x2013;100 M biomarkers</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B20">20</xref>, <xref ref-type="bibr" rid="B25">25</xref>, <xref ref-type="bibr" rid="B67">67</xref>, <xref ref-type="bibr" rid="B70">70</xref>)</td>
</tr>
<tr>
<td valign="top" align="left">GWAS</td>
<td valign="top" align="left">Association testing, scalable regression</td>
<td valign="top" align="left">FedGLMM, federated GRM estimator, FedGMMAT, REGENIE with MPC/HE</td>
<td valign="top" align="left">SNPs, genotype and phenotype data, 2.5&#x2013;275 k individuals and 0.5&#x2013;38 M SNPs</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B71">71</xref>&#x2013;<xref ref-type="bibr" rid="B74">74</xref>)</td>
</tr>
<tr>
<td valign="top" align="left">Single-cell RNA-seq</td>
<td valign="top" align="left">Cell type classification</td>
<td valign="top" align="left">scFed: ACTINN, SVM, XGBoost, GeneFormer</td>
<td valign="top" align="left">scRNA-seq from 2&#x2013;55 k cells and 1&#x2013;2 k genes</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B76">76</xref>, <xref ref-type="bibr" rid="B77">77</xref>)</td>
</tr>
<tr>
<td valign="top" align="left">Multi-omics</td>
<td valign="top" align="left">Prognosis (cancer), diagnostics (Parkinson&#x2019;s)</td>
<td valign="top" align="left">Vertical FL, adaptive neural networks, benchmarking with Flower</td>
<td valign="top" align="left">Genomics, transcriptomics, proteomics, 100&#x2013;1,200 individuals and 100&#x2013;700 features</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B78">78</xref>, <xref ref-type="bibr" rid="B79">79</xref>)</td>
</tr>
<tr>
<td valign="top" align="left">Medical Imaging</td>
<td valign="top" align="left">Classification, segmentation, semi-supervised training</td>
<td valign="top" align="left">Federated labelling, harmonised feature learning</td>
<td valign="top" align="left">MRI, x-rays, histology images, 5&#x2013;71 k scans</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B80">80</xref>&#x2013;<xref ref-type="bibr" rid="B85">85</xref>)</td>
</tr>
<tr>
<td valign="top" align="left">Specialised tools</td>
<td valign="top" align="left">FL software for bioinformatics workflows</td>
<td valign="top" align="left">sfkit, FeatureCloud</td>
<td valign="top" align="left">All the data above</td>
<td valign="top" align="left">(<xref ref-type="bibr" rid="B19">19</xref>, <xref ref-type="bibr" rid="B86">86</xref>&#x2013;<xref ref-type="bibr" rid="B88">88</xref>)</td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s3a"><label>3.1</label><title>Proteomics and differential gene expression</title>
<p>Proteomics studies the complex protein dynamics that govern cellular processes and their interplay with physiological and pathological states, such as cancer (<xref ref-type="bibr" rid="B64">64</xref>), to improve risk assessment, treatment selection and patient monitoring. Differential expression analyses focus specifically on comparing expression levels across different conditions, tissues, or cell types to identify genes with statistically significant differences (<xref ref-type="bibr" rid="B65">65</xref>).</p>
<p>In addition to the issues discussed in <xref ref-type="sec" rid="s2">Section 2</xref>, FL in proteomics must overcome the challenge of integrating data from different platforms (<xref ref-type="bibr" rid="B66">66</xref>) while accounting for imbalanced samples and batch effects. Cai et al. (<xref ref-type="bibr" rid="B67">67</xref>) produced a federated implementation of DEqMS [FedProt; (<xref ref-type="bibr" rid="B68">68</xref>)] for variance estimation in mass spectrometry-based data that successfully identifies top differentially-abundant proteins in two real-world data sets using label-free quantification and tandem mass tags.</p>
<p>Zolotareva et al. (<xref ref-type="bibr" rid="B20">20</xref>) implemented a federated <italic>limma voom</italic> pipeline (<xref ref-type="bibr" rid="B69">69</xref>) on top of HyFed (<xref ref-type="bibr" rid="B25">25</xref>), which uses the aggregator-compensator two-server topology we described earlier. This approach was demonstrated on two extensive RNA-seq data sets, proving robust to heterogeneity across clients and batch effects. Hannemann et al. (<xref ref-type="bibr" rid="B70">70</xref>) trained a federated deep-learning model for cell type classification using both Flower and TFF and different architectures, with similar results.</p>
</sec>
<sec id="s3b"><label>3.2</label><title>Genome-wide association studies</title>
<p>Genome-wide association studies (GWAS) aim to identify genomic variants statistically associated with a qualitative (say, a case-control label) or quantitative trait (say, body mass index). These studies mainly use regression models, which can be largely trained using general-purpose federated regression implementations with minor modifications to address scalability and correct for population structure [see, for instance, (<xref ref-type="bibr" rid="B43">43</xref>)].</p>
<p>Li et al. (<xref ref-type="bibr" rid="B71">71</xref>) has developed the most complete adaptation of these models to federated GWAS in the literature: it provides linear and logistic regressions with fixed and random effects and accounts for population structure via a genomic relatedness matrix. Wang et al. (<xref ref-type="bibr" rid="B72">72</xref>) further provides a federated estimator for the genomic relatedness matrix. Finally, Li et al. (<xref ref-type="bibr" rid="B73">73</xref>) describes the federated association tests for the genomic variants associated with this model. All these steps incorporate HE to ensure privacy in the GWAS.</p>
<p>As an alternative, Cho et al. (<xref ref-type="bibr" rid="B74">74</xref>) built on REGENIE (<xref ref-type="bibr" rid="B75">75</xref>) to avoid using a genomic relatedness matrix and increase the scalability of GWAS while using MPC and HE to secure the data. Despite the overhead introduced by the encryption, this approach is efficient enough to work on a cohort of 401 k individuals from the UK Biobank and 90 million single-nucleotide polymorphisms (SNPs) in less than 5 h.</p>
</sec>
<sec id="s3c"><label>3.3</label><title>Single-cell RNA sequencing</title>
<p>Single-cell RNA sequencing (scRNA-seq) measures gene expression at the cellular level, rather than aggregating it at the tissue level as in bulk RNA sequencing, and identifies the distinct expression profiles of individual cell populations within tissues (<xref ref-type="bibr" rid="B89">89</xref>, <xref ref-type="bibr" rid="B90">90</xref>).</p>
<p>Wang et al. (<xref ref-type="bibr" rid="B76">76</xref>) developed scFed, a unified FL framework integrating four algorithms for cell type classification from scRNA-seq data: the ACTINN neural network (<xref ref-type="bibr" rid="B91">91</xref>), explicitly designed for this task; a linear support vector machine; XGBoost based on Li et al. (<xref ref-type="bibr" rid="B77">77</xref>); and the GeneFormer transformer (<xref ref-type="bibr" rid="B92">92</xref>). They evaluated scFed on eight data sets evenly distributed among 2&#x2013;20 clients, suggesting that the federated approach has a predictive accuracy comparable to that obtained by pooling the data and better than that in individual clients. However, the overhead during training increases with the number of clients, limiting the scalability to larger consortia. More recently, Bakhtiari et al. (<xref ref-type="bibr" rid="B93">93</xref>) introduced FedscGen, a federated implementation of scGen (<xref ref-type="bibr" rid="B94">94</xref>), a variational autoencoder-based method for batch effect correction. FedscGen employs secure SMPC for privacy-preserving aggregation and achieves results that closely match those obtained under centralised training.</p>
</sec>
<sec id="s3d"><label>3.4</label><title>Multi-omics</title>
<p>Proteomics, genomics, and transcriptomics capture different aspects of biological processes. Integrating large data sets from different omics offers deeper insights into their underlying mechanisms (<xref ref-type="bibr" rid="B95">95</xref>). Vertical FL allows multiple parties to combine various features of the same patients into multimodal omics data sets without exposing sensitive information (<xref ref-type="bibr" rid="B96">96</xref>). For instance, Wang et al. (<xref ref-type="bibr" rid="B78">78</xref>) trained a deep neural network with an adaptive optimisation module for cancer prognosis evaluation from multi-omics data. The neural network performs feature selection while the adaptive optimisation module prevents overfitting, a common issue in small high-dimensional samples (<xref ref-type="bibr" rid="B97">97</xref>). This method performs better than a single-omic analysis, but the improvement in predictive accuracy is strongly model-dependent. Another example is Danek et al. (<xref ref-type="bibr" rid="B79">79</xref>), who built a diagnostic model for Parkinson&#x2019;s disease: they provided a reproducible setup for evaluating several multi-omics models trained on pre-processed, harmonised and artificially horizontally federated data using Flower. Their study identifies a general but not substantial reduction in FL performance compared to centrally trained models, which increases with the number of clients and is variably affected by client heterogeneity.</p>
</sec>
<sec id="s3e"><label>3.5</label><title>Medical imaging</title>
<p>Medical imaging studies the human body&#x2019;s interior to diagnose abnormalities in its anatomy and physiology from digital images such as those obtained by radiography, magnetic resonance and ultrasound devices (<xref ref-type="bibr" rid="B98">98</xref>). It is the most common application of FL in the medical literature (<xref ref-type="bibr" rid="B16">16</xref>). As a result, protocols for image segmentation and diagnostic prediction are well documented. Notable case studies target breast cancer (<xref ref-type="bibr" rid="B10">10</xref>), melanomas (<xref ref-type="bibr" rid="B83">83</xref>), cardiovascular disease (<xref ref-type="bibr" rid="B84">84</xref>), COVID-19 (<xref ref-type="bibr" rid="B11">11</xref>, <xref ref-type="bibr" rid="B85">85</xref>).</p>
<p>Machine learning applications that use medical imaging data typically face challenges, including incomplete or inaccurate labelling and the normalisation of images from different scanners and different protocols. Bdair et al. (<xref ref-type="bibr" rid="B80">80</xref>) explored a federated labelling scheme in which clients produced ground-truth labels for skin lesions in a privacy-preserving manner, improving classification accuracy. Yan et al. (<xref ref-type="bibr" rid="B81">81</xref>) also proposed an efficient scheme to use data sets mainly comprising unlabelled images, focusing on chest x-rays. Furthermore, Jiang et al. (<xref ref-type="bibr" rid="B82">82</xref>) apply FL to learn a harmonised feature set from heterogeneous medical images, improving both the classification and segmentation of histology and MRI scans.</p>
</sec>
<sec id="s3f"><label>3.6</label><title>Ready-to-use FL tools for bioinformatics</title>
<p>The need for user-friendly FL implementations of common bioinformatics workflows has driven the creation of secure collaborative analysis tools (<xref ref-type="bibr" rid="B87">87</xref>, <xref ref-type="bibr" rid="B88">88</xref>, <xref ref-type="bibr" rid="B99">99</xref>). Two notable examples are sfkit and FeatureCloud.</p>
<p>The sfkit framework (<xref ref-type="bibr" rid="B19">19</xref>) facilitates federated genomic analyses by implementing GWAS, principal component analysis (PCA), genetic relatedness and a modular architecture to complement them as needed. It provides a web interface featuring a project bulletin board, chat functions, study parameter configurations and results sharing. State-of-the-art cryptographic tools for privacy preservation based on SMPC and HE ensure data protection (<xref ref-type="bibr" rid="B100">100</xref>).</p>
<p>FeatureCloud (<xref ref-type="bibr" rid="B86">86</xref>) is an integrated solution that enables end users without programming experience to build custom workflows. It provides modules to run on the clients and servers in the consortium. Unlike sfkit, FeatureCloud allows users to publish applications in its app store, including regression models, random forests and neural networks. Developers must also document how privacy guarantees are implemented in their apps.</p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Practical insights on federation</title>
<p>This section offers practical insights to help readers interested in building a federated and secure analogue of an existing bioinformatics algorithm. We focus on horizontal FL with the centralised topology from <xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref> (left). Consider <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM1"><mml:mi>K</mml:mi></mml:math></inline-formula> different clients, each possessing a local data set <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM2"><mml:msup><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM3"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:math></inline-formula>. Each data set contains <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM4"><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> samples, denoted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM5"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM6"><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> represents the sample index, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM7"><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>P</mml:mi></mml:math></inline-formula> represents the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM8"><mml:mi>P</mml:mi></mml:math></inline-formula> features for each sample. We denote a row (column) of the matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM9"><mml:msup><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM10"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x002A;</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula> (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM11"><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mo>&#x002A;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula>). This describes a distributed data set of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM12"><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:munderover><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> observations:<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM1"><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>X</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22EF;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mi>X</mml:mi><mml:mi>K</mml:mi></mml:msup></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula>The following sections assume that an FL consortium has been established, the necessary infrastructure is operational, and an appropriate FL framework has been selected and installed. It is also assumed that a secure aggregation protocol has been chosen, such as those described in <xref ref-type="sec" rid="s2f">Section 2.6</xref> and <xref ref-type="fig" rid="F4">Figure&#x00A0;4</xref>. The choice of a specific secure aggregation protocol may depend on several factors, including technology and infrastructure (e.g., the availability of a particular FL topology that drives the choice), as well as privacy risks and scalability concerns, as discussed in <xref ref-type="sec" rid="s2f">Section 2.6</xref>. In the following sections, we provide a general overview of sum-based mathematical operations built upon a secure aggregation protocol, as well as operations involving federated averaging [FedAvg; (<xref ref-type="bibr" rid="B6">6</xref>)].</p>
<p>Coding examples using Flower (<xref ref-type="bibr" rid="B31">31</xref>) are available in our GitHub repository (<ext-link ext-link-type="uri" xlink:href="https://github.com/IDSIA/FL-Bioinformatics">https://github.com/IDSIA/FL-Bioinformatics</ext-link>). We chose Flower because it has a shallow learning curve for new FL users and provides a good balance between simplicity and flexibility when implementing custom algorithms. Riedel et al. (<xref ref-type="bibr" rid="B28">28</xref>) also identified Flower as a promising framework because it has a large, active, and growing community of developers and scientists, as well as extensive tutorials and documentation. In our examples, secure summation is performed using the secure aggregation protocol <monospace>SecAgg+</monospace> (<xref ref-type="bibr" rid="B101">101</xref>). This protocol combines encryption with SMPC, using a multiparty approach in which each client interacts with only a subset of the others. It is particularly suitable for several FL contexts, as it is robust to client dropout and highly scalable. In particular, a relevant aspect of the bioinformatics domain is that it scales linearly with the size of the vectors to be aggregated (<xref ref-type="bibr" rid="B102">102</xref>).</p>
<sec id="s4a"><label>4.1</label><title>Sum-based computations</title>
<p>Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM13"><mml:msup><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> be real numbers stored by individual clients. We define the secure sum of these numbers, performed through the selected secure aggregation protocol, as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM14"><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:msup><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>. We can build on this simple, secure sum to construct a wide range of operations. However, note that as the complexity of operations increases, the amount of information revealed to the server may also increase. Sum-based operations include:
<list list-type="bullet">
<list-item>
<p>The <italic>overall sample size</italic> of the distributed data set as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM15"><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> from the local sample sizes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM16"><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>.</p></list-item>
<list-item>
<p>The <italic>mean value of the</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM17"><mml:mi>j</mml:mi></mml:math></inline-formula><italic>th feature</italic>, given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM18"><mml:mi>N</mml:mi></mml:math></inline-formula>, as<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM2"><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula>Each client computes the inner sum on their local data, whereas the outer one is a secure sum aggregated across clients by the server.</p></list-item>
<list-item>
<p>The <italic>variance of the</italic> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM19"><mml:mi>j</mml:mi></mml:math></inline-formula><italic>th feature</italic>, given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM20"><mml:mi>N</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM21"><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, as<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM3"><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:math></disp-formula>which can be used to standardise the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM22"><mml:mi>j</mml:mi></mml:math></inline-formula>th feature as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM23"><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mo>&#x002A;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>/</mml:mo><mml:msqrt><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:msqrt></mml:math></inline-formula>.</p></list-item>
<list-item>
<p>The <italic>Pearson correlation coefficient</italic> of two features <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM24"><mml:mi>j</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM25"><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula>, given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM26"><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM27"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mspace width=".1em"/><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub></mml:math></inline-formula>, as<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM4"><mml:msub><mml:mi>&#x03C1;</mml:mi><mml:mrow><mml:mspace width=".1em"/><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:munderover><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mspace width=".1em"/><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msqrt><mml:msub><mml:mi>V</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mspace width=".1em"/><mml:msup><mml:mi>j</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub></mml:msqrt></mml:mfrac></mml:mrow><mml:mo>.</mml:mo></mml:math></disp-formula></p></list-item>
<list-item>
<p>The <italic>matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM28"><mml:msup><mml:mi>X</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mi>X</mml:mi></mml:math></inline-formula></italic>, as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM29"><mml:msup><mml:mi>X</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:msup><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM30"><mml:mo>&#x2295;</mml:mo></mml:math></inline-formula> is a secure element-wise sum. This matrix is equivalent to the covariance matrix for standardised data sets and is commonly used for PCA.</p></list-item>
</list>Beyond these general-purpose examples, many operations specific to bioinformatics pipelines also rely on simple sums. These operations are often straightforward generalisations or compositions of the examples introduced above.</p>
<p>In differential gene expression studies, for instance, filtering out weakly expressed genes is standard practice. Weakly expressed genes can be defined as those whose expression values fall below a specified threshold <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM31"><mml:mi>t</mml:mi></mml:math></inline-formula> in, for instance, 70&#x0025; of the samples. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM32"><mml:msup><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> be a vector belonging to client <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM33"><mml:mi>k</mml:mi></mml:math></inline-formula>, where each vector component represents the number of samples in which the expression level of the gene (e.g., counts) exceeds the threshold <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM34"><mml:mi>t</mml:mi></mml:math></inline-formula>. The server can securely calculate <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM35"><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:msup><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> and identify weakly expressed genes as those whose corresponding components of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM36"><mml:mi>v</mml:mi></mml:math></inline-formula> are smaller than 0.7.</p>
<p>A fundamental preliminary step in a GWAS is identifying the minor allele and its frequency. Let <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM37"><mml:msup><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM38"><mml:msup><mml:mi>c</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM39"><mml:msup><mml:mi>g</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM40"><mml:msup><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> be vectors belonging to client <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM41"><mml:mi>k</mml:mi></mml:math></inline-formula>, where each component corresponds to a specific SNP. The components of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM42"><mml:msup><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM43"><mml:msup><mml:mi>c</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM44"><mml:msup><mml:mi>g</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM45"><mml:msup><mml:mi>t</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> represent the number of samples in which nucleotides <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM46"><mml:mi>A</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM47"><mml:mi>C</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM48"><mml:mi>G</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM49"><mml:mi>T</mml:mi></mml:math></inline-formula> are observed, respectively. The server can securely compute the aggregated allele counts across all clients as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM50"><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:msup><mml:mi>a</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula> and similarly <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM51"><mml:mi>c</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM52"><mml:mi>g</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM53"><mml:mi>t</mml:mi></mml:math></inline-formula> (where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM54"><mml:mi>t</mml:mi></mml:math></inline-formula> can also be computed by difference from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM55"><mml:mi>N</mml:mi></mml:math></inline-formula> and the other three vectors). For each SNP, the minor allele is determined by comparing the corresponding components of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM56"><mml:mi>a</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM57"><mml:mi>c</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM58"><mml:mi>g</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM59"><mml:mi>t</mml:mi></mml:math></inline-formula>: the allele with the smaller value is designated as the minor allele. This operation is crucial because the minor allele within a single client&#x2019;s population may differ from the minor allele when considering the whole distributed data set. Ensuring a consistent definition of the minor allele across all clients is essential for reliable downstream analyses.</p>
</sec>
<sec id="s4b"><label>4.2</label><title>Federated averaging computations</title>
<p>FedAvg is a widely used algorithm for training deep neural networks in FL. It iteratively computes a weighted average of model parameters across clients, with weights proportional to the local sample sizes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM60"><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup></mml:math></inline-formula>. Thus, it can be applied to any parametric model, including linear models.</p>
<p>FedAvg proceeds as illustrated in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref>. The server first broadcasts an initial global model with parameters <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM61"><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula>. At each step of the algorithm, clients start with the global model <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM62"><mml:msub><mml:mi>w</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula> and perform local updates to produce updated local models <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM63"><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:msubsup></mml:math></inline-formula>. The global model is updated after each round of local training as the weighted sum of the local models:<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM5"><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mo>&#x2295;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>K</mml:mi></mml:msubsup><mml:mrow><mml:mfrac><mml:msup><mml:mi>n</mml:mi><mml:mi>k</mml:mi></mml:msup><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:msubsup><mml:mi>w</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:msubsup><mml:mo>,</mml:mo></mml:math></disp-formula>where we use the secure sum <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM64"><mml:mo>&#x2295;</mml:mo></mml:math></inline-formula> for aggregation (FedAvg is itself a sum-based operation). After aggregation, the updated global model is distributed back to the clients.</p>
<p>However, many bioinformatics pipelines rely on linear models rather than deep learning models. One commonly used model is logistic regression, which is applied in tasks such as gene expression analysis and GWAS. A federated implementation of logistic regression can be achieved by starting with a standard implementation and applying FedAvg, which aggregates the local models after a specified number of iterations performed by the local logistic regressions.</p>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Legal aspects of federated learning</title>
<p>The legal frameworks used within FL consortia are rarely discussed in the literature. Ballhausen et al. (<xref ref-type="bibr" rid="B103">103</xref>) describes both the technical and legal aspects of a European pilot study implementing a federated statistical analysis by secure multiparty computation. They established agreements between parties similar to those between participants in a multi-centre clinical trial, as using SMPC and exchanging model gradients was legally considered data pseudonymisation (rather than anonymisation). FL was determined to require the same level of data protection as regular data sharing, which is also the most conservative course of action suggested in Truong et al. (<xref ref-type="bibr" rid="B9">9</xref>) and Lieftink et al. (<xref ref-type="bibr" rid="B104">104</xref>). All clients jointly controlled the consortium and were responsible for determining the purpose and means of processing, including obtaining approval from the respective Ethics Committees. Sun et al. (<xref ref-type="bibr" rid="B105">105</xref>) similarly describes the server in their consortium as a trusted and secure environment, supported by a legal joint controller agreement between the data owners.</p>
<p>Following Ballhausen et al. (<xref ref-type="bibr" rid="B103">103</xref>), establishing an FL consortium could be expected to require all participating and involved parties to execute agreements that regulate their interactions, the so-called DPA or DSA (data protection/processing/sharing agreements). Doing so will establish the level of trust between parties and their responsibilities towards each other, third parties, and patients. Risk aversion suggests that it should include a data-sharing clause to allow for the sharing of information, similar to a centralised analysis, as described in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref>. No party has access to the data of other parties. Still, it is theoretically possible that, in some cases, the model updates shared during FL could be deanonymised by malicious internal or external attackers (<xref ref-type="bibr" rid="B9">9</xref>). Parties may then be reluctant to treat that information as non-personally identifiable without formal mathematical proof of anonymisation and prefer to establish data protection responsibilities with a data-sharing agreement. In the EU (GDPR), but also other jurisdictions (national data protection laws), &#x201C;all the means reasonably likely to be used should be considered to determine whether a natural person is identifiable&#x201D; (<xref ref-type="bibr" rid="B1">1</xref>). Securing infrastructure in depth using best practices from information technology, defensive software engineering, and data by secure computing and encryption can make malicious attacks impractical with current technologies [security by design and by default; (<xref ref-type="bibr" rid="B106">106</xref>, <xref ref-type="bibr" rid="B107">107</xref>)]. In addition, when FL involves models other than deep neural networks, if the contributions of individual parties are well balanced across the consortium and include a sufficiently large number of individuals, the information exchanged may very well be the same summary information routinely published as supplementary material to academic journal publications (<xref ref-type="bibr" rid="B108">108</xref>). A recent systematic literature review of privacy attacks in FL has also highlighted that many of them are only feasible under unrealistic assumptions (<xref ref-type="bibr" rid="B8">8</xref>). Therefore, reducing the amount of information shared during FL and using secure computing must be considered to provide increased protection against data leaks and misuse. Advertising such measures as a key feature of the FL consortium will make partners and patients more comfortable with contributing to federated studies [see, for instance, (<xref ref-type="bibr" rid="B103">103</xref>)]. Lieftink et al. (<xref ref-type="bibr" rid="B104">104</xref>), which investigated how FL aligns with GDPR in public health, also acknowledges that FL mitigates many privacy risks by enforcing purpose limitation, data use and information exchange minimisation, integrity and confidentiality (at a cost, as discussed in <xref ref-type="sec" rid="s2d">Section 2.4</xref>).</p>
<p>Furthermore, consortium parties must agree on how to assign intellectual property (IP) rights. Bioinformatics research often has practical applications in industry, which may involve patenting the results and apportioning any financial gains arising from their use. Parties in the consortium jointly control it and should share any gains from it (<xref ref-type="bibr" rid="B109">109</xref>). FL consortia are no different in this respect. From a technical standpoint, watermarking techniques for tracking data provenance and plagiarism have been adapted to FL (<xref ref-type="bibr" rid="B110">110</xref>) to identify data and model theft.</p>
<p>Additionally, the agreement establishing the FL consortium must outline its relationships with third parties and their corresponding legal obligations. Third parties that have access to the infrastructure may be required to sign a data processing agreement to guarantee the safety and privacy of data. In many countries in Europe, as well as in the US, patients have the right to withdraw their consent to use their data at any time. This, in turn, may require implementing procedures to remove individual data points from future federated analyses.</p>
<p>We summarised these considerations in <xref ref-type="table" rid="T1">Table&#x00A0;1</xref>, along with the key differences from the alternatives we discussed in <xref ref-type="sec" rid="s2">Section 2</xref>. FL provides increased protection against data and model leaks, which should reduce the perceived risk for parties and patients in contributing to the consortium. However, out of an abundance of caution, establishing a consortium-wide data-sharing agreement may help allocate and reduce party responsibilities in the event of a privacy breach. The use of FL has a limited impact on other legal aspects of collaborative analysis, such as IP handling and requirements for third parties, because it is a technical solution that does not change the fundamental legal rights and responsibilities of the parties involved in the consortium. <xref ref-type="table" rid="T3">Table&#x00A0;3</xref> summarises the key legal and procedural steps required to implement federated learning in biomedical research, as detailed above.</p>
<table-wrap id="T3" position="float"><label>Table&#x00A0;3</label>
<caption><p>Overview of legal, procedural, and technical actions in federated learning, with relevance to governance, data, and software.</p></caption>
<table>
<thead>
<tr>
<th valign="top" align="left">Action</th>
<th valign="top" align="center">Documentation</th>
<th valign="top" align="center">Data controllers responsabilities</th>
<th valign="top" align="center">Data processors responsibilities</th>
<th valign="top" align="center">Notes</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Ethical approval</td>
<td valign="top" align="left">Study protocol (including data sharing information).</td>
<td valign="top" align="left">Obtain approval from local ethics committees.</td>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="left">Making the use of secure computing transparent (thus limiting the ways data can be processed) should support ethics committees&#x2019; trust in the approach.</td>
</tr>
<tr>
<td valign="top" align="left">Consortium setup</td>
<td valign="top" align="left">Cooperation/data protection/processing/sharing agreements</td>
<td valign="top" align="left">Joint controllers, responsible for the purposes and means of processing and for data security and purpose adherence.</td>
<td valign="top" align="left">Contractual responsibilities stemming from controllers&#x2019; data security and purpose adherence responsibilities.</td>
<td valign="top" align="left">Although parties cannot access each other&#x2019;s data, agreements often permit the sharing of private information to address potential leakages from shared model parameters.</td>
</tr>
<tr>
<td valign="top" align="left">Data protection officer (DPO) advice</td>
<td valign="top" align="left">GDPR-compliant documentation, Data Protection Impact Assessment (DPIA), software documentation.</td>
<td valign="top" align="left">Appoint DPO if needed under GDPR (Article 35) and obtain advice.</td>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="left">Consortium agreements should specify how DPO responsibilities are allocated; a single DPO may be designated at the consortium level or appointed from a subset of partners.</td>
</tr>
<tr>
<td valign="top" align="left">Clinical data collection (retrospective or prospective)</td>
<td valign="top" align="left">Informed consent forms, data collection protocols.</td>
<td valign="top" align="left">Collect consent from all patients. Guarantee the right of withdrawal.</td>
<td valign="top" align="left">&#x2013;</td>
<td valign="top" align="left">Data should generally be considered pseudo-anonymised. Explaining secure computing methods to patients should foster trust and informed participation.</td>
</tr>
<tr>
<td valign="top" align="left">Code deployment</td>
<td valign="top" align="left">Software license, deployment agreements.</td>
<td valign="top" align="left">Grant local software deployment compliant with deployment agreements.</td>
<td valign="top" align="left">Guarantee the software and platform&#x2019;s security and usage comply with the purposes and licences.</td>
<td valign="top" align="left">The consortium should agree on where deployment happens (e.g., trusted execution environment - TEE), what is deployed and how deployments are authorised.</td>
</tr>
<tr>
<td valign="top" align="left">Intellectual property (IP)</td>
<td valign="top" align="left">IP ownership agreements, licensing terms, publication policies.</td>
<td valign="top" align="left">If the trained model is protected by IP rights, its ownership and usage are governed by the terms of the contract.</td>
<td valign="top" align="left">Do not automatically participate in IP generated from the trained model.</td>
<td valign="top" align="left">In FL, the trained global model is typically viewed as a joint IP artefact. There is ongoing work to establish IP allocation models, licensing templates, and tailored governance mechanisms.</td>
</tr>
<tr>
<td valign="top" align="left">Model governance</td>
<td valign="top" align="left">Model versioning logs, audit trails, validation reports, access control policies.</td>
<td valign="top" align="left">Guarantee model trustworthiness</td>
<td valign="top" align="left">Facilitate model governance and auditability</td>
<td valign="top" align="left">While stringent requirements are requested only in case of model deployment, analytical or research-only contexts still require principled governance to ensure reproducibility, accountability, and ethical compliance.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>We now proceed to discuss how FL facilitates compliance with the key requirements of GDPR (<xref ref-type="bibr" rid="B1">1</xref>) through its architecture. Data providers, which have a complete control over and a more intimate knowledge of the data they collected as well as a direct connection to data subjects, act in a &#x201C;data controller&#x201D; role (Articles 4 and 24), taking &#x201C;appropriate technical and organisational measures&#x201D; (Article 25) to ensure privacy and security, thus minimising the risk of data breaches. Therefore, they can directly scrutinise their use, notify data subjects about it to request consent (Article 9); allow them to withdraw their data (Article 7); ensure lawful, fair and transparent processing (Articles 12&#x2013;15); and directly assess risks to data subjects and minimise them through appropriate legal agreements. Consortium parties, which include both data controllers (as clients) and data processors (as servers, compute facilities, as defined in Article 4), are also required to use the techniques described in <xref ref-type="sec" rid="s2e">Section 2.5</xref> to ensure data security and privacy beyond what is provided by base FL (privacy by design, Articles 24, 25 and 32). For the same reasons, FL facilitates compliance with the EU AI Act (<xref ref-type="bibr" rid="B2">2</xref>). Some of its requirements strengthen those in the GDPR, such as data minimisation, localisation, transparency, auditability, security, and data quality. Additionally, the EU AI Act requires efforts to mitigate bias, ensure the robustness of models, implement human oversight, and assess high-risk systems. Data controllers are in the best position to ensure these requirements are met. Collectively, they can provide more representative samples that are less prone to bias and fairness issues. Finally, the presence of multiple data controllers in the consortium also implies that these requirements are verified by several independent parties.</p>
<p>In contrast, the US AI Act is more flexible in its requirements, which are left to sector-specific agencies to define and enforce. It focuses more on party self-regulation and harm remediation rather than universal legal mandates and prevention. As a result, cross-border EU-US consortia should rely on the EU-US Data Protection Framework (<xref ref-type="bibr" rid="B111">111</xref>) or put in additional safeguards as required by the GDPR (Article 46). Even so, FL&#x2019;s privacy stance naturally fits well with the practical implementation of the US AI Act.</p>
</sec>
<sec id="s6"><label>6</label><title>Challenges and future directions</title>
<p>Federated learning (FL) has evolved rapidly over its relatively short lifetime, becoming a widely adopted methodology across diverse domains. In a recent article (<xref ref-type="bibr" rid="B112">112</xref>), which includes several authors of the seminal FL paper (<xref ref-type="bibr" rid="B6">6</xref>), the progress of the field is reviewed, and key challenges for its future development are outlined. The authors propose a refined definition of FL centred on privacy principles and analyse how core concepts such as data minimisation, anonymisation, transparency and control, verifiability, and auditability have evolved and are expected to play a major role in the future. They identify three primary challenges for the field: scaling FL to support large and multimodal models, overcoming operational difficulties arising from device heterogeneity and synchronisation constraints (particularly relevant in cross-device FL), and addressing the current lack of verifiability in deployed systems. As a potential means to address this latter aspect, the authors highlight trusted execution environments (TEEs) (<xref ref-type="bibr" rid="B113">113</xref>) as a promising technology. A TEE is a secure area within a processor that executes code and processes data in isolation from other software, protecting it from tampering or unauthorised access even if the main operating system is compromised.</p>
<p>Complementing these insights, other surveys examine additional aspects of the anticipated future developments in federated learning (FL) research. Wen et al. (<xref ref-type="bibr" rid="B114">114</xref>) call for more efficient encryption schemes and greater overall efficiency in FL, including strategies to reduce communication costs between clients and servers. They also emphasise the importance of novel aggregation strategies that can better handle client heterogeneity. In the context of multimodal FL, aggregation must often reconcile contributions when clients supply only partially overlapping modalities, which represents an additional complexity beyond standard heterogeneity. Yurdem et al. (<xref ref-type="bibr" rid="B115">115</xref>) highlight the emerging paradigm of FL as a Service, in which federated learning training is conducted through ready-to-use platforms such as FeatureCloud (<xref ref-type="bibr" rid="B86">86</xref>) and sfkit (<xref ref-type="bibr" rid="B19">19</xref>), discussed in <xref ref-type="sec" rid="s3f">Section 3.6</xref>. This approach allows institutions to participate in collaborative model development with minimal software and deployment effort, thereby simplifying implementation and facilitating cross-organisational collaboration. Looking ahead, the emergence of federated foundation models is expected to define the next phase of research in this field. Their development will require progress across several key dimensions, including improving efficiency through advanced aggregation methods and optimised computational and communication frameworks; strengthening trustworthiness by increasing robustness to attacks; and enhancing incentive mechanisms that reward clients according to the quality of the models provided. Collectively, these advances are expected to be essential for making large-scale federated models practical and scalable while maintaining manageable communication costs (<xref ref-type="bibr" rid="B116">116</xref>).</p>
<p>The prospects of federated learning in bioinformatics depend on how the legal and technical landscape will develop. Further legislation will progressively regulate the use of machine learning and AI models, defining and restricting how data can be shared and used. As its effects percolate through protocol and product development, many aspects of federated learning will likely take a more definite shape.</p>
<p>Firstly, the security and privacy risks are likely to become more clearly defined. Jurisprudence will naturally shift from general guiding principles, such as the EU AI Act, to practical compliance rule sets as products based on federated learning enter the market. How to assess sensitive aspects of data (re)use will also likely be standardised (<xref ref-type="bibr" rid="B117">117</xref>), using the vast collection of available data and model cards as a starting point (<xref ref-type="bibr" rid="B118">118</xref>, <xref ref-type="bibr" rid="B119">119</xref>). What threat models are relevant, what security measures are appropriate at the infrastructure level, and what attacks are feasible will then become clear, possibly confirming the irrelevance of many that have been speculated in the literature (<xref ref-type="bibr" rid="B43">43</xref>). The evolution of encryption and differential privacy techniques may also allow different types of data to be treated as anonymised, depending on their nature and the theoretical guarantees of those techniques. Some data (say, single-cell transcriptomics) are intrinsically more difficult to tie to a specific individual than others (say, whole genome sequences), and different privacy-enhancing techniques are more effective than others at mitigating various types of risk.</p>
<p>Secondly, the evolution of data and models will require periodic reevaluation of the trade-offs discussed in this paper. The ever-increasing volumes of data used to train federated models will eventually force a cost-benefit analysis for resource-intensive techniques like HE and MPC; lighter approaches may be the only feasible choice at scale, provided regulations permit their use. Modelling approaches will undergo a similar selection process, as they will be required to evolve to handle new biological and clinical data types in larger quantities and across multiple modalities. In this respect, we foresee that federated learning in bioinformatics may diverge from the mainstream, which has largely standardised on deep learning models (<xref ref-type="bibr" rid="B15">15</xref>, <xref ref-type="bibr" rid="B16">16</xref>). Historically, bioinformatics has produced distinct model classes for different types of data. Federating them, optimising them, and assessing their privacy risks will require significant research and engineering efforts before they are suitable for practical applications.</p>
</sec>
<sec id="s7" sec-type="conclusions"><label>7</label><title>Conclusions</title>
<p>Independent research efforts in several bioinformatics domains have shown federated learning to be an effective tool to improve clinical discovery while minimising data sharing (<xref ref-type="bibr" rid="B10">10</xref>, <xref ref-type="bibr" rid="B12">12</xref>, <xref ref-type="bibr" rid="B13">13</xref>, among others). FL enables access to larger and more diverse data pools, resulting in faster and more robust exploration and interpretation of results. At the same time, it provides enhanced data privacy and can seamlessly incorporate advanced, encrypted and secure computation techniques. Despite the increased computational requirements and reduced ability to explore and troubleshoot issues with the data (<xref ref-type="bibr" rid="B104">104</xref>), the benefits of FL may outweigh these additional costs.</p>
<p>Therefore, federated learning can potentially mitigate the risks associated with national regulations if implemented in a manner that is secure by design and by default. Its use may also make patients and institutions more confident in participating in clinical studies by reducing privacy and data misuse risks. However, the reliable use of federated learning and its effective translation into clinical practice require a concerted effort by machine learning, clinical, and information technology specialists. All their skills are necessary to accurately evaluate the associated risks and expand its practical applications in bioinformatics beyond the early-stage applications reviewed in this paper.</p>
</sec>
</body>
<back>
<sec id="s8" sec-type="author-contributions"><title>Author contributions</title>
<p>DM: Investigation, Writing &#x2013; review &#x0026; editing, Conceptualization, Methodology, Writing &#x2013; original draft. MS: Conceptualization, Investigation, Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Methodology. FG: Methodology, Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft. JS: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft. SL: Funding acquisition, Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing, Project administration. SH: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft. AL: Writing &#x2013; original draft, Funding acquisition, Writing &#x2013; review &#x0026; editing, Project administration. IH: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing. FM: Conceptualization, Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Funding acquisition, Project administration.</p>
</sec>
<sec id="s10" sec-type="COI-statement"><title>Conflict of interest</title>
<p>Author IH was employed by company DPO Associates SARL.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s11" sec-type="ai-statement"><title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec id="s12" sec-type="disclaimer"><title>Publisher&#x0027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list><title>References</title>
<ref id="B1"><label>1.</label><mixed-citation publication-type="journal"><collab>European Union</collab>. <article-title>General data protection regulation (GDPR)</article-title>. <source>Off J Eur Union</source>. (<year>2016</year>) <volume>679</volume>:<fpage>1</fpage>&#x2013;<lpage>88</lpage>.</mixed-citation></ref>
<ref id="B2"><label>2.</label><mixed-citation publication-type="journal"><collab>European Union</collab>. <article-title>AI act</article-title>. <source>Off J Eur Union</source>. (<year>2024</year>) <volume>1689</volume>:<fpage>1</fpage>&#x2013;<lpage>144</lpage>.</mixed-citation></ref>
<ref id="B3"><label>3.</label><mixed-citation publication-type="other"><collab>US Congress</collab>. <article-title>Health Insurance Portability and Accountability Act of 1996 (1996). Pub. L. No. 104-191, 110 Stat. 1936</article-title>.</mixed-citation></ref>
<ref id="B4"><label>4.</label><mixed-citation publication-type="other"><collab>US Congress</collab>. <article-title>National Artificial Intelligence Initiative Act of 2020 (2020). Public Law No: 116-283, Division E</article-title></mixed-citation></ref>
<ref id="B5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cath</surname> <given-names>C</given-names></name> <name><surname>Wachter</surname> <given-names>S</given-names></name> <name><surname>Mittelstadt</surname> <given-names>B</given-names></name> <name><surname>Taddeo</surname> <given-names>M</given-names></name> <name><surname>Floridi</surname> <given-names>L</given-names></name></person-group>. <article-title>Artificial intelligence and the &#x2018;good society&#x2019;: the US, EU, and UK approach</article-title>. <source>Sci Eng Ethics</source>. (<year>2018</year>) <volume>24</volume>:<fpage>505</fpage>&#x2013;<lpage>28</lpage>. <pub-id pub-id-type="doi">10.1007/s11948-017-9901-7</pub-id><pub-id pub-id-type="pmid">28353045</pub-id></mixed-citation></ref>
<ref id="B6"><label>6.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>McMahan</surname> <given-names>B</given-names></name> <name><surname>Moore</surname> <given-names>E</given-names></name> <name><surname>Ramage</surname> <given-names>D</given-names></name> <name><surname>Hampson</surname> <given-names>S</given-names></name></person-group>. <article-title>Communication-efficient learning of deep networks from decentralized data</article-title>. <comment>In: <italic>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics</italic> (2017). p. 1273&#x2013;82</comment>.</mixed-citation></ref>
<ref id="B7"><label>7.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Ludwig</surname> <given-names>H</given-names></name> <name><surname>Baracaldo</surname> <given-names>N</given-names></name></person-group>, <source>Federated Learning: A Comprehensive Overview of Methods and Applications</source>. <publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2022</year>).</mixed-citation></ref>
<ref id="B8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wainakh</surname> <given-names>A</given-names></name> <name><surname>Zimmer</surname> <given-names>E</given-names></name> <name><surname>Subedi</surname> <given-names>S</given-names></name> <name><surname>Keim</surname> <given-names>J</given-names></name> <name><surname>Grube</surname> <given-names>T</given-names></name> <name><surname>Karuppayah</surname> <given-names>S</given-names></name><etal/></person-group><article-title>Federated learning attacks revisited: a critical discussion of gaps, assumptions, and evaluation setups</article-title>. <source>Sensors</source>. (<year>2022</year>) <volume>23</volume>:<fpage>31</fpage>. <pub-id pub-id-type="doi">10.3390/s23010031</pub-id><pub-id pub-id-type="pmid">36616629</pub-id></mixed-citation></ref>
<ref id="B9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Truong</surname> <given-names>N</given-names></name> <name><surname>Sun</surname> <given-names>K</given-names></name> <name><surname>Wang</surname> <given-names>S</given-names></name> <name><surname>Guitton</surname> <given-names>F</given-names></name> <name><surname>Guo</surname> <given-names>Y</given-names></name></person-group>. <article-title>Privacy preservation in federated learning: an insightful survey from the GDPR perspective</article-title>. <source>Comput Secur</source>. (<year>2021</year>) <volume>110</volume>:<fpage>102402</fpage>. <pub-id pub-id-type="doi">10.1016/j.cose.2021.102402</pub-id></mixed-citation></ref>
<ref id="B10"><label>10.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Roth</surname> <given-names>HR</given-names></name> <name><surname>Chang</surname> <given-names>K</given-names></name> <name><surname>Singh</surname> <given-names>P</given-names></name> <name><surname>Neumark</surname> <given-names>N</given-names></name> <name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Gupta</surname> <given-names>V</given-names></name><etal/></person-group>. <article-title>Federated learning for breast density classification: a real-world implementation</article-title>. <comment>In: <italic>Domain Adaptation and Representation Transfer, and Distributed and Collaborative Learning: 2nd MICCAI Workshop, DART 2020, and 1st MICCAI Workshop, DCL 2020</italic>. Springer (2020). p. 181&#x2013;91</comment>.</mixed-citation></ref>
<ref id="B11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Dayan</surname> <given-names>I</given-names></name> <name><surname>Roth</surname> <given-names>HR</given-names></name> <name><surname>Zhong</surname> <given-names>A</given-names></name> <name><surname>Harouni</surname> <given-names>A</given-names></name> <name><surname>Gentili</surname> <given-names>A</given-names></name> <name><surname>Abidin</surname> <given-names>AZ</given-names></name><etal/></person-group><article-title>Federated learning for predicting clinical outcomes in patients with COVID-19</article-title>. <source>Nat Med</source>. (<year>2021</year>) <volume>27</volume>:<fpage>1735</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1038/s41591-021-01506-3</pub-id><pub-id pub-id-type="pmid">34526699</pub-id></mixed-citation></ref>
<ref id="B12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Pati</surname> <given-names>S</given-names></name> <name><surname>Baid</surname> <given-names>U</given-names></name> <name><surname>Edwards</surname> <given-names>B</given-names></name> <name><surname>Sheller</surname> <given-names>M</given-names></name> <name><surname>Wang</surname> <given-names>S</given-names></name> <name><surname>Reina</surname> <given-names>GA</given-names></name><etal/></person-group><article-title>Federated learning enables big data for rare cancer boundary detection</article-title>. <source>Nat Commun</source>. (<year>2022</year>) <volume>13</volume>:<fpage>7346</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-022-33407-5</pub-id><pub-id pub-id-type="pmid">36470898</pub-id></mixed-citation></ref>
<ref id="B13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Heyndrickx</surname> <given-names>W</given-names></name> <name><surname>Mervin</surname> <given-names>L</given-names></name> <name><surname>Morawietz</surname> <given-names>T</given-names></name> <name><surname>Sturm</surname> <given-names>N</given-names></name> <name><surname>Friedrich</surname> <given-names>L</given-names></name> <name><surname>Zalewski</surname> <given-names>A</given-names></name><etal/></person-group><article-title>MELLODDY: cross-pharma federated learning at unprecedented scale unlocks benefits in QSAR without compromising proprietary information</article-title>. <source>J Chem Inf Model</source>. (<year>2023</year>) <volume>64</volume>:<fpage>2331</fpage>&#x2013;<lpage>44</lpage>. <pub-id pub-id-type="doi">10.1021/acs.jcim.3c00799</pub-id><pub-id pub-id-type="pmid">37642660</pub-id></mixed-citation></ref>
<ref id="B14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Brisimi</surname> <given-names>TS</given-names></name> <name><surname>Chen</surname> <given-names>R</given-names></name> <name><surname>Mela</surname> <given-names>T</given-names></name> <name><surname>Olshevsky</surname> <given-names>A</given-names></name> <name><surname>Paschalidis</surname> <given-names>IC</given-names></name> <name><surname>Shi</surname> <given-names>W</given-names></name></person-group>. <article-title>Federated learning of predictive models from federated electronic health records</article-title>. <source>Int J Med Inform</source>. (<year>2018</year>) <volume>112</volume>:<fpage>59</fpage>&#x2013;<lpage>67</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijmedinf.2018.01.007</pub-id><pub-id pub-id-type="pmid">29500022</pub-id></mixed-citation></ref>
<ref id="B15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Xu</surname> <given-names>J</given-names></name> <name><surname>Glicksberg</surname> <given-names>BS</given-names></name> <name><surname>Su</surname> <given-names>C</given-names></name> <name><surname>Walker</surname> <given-names>P</given-names></name> <name><surname>Bian</surname> <given-names>J</given-names></name> <name><surname>Wang</surname> <given-names>F</given-names></name></person-group>. <article-title>Federated learning for healthcare informatics</article-title>. <source>J Healthc Inform Res</source>. (<year>2020</year>) <volume>5</volume>:<fpage>1</fpage>&#x2013;<lpage>19</lpage>. <pub-id pub-id-type="doi">10.1007/s41666-020-00082-4</pub-id><pub-id pub-id-type="pmid">33204939</pub-id></mixed-citation></ref>
<ref id="B16"><label>16.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Chowdhury</surname> <given-names>A</given-names></name> <name><surname>Kassem</surname> <given-names>H</given-names></name> <name><surname>Padoy</surname> <given-names>N</given-names></name> <name><surname>Umeton</surname> <given-names>R</given-names></name> <name><surname>Karargyris</surname> <given-names>A</given-names></name></person-group>. <article-title>A review of medical federated learning: applications in oncology and cancer research</article-title>. <comment>In: <italic>Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries: 7th International Workshop, BrainLes 2021, 24th MICCAI Conference</italic> (2022). p. 3&#x2013;24</comment>.</mixed-citation></ref>
<ref id="B17"><label>17.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Zomaya</surname> <given-names>AY</given-names></name></person-group>, <source>Parallel Computing for Bioinformatics and Computational Biology: Models, Enabling Technologies, and Case Studies</source>. <publisher-loc>Hoboken</publisher-loc>: <publisher-name>John Wiley &#x0026; Sons</publisher-name> (<year>2006</year>).</mixed-citation></ref>
<ref id="B18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Toro-Dom&#x00ED;nguez</surname> <given-names>D</given-names></name> <name><surname>Villatoro-Garci&#x00E1;</surname> <given-names>JA</given-names></name> <name><surname>Martorell-Marug&#x00E1;n</surname> <given-names>J</given-names></name> <name><surname>Rom&#x00E1;n-Montoya</surname> <given-names>Y</given-names></name> <name><surname>Alarc&#x00F3;n-Riquelme</surname> <given-names>ME</given-names></name> <name><surname>Carmona-Sa&#x00E9;z</surname> <given-names>P</given-names></name></person-group>. <article-title>A survey of gene expression meta-analysis: methods and applications</article-title>. <source>Brief Bioinformatics</source>. (<year>2021</year>) <volume>22</volume>:<fpage>1694</fpage>&#x2013;<lpage>705</lpage>. <pub-id pub-id-type="doi">10.1093/bib/bbaa019</pub-id></mixed-citation></ref>
<ref id="B19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Mendelsohn</surname> <given-names>S</given-names></name> <name><surname>Froelicher</surname> <given-names>D</given-names></name> <name><surname>Loginov</surname> <given-names>D</given-names></name> <name><surname>Bernick</surname> <given-names>D</given-names></name> <name><surname>Berger</surname> <given-names>B</given-names></name> <name><surname>Cho</surname> <given-names>H</given-names></name></person-group>. <article-title>Sfkit: a web-based toolkit for secure and federated genomic analysis</article-title>. <source>Nucleic Acids Res</source>. (<year>2023</year>) <volume>51</volume>:<fpage>W535</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1093/nar/gkad464</pub-id><pub-id pub-id-type="pmid">37246709</pub-id></mixed-citation></ref>
<ref id="B20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zolotareva</surname> <given-names>O</given-names></name> <name><surname>Nasirigerdeh</surname> <given-names>R</given-names></name> <name><surname>Matschinske</surname> <given-names>J</given-names></name> <name><surname>Torkzadehmahani</surname> <given-names>R</given-names></name> <name><surname>Bakhtiari</surname> <given-names>M</given-names></name> <name><surname>Frisch</surname> <given-names>T</given-names></name><etal/></person-group><article-title>Flimma: a federated and privacy-aware tool for differential gene expression analysis</article-title>. <source>Genome Biol</source>. (<year>2021</year>) <volume>22</volume>:<fpage>1</fpage>&#x2013;<lpage>26</lpage>. <pub-id pub-id-type="doi">10.1186/s13059-021-02553-2</pub-id><pub-id pub-id-type="pmid">33397451</pub-id></mixed-citation></ref>
<ref id="B21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kavianpour</surname> <given-names>S</given-names></name> <name><surname>Sutherland</surname> <given-names>J</given-names></name> <name><surname>Mansouri-Benssassi</surname> <given-names>E</given-names></name> <name><surname>Coull</surname> <given-names>N</given-names></name> <name><surname>Jefferson</surname> <given-names>E</given-names></name></person-group>. <article-title>Next-generation capabilities in trusted research environments: interview study</article-title>. <source>J Med Internet Res</source>. (<year>2022</year>) <volume>24</volume>:<fpage>e33720</fpage>. <pub-id pub-id-type="doi">10.2196/33720</pub-id><pub-id pub-id-type="pmid">36125859</pub-id></mixed-citation></ref>
<ref id="B22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sudlow</surname> <given-names>C</given-names></name> <name><surname>Gallacher</surname> <given-names>J</given-names></name> <name><surname>Allen</surname> <given-names>N</given-names></name> <name><surname>Beral</surname> <given-names>V</given-names></name> <name><surname>Burton</surname> <given-names>P</given-names></name> <name><surname>Danesh</surname> <given-names>J</given-names></name><etal/></person-group><article-title>UK biobank: an open access resource for identifying the causes of a wide range of complex diseases of middle and old age</article-title>. <source>PLoS Med</source>. (<year>2015</year>) <volume>12</volume>:<fpage>e1001779</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pmed.1001779</pub-id><pub-id pub-id-type="pmid">25826379</pub-id></mixed-citation></ref>
<ref id="B23"><label>23.</label><mixed-citation publication-type="other"><collab>Federated European Genome-phenome Archive</collab>. <article-title>Federated European Genome-Phenome Archive (FEGA) (2024)</article-title> <comment>(accessed October 30, 2024)</comment>.</mixed-citation></ref>
<ref id="B24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Beltr&#x00E1;n</surname> <given-names>ETM</given-names></name> <name><surname>P&#x00E9;rez</surname> <given-names>MQ</given-names></name> <name><surname>S&#x00E1;nchez</surname> <given-names>PMS</given-names></name> <name><surname>Bernal</surname> <given-names>SL</given-names></name> <name><surname>Bovet</surname> <given-names>G</given-names></name> <name><surname>P&#x00E9;rez</surname> <given-names>MG</given-names></name><etal/></person-group><article-title>Decentralized federated learning: fundamentals, state of the art, frameworks, trends, and challenges</article-title>. <source>IEEE Commun Surv Tutor</source>. (<year>2023</year>) <volume>5</volume>:<fpage>2983</fpage>&#x2013;<lpage>3013</lpage>.</mixed-citation></ref>
<ref id="B25"><label>25.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Nasirigerdeh</surname> <given-names>R</given-names></name> <name><surname>Torkzadehmahani</surname> <given-names>R</given-names></name> <name><surname>Matschinske</surname> <given-names>J</given-names></name> <name><surname>Baumbach</surname> <given-names>J</given-names></name> <name><surname>Rueckert</surname> <given-names>D</given-names></name> <name><surname>Kaissis</surname> <given-names>G</given-names></name></person-group>. <article-title>Hyfed: a hybrid federated framework for privacy-preserving machine learning</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:2105.10545</italic> (2021)</comment>.</mixed-citation></ref>
<ref id="B26"><label>26.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Scutari</surname> <given-names>M</given-names></name> <name><surname>Malvestio</surname> <given-names>M</given-names></name></person-group>, <source>The Pragmatic Programmer for Machine Learning: Engineering Analytics and Data Science Solutions</source>. <publisher-loc>London</publisher-loc>: <publisher-name>Chapman &#x0026; Hall</publisher-name> (<year>2023</year>).</mixed-citation></ref>
<ref id="B27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Camajori Tedeschini</surname> <given-names>B</given-names></name> <name><surname>Savazzi</surname> <given-names>S</given-names></name> <name><surname>Stoklasa</surname> <given-names>R</given-names></name> <name><surname>Barbieri</surname> <given-names>L</given-names></name> <name><surname>Stathopoulos</surname> <given-names>I</given-names></name> <name><surname>Nicoli</surname> <given-names>M</given-names></name><etal/></person-group><article-title>Decentralized federated learning for healthcare networks: a case study on tumor segmentation</article-title>. <source>IEEE Access</source>. (<year>2022</year>) <volume>10</volume>:<fpage>8693</fpage>&#x2013;<lpage>708</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2022.3141913</pub-id></mixed-citation></ref>
<ref id="B28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Riedel</surname> <given-names>P</given-names></name> <name><surname>Schick</surname> <given-names>L</given-names></name> <name><surname>von Schwerin</surname> <given-names>R</given-names></name> <name><surname>Reichert</surname> <given-names>M</given-names></name> <name><surname>Schaudt</surname> <given-names>D</given-names></name> <name><surname>Hafner</surname> <given-names>A</given-names></name></person-group>. <article-title>Comparative analysis of open-source federated learning frameworks&#x2014;a literature-based survey and review</article-title>. <source>Int J Mach Learn Cybern</source>. (<year>2024</year>) <volume>15</volume>:<fpage>5257</fpage>&#x2013;<lpage>78</lpage>. <pub-id pub-id-type="doi">10.1007/s13042-024-02234-z</pub-id></mixed-citation></ref>
<ref id="B29"><label>29.</label><mixed-citation publication-type="other"><collab>Google</collab>. <article-title>TensorFlow federated: machine learning on decentralized data (2024)</article-title>. <comment>Available online at:</comment> <ext-link ext-link-type="uri" xlink:href="https://www.tensorflow.org/federated">https://www.tensorflow.org/federated</ext-link> <comment>(Accessed June 10, 2025)</comment>.</mixed-citation></ref>
<ref id="B30"><label>30.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Ziller</surname> <given-names>A</given-names></name> <name><surname>Trask</surname> <given-names>A</given-names></name> <name><surname>Lopardo</surname> <given-names>A</given-names></name> <name><surname>Szymkow</surname> <given-names>B</given-names></name> <name><surname>Wagner</surname> <given-names>B</given-names></name> <name><surname>Bluemke</surname> <given-names>E</given-names></name><etal/></person-group>. <article-title>Pysyft: a library for easy federated learning</article-title>. <comment>In: <italic>Federated Learning Systems: Towards Next-Generation AI</italic> (2021). p. 111&#x2013;39</comment>.</mixed-citation></ref>
<ref id="B31"><label>31.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Beutel</surname> <given-names>DJ</given-names></name> <name><surname>Topal</surname> <given-names>T</given-names></name> <name><surname>Mathur</surname> <given-names>A</given-names></name> <name><surname>Qiu</surname> <given-names>X</given-names></name> <name><surname>Fernandez-Marques</surname> <given-names>J</given-names></name> <name><surname>Gao</surname> <given-names>Y</given-names></name><etal/></person-group>. <article-title>Flower: a friendly federated learning research framework</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:2007.14390</italic> (2020)</comment>.</mixed-citation></ref>
<ref id="B32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Foley</surname> <given-names>P</given-names></name> <name><surname>Sheller</surname> <given-names>MJ</given-names></name> <name><surname>Edwards</surname> <given-names>B</given-names></name> <name><surname>Pati</surname> <given-names>S</given-names></name> <name><surname>Riviera</surname> <given-names>W</given-names></name> <name><surname>Sharma</surname> <given-names>M</given-names></name><etal/></person-group><article-title>OpenFL: the open federated learning library</article-title>. <source>Phys Med Biol</source>. (<year>2022</year>) <volume>67</volume>:<fpage>214001</fpage>. <pub-id pub-id-type="doi">10.1088/1361-6560/ac97d9</pub-id></mixed-citation></ref>
<ref id="B33"><label>33.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Huang</surname> <given-names>C</given-names></name> <name><surname>Huang</surname> <given-names>J</given-names></name> <name><surname>Liu</surname> <given-names>X</given-names></name></person-group>. <article-title>Cross-silo federated learning: challenges and opportunities</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:2206.12949</italic> (2022)</comment>.</mixed-citation></ref>
<ref id="B34"><label>34.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sheller</surname> <given-names>MJ</given-names></name> <name><surname>Edwards</surname> <given-names>B</given-names></name> <name><surname>Reina</surname> <given-names>GA</given-names></name> <name><surname>Martin</surname> <given-names>J</given-names></name> <name><surname>Pati</surname> <given-names>S</given-names></name> <name><surname>Kotrotsou</surname> <given-names>A</given-names></name><etal/></person-group><article-title>Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data</article-title>. <source>Sci Rep</source>. (<year>2020</year>) <volume>10</volume>:<fpage>12598</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-020-69250-1</pub-id><pub-id pub-id-type="pmid">32724046</pub-id></mixed-citation></ref>
<ref id="B35"><label>35.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>AZ</given-names></name> <name><surname>Yu</surname> <given-names>H</given-names></name> <name><surname>Cui</surname> <given-names>L</given-names></name> <name><surname>Yang</surname> <given-names>Q</given-names></name></person-group>. <article-title>Towards personalized federated learning</article-title>. <source>IEEE Trans Neural Netw Learn Syst</source>. (<year>2022</year>) <volume>34</volume>:<fpage>9587</fpage>&#x2013;<lpage>603</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2022.3160699</pub-id></mixed-citation></ref>
<ref id="B36"><label>36.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sattler</surname> <given-names>F</given-names></name> <name><surname>Muller</surname> <given-names>K</given-names></name> <name><surname>Samek</surname> <given-names>W</given-names></name></person-group>. <article-title>Clustered federated learning: model-agnostic distributed multitask optimization under privacy constraints</article-title>. <source>IEEE Trans Neural Netw Learn Syst</source>. (<year>2021</year>) <volume>32</volume>:<fpage>3710</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1109/TNNLS.2020.3015958</pub-id><pub-id pub-id-type="pmid">32833654</pub-id></mixed-citation></ref>
<ref id="B37"><label>37.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Geiping</surname> <given-names>J</given-names></name> <name><surname>Bauermeister</surname> <given-names>H</given-names></name> <name><surname>Dr&#x00F6;ge</surname> <given-names>H</given-names></name> <name><surname>Moeller</surname> <given-names>M</given-names></name></person-group>. <article-title>Inverting gradients-how easy is it to break privacy in federated learning?</article-title> <source>Adv Neural Inf Process Syst</source>. (<year>2020</year>) <volume>33</volume>:<fpage>16937</fpage>&#x2013;<lpage>47</lpage>.</mixed-citation></ref>
<ref id="B38"><label>38.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Haim</surname> <given-names>N</given-names></name> <name><surname>Vardi</surname> <given-names>G</given-names></name> <name><surname>Yehudai</surname> <given-names>G</given-names></name> <name><surname>Shamir</surname> <given-names>O</given-names></name> <name><surname>Irani</surname> <given-names>M</given-names></name></person-group>. <article-title>Reconstructing training data from trained neural networks</article-title>. <source>Adv Neural Inf Process Syst</source>. (<year>2022</year>) <volume>35</volume>:<fpage>22911</fpage>&#x2013;<lpage>24</lpage>.</mixed-citation></ref>
<ref id="B39"><label>39.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Shokri</surname> <given-names>R</given-names></name> <name><surname>Stronati</surname> <given-names>M</given-names></name> <name><surname>Song</surname> <given-names>C</given-names></name> <name><surname>Shmatikov</surname> <given-names>V</given-names></name></person-group>. <article-title>Membership inference attacks against machine learning models</article-title>. <comment>In: <italic>2017 IEEE Symposium on Security and Privacy</italic> (2017). p. 3&#x2013;18</comment>.</mixed-citation></ref>
<ref id="B40"><label>40.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname> <given-names>H</given-names></name> <name><surname>Salcic</surname> <given-names>Z</given-names></name> <name><surname>Sun</surname> <given-names>L</given-names></name> <name><surname>Dobbie</surname> <given-names>G</given-names></name> <name><surname>Yu</surname> <given-names>PS</given-names></name> <name><surname>Zhang</surname> <given-names>X</given-names></name></person-group>. <article-title>Membership inference attacks on machine learning: a survey</article-title>. <source>ACM Comput Surv</source>. (<year>2022</year>) <volume>54</volume>:<fpage>1</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.1145/3523273</pub-id></mixed-citation></ref>
<ref id="B41"><label>41.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Homer</surname> <given-names>N</given-names></name> <name><surname>Szelinger</surname> <given-names>S</given-names></name> <name><surname>Redman</surname> <given-names>M</given-names></name> <name><surname>Duggan</surname> <given-names>D</given-names></name> <name><surname>Tembe</surname> <given-names>W</given-names></name> <name><surname>Muehling</surname> <given-names>J</given-names></name><etal/></person-group><article-title>Resolving individuals contributing trace amounts of DNA to highly complex mixtures using high-density SNP genotyping microarrays</article-title>. <source>PLoS Genet</source>. (<year>2008</year>) <volume>4</volume>:<fpage>e1000167</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pgen.1000167</pub-id><pub-id pub-id-type="pmid">18769715</pub-id></mixed-citation></ref>
<ref id="B42"><label>42.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cai</surname> <given-names>R</given-names></name> <name><surname>Hao</surname> <given-names>Z</given-names></name> <name><surname>Winslett</surname> <given-names>M</given-names></name> <name><surname>Xiao</surname> <given-names>X</given-names></name> <name><surname>Yang</surname> <given-names>Y</given-names></name> <name><surname>Zhang</surname> <given-names>Z</given-names></name><etal/></person-group><article-title>Deterministic identification of specific individuals from GWAS results</article-title>. <source>Bioinformatics</source>. (<year>2015</year>) <volume>31</volume>:<fpage>1701</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btv018</pub-id><pub-id pub-id-type="pmid">25630377</pub-id></mixed-citation></ref>
<ref id="B43"><label>43.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Kolobkov</surname> <given-names>D</given-names></name> <name><surname>Mishra Sharma</surname> <given-names>S</given-names></name> <name><surname>Medvedev</surname> <given-names>A</given-names></name> <name><surname>Lebedev</surname> <given-names>M</given-names></name> <name><surname>Kosaretskiy</surname> <given-names>E</given-names></name> <name><surname>Vakhitov</surname> <given-names>R</given-names></name></person-group>. <article-title>Efficacy of federated learning on genomic data: a study on the UK biobank and the 1000 genomes project</article-title>. <source>Front Big Data</source>. (<year>2024</year>) <volume>7</volume>:<fpage>1266031</fpage>. <pub-id pub-id-type="doi">10.3389/fdata.2024.1266031</pub-id><pub-id pub-id-type="pmid">38487517</pub-id></mixed-citation></ref>
<ref id="B44"><label>44.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Fredrikson</surname> <given-names>M</given-names></name> <name><surname>Jha</surname> <given-names>S</given-names></name> <name><surname>Ristenpart</surname> <given-names>T</given-names></name></person-group>. <article-title>Model inversion attacks that exploit confidence information and basic countermeasures</article-title>. <comment>In: <italic>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security</italic> (2015). p. 1322&#x2013;33</comment>.</mixed-citation></ref>
<ref id="B45"><label>45.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>G</given-names></name> <name><surname>Cong</surname> <given-names>Y</given-names></name> <name><surname>Dong</surname> <given-names>J</given-names></name> <name><surname>Wang</surname> <given-names>Q</given-names></name> <name><surname>Lyu</surname> <given-names>L</given-names></name> <name><surname>Liu</surname> <given-names>J</given-names></name></person-group>. <article-title>Data poisoning attacks on federated machine learning</article-title>. <source>IEEE Internet Things J</source>. (<year>2022</year>) <volume>9</volume>:<fpage>11365</fpage>&#x2013;<lpage>75</lpage>. <pub-id pub-id-type="doi">10.1109/JIOT.2021.3128646</pub-id></mixed-citation></ref>
<ref id="B46"><label>46.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Jagielski</surname> <given-names>M</given-names></name> <name><surname>Oprea</surname> <given-names>A</given-names></name> <name><surname>Biggio</surname> <given-names>B</given-names></name> <name><surname>Liu</surname> <given-names>C</given-names></name> <name><surname>Nita-Rotaru</surname> <given-names>C</given-names></name> <name><surname>Li</surname> <given-names>B</given-names></name></person-group>. <article-title>Manipulating machine learning: poisoning attacks and countermeasures for regression learning</article-title>. <comment>In: <italic>2018 IEEE Symposium on Security and Privacy (Sp)</italic> (2018). p. 19&#x2013;35</comment>.</mixed-citation></ref>
<ref id="B47"><label>47.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>B</given-names></name> <name><surname>Wang</surname> <given-names>P</given-names></name> <name><surname>Shao</surname> <given-names>Z</given-names></name> <name><surname>Liu</surname> <given-names>A</given-names></name> <name><surname>Jiang</surname> <given-names>Y</given-names></name> <name><surname>Li</surname> <given-names>Y</given-names></name></person-group>. <article-title>Defending Byzantine attacks in ensemble federated learning: a reputation-based phishing approach</article-title>. <source>Future Gener Comput Syst</source>. (<year>2023</year>) <volume>147</volume>:<fpage>136</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1016/j.future.2023.05.002</pub-id></mixed-citation></ref>
<ref id="B48"><label>48.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yin</surname> <given-names>X</given-names></name> <name><surname>Zhu</surname> <given-names>Y</given-names></name> <name><surname>Hu</surname> <given-names>J</given-names></name></person-group>. <article-title>A comprehensive survey of privacy-preserving federated learning: a taxonomy, review, and future directions</article-title>. <source>ACM Comput Surv</source>. (<year>2021</year>) <volume>54</volume>:<fpage>1</fpage>&#x2013;<lpage>36</lpage>. <pub-id pub-id-type="doi">10.1145/3460427</pub-id></mixed-citation></ref>
<ref id="B49"><label>49.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Gentry</surname> <given-names>C</given-names></name></person-group>. <article-title>Fully homomorphic encryption using ideal lattices</article-title>. <comment>In: <italic>Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing</italic> (2009). p. 169&#x2013;78</comment>.</mixed-citation></ref>
<ref id="B50"><label>50.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Paillier</surname> <given-names>P</given-names></name></person-group>. <article-title>Public-key cryptosystems based on composite degree residuosity classes</article-title>. <comment>In: <italic>International Conference on the Theory and Applications of Cryptographic Techniques</italic> (1999). p. 223&#x2013;38</comment>.</mixed-citation></ref>
<ref id="B51"><label>51.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zhao</surname> <given-names>C</given-names></name> <name><surname>Zhao</surname> <given-names>S</given-names></name> <name><surname>Zhao</surname> <given-names>M</given-names></name> <name><surname>Chen</surname> <given-names>Z</given-names></name> <name><surname>Gao</surname> <given-names>C</given-names></name> <name><surname>Li</surname> <given-names>H</given-names></name><etal/></person-group><article-title>Secure multi-party computation: theory, practice and applications</article-title>. <source>Inf Sci (Ny)</source>. (<year>2019</year>) <volume>476</volume>:<fpage>357</fpage>&#x2013;<lpage>72</lpage>. <pub-id pub-id-type="doi">10.1016/j.ins.2018.10.024</pub-id></mixed-citation></ref>
<ref id="B52"><label>52.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ficek</surname> <given-names>J</given-names></name> <name><surname>Wang</surname> <given-names>W</given-names></name> <name><surname>Chen</surname> <given-names>H</given-names></name> <name><surname>Dagne</surname> <given-names>G</given-names></name> <name><surname>Daley</surname> <given-names>E</given-names></name></person-group>. <article-title>Differential privacy in health research: a scoping review</article-title>. <source>J Am Med Inform Assoc</source>. (<year>2021</year>) <volume>28</volume>:<fpage>2269</fpage>&#x2013;<lpage>76</lpage>. <pub-id pub-id-type="doi">10.1093/jamia/ocab135</pub-id><pub-id pub-id-type="pmid">34333623</pub-id></mixed-citation></ref>
<ref id="B53"><label>53.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Schein</surname> <given-names>A</given-names></name> <name><surname>Wu</surname> <given-names>ZS</given-names></name> <name><surname>Schofield</surname> <given-names>A</given-names></name> <name><surname>Zhou</surname> <given-names>M</given-names></name> <name><surname>Wallach</surname> <given-names>H</given-names></name></person-group>. <article-title>Locally private Bayesian inference for count models</article-title>. <comment>In: <italic>Proceedings of the 36th International Conference on Machine Learning</italic> (2019). p. 5638&#x2013;48</comment>.</mixed-citation></ref>
<ref id="B54"><label>54.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cai</surname> <given-names>K</given-names></name> <name><surname>Lei</surname> <given-names>X</given-names></name> <name><surname>Wei</surname> <given-names>J</given-names></name> <name><surname>Xiao</surname> <given-names>X</given-names></name></person-group>. <article-title>Data synthesis via differentially private Markov random fields</article-title>. <source>Proc VLDB Endow</source>. (<year>2021</year>) <volume>14</volume>:<fpage>2190</fpage>&#x2013;<lpage>202</lpage>. <pub-id pub-id-type="doi">10.14778/3476249.3476272</pub-id></mixed-citation></ref>
<ref id="B55"><label>55.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Abadi</surname> <given-names>M</given-names></name> <name><surname>Chu</surname> <given-names>A</given-names></name> <name><surname>Goodfellow</surname> <given-names>I</given-names></name> <name><surname>McMahan</surname> <given-names>HB</given-names></name> <name><surname>Mironov</surname> <given-names>I</given-names></name> <name><surname>Talwar</surname> <given-names>K</given-names></name><etal/></person-group>. <article-title>Deep learning with differential privacy</article-title>. <comment>In: <italic>Proceedings of the 2016 ACM Sigsac Conference on Computer and Communications Security</italic> (2016). p. 308&#x2013;18</comment>.</mixed-citation></ref>
<ref id="B56"><label>56.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Jayaraman</surname> <given-names>B</given-names></name> <name><surname>Evans</surname> <given-names>D</given-names></name></person-group>. <article-title>Evaluating differentially private machine learning in practice</article-title>. <comment>In: <italic>28th Usenix Security Symposium (Usenix Security 19)</italic> (2019). p. 1895&#x2013;912</comment>.</mixed-citation></ref>
<ref id="B57"><label>57.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Nissim</surname> <given-names>K</given-names></name> <name><surname>Raskhodnikova</surname> <given-names>S</given-names></name> <name><surname>Smith</surname> <given-names>A</given-names></name></person-group>. <article-title>Smooth sensitivity and sampling in private data analysis</article-title>. <comment>In: <italic>Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing</italic> (2007). p. 75&#x2013;84</comment>.</mixed-citation></ref>
<ref id="B58"><label>58.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Dwork</surname> <given-names>C</given-names></name> <name><surname>Feldman</surname> <given-names>V</given-names></name></person-group>. <article-title>Privacy-preserving prediction</article-title>. <comment>In: <italic>Proceedings of the 31st Conference on Learning Theory</italic> (2018). p. 1693&#x2013;702</comment>.</mixed-citation></ref>
<ref id="B59"><label>59.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bagdasaryan</surname> <given-names>E</given-names></name> <name><surname>Poursaeed</surname> <given-names>O</given-names></name> <name><surname>Shmatikov</surname> <given-names>V</given-names></name></person-group>. <article-title>Differential privacy has disparate impact on model accuracy</article-title>. <source>Adv Neural Inf Process Syst</source>. (<year>2019</year>) <volume>32</volume>:<fpage>15479</fpage>&#x2013;<lpage>88</lpage>.</mixed-citation></ref>
<ref id="B60"><label>60.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ramu</surname> <given-names>SP</given-names></name> <name><surname>Boopalan</surname> <given-names>P</given-names></name> <name><surname>Pham</surname> <given-names>Q</given-names></name> <name><surname>Maddikunta</surname> <given-names>PKR</given-names></name> <name><surname>Huynh-The</surname> <given-names>T</given-names></name> <name><surname>Alazab</surname> <given-names>M</given-names></name><etal/></person-group><article-title>Federated learning enabled digital twins for smart cities: concepts, recent advances, and future directions</article-title>. <source>Sustain Cities Soc</source>. (<year>2022</year>) <volume>79</volume>:<fpage>103663</fpage>. <pub-id pub-id-type="doi">10.1016/j.scs.2021.103663</pub-id></mixed-citation></ref>
<ref id="B61"><label>61.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>W</given-names></name> <name><surname>Yang</surname> <given-names>D</given-names></name> <name><surname>Wu</surname> <given-names>W</given-names></name> <name><surname>Peng</surname> <given-names>H</given-names></name> <name><surname>Zhang</surname> <given-names>N</given-names></name> <name><surname>Zhang</surname> <given-names>H</given-names></name><etal/></person-group><article-title>Optimizing federated learning in distributed industrial IoT: a multi-agent approach</article-title>. <source>IEEE J Sel Areas Commun</source>. (<year>2021</year>) <volume>39</volume>:<fpage>3688</fpage>&#x2013;<lpage>703</lpage>. <pub-id pub-id-type="doi">10.1109/JSAC.2021.3118352</pub-id></mixed-citation></ref>
<ref id="B62"><label>62.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Long</surname> <given-names>G</given-names></name> <name><surname>Tan</surname> <given-names>Y</given-names></name> <name><surname>Jiang</surname> <given-names>J</given-names></name> <name><surname>Zhang</surname> <given-names>C</given-names></name></person-group>, <source>Federated Learning for Open Banking</source>. <publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name> (<year>2020</year>). p. <fpage>240</fpage>&#x2013;<lpage>54</lpage>. <comment>Chap. 17</comment>.</mixed-citation></ref>
<ref id="B63"><label>63.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>van Rooden</surname> <given-names>SM</given-names></name> <name><surname>van der Werff</surname> <given-names>SD</given-names></name> <name><surname>van Mourik</surname> <given-names>MSM</given-names></name> <name><surname>Lomholt</surname> <given-names>F</given-names></name> <name><surname>M&#x00F8;ller</surname> <given-names>KL</given-names></name> <name><surname>Valk</surname> <given-names>S</given-names></name><etal/></person-group><article-title>Federated systems for automated infection surveillance: a perspective</article-title>. <source>Antimicrob Resist Infect Control</source>. (<year>2024</year>) <volume>13</volume>:<fpage>113</fpage>. <pub-id pub-id-type="doi">10.1186/s13756-024-01464-8</pub-id><pub-id pub-id-type="pmid">39334278</pub-id></mixed-citation></ref>
<ref id="B64"><label>64.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Maes</surname> <given-names>E</given-names></name> <name><surname>Mertens</surname> <given-names>I</given-names></name> <name><surname>Valkenborg</surname> <given-names>D</given-names></name> <name><surname>Pauwels</surname> <given-names>P</given-names></name> <name><surname>Rolfo</surname> <given-names>C</given-names></name> <name><surname>Baggerman</surname> <given-names>G</given-names></name></person-group>. <article-title>Proteomics in cancer research: are we ready for clinical practice?</article-title> <source>Crit Rev Oncol Hematol</source>. (<year>2015</year>) <volume>96</volume>:<fpage>437</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1016/j.critrevonc.2015.07.006</pub-id><pub-id pub-id-type="pmid">26277237</pub-id></mixed-citation></ref>
<ref id="B65"><label>65.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rodriguez-Esteban</surname> <given-names>R</given-names></name> <name><surname>Jiang</surname> <given-names>X</given-names></name></person-group>. <article-title>Differential gene expression in disease: a comparison between high-throughput studies and the literature</article-title>. <source>BMC Med Genom</source>. (<year>2017</year>) <volume>10</volume>:<fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1186/s12920-017-0293-y</pub-id></mixed-citation></ref>
<ref id="B66"><label>66.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rieke</surname> <given-names>N</given-names></name> <name><surname>Hancox</surname> <given-names>J</given-names></name> <name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Milletari</surname> <given-names>F</given-names></name> <name><surname>Roth</surname> <given-names>HR</given-names></name> <name><surname>Albarqouni</surname> <given-names>S</given-names></name><etal/></person-group><article-title>The future of digital health with federated learning</article-title>. <source>npj Digit Med</source>. (<year>2020</year>) <volume>3</volume>:<fpage>1</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1038/s41746-020-00323-1</pub-id><pub-id pub-id-type="pmid">31934645</pub-id></mixed-citation></ref>
<ref id="B67"><label>67.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cai</surname> <given-names>Z</given-names></name> <name><surname>Poulos</surname> <given-names>RC</given-names></name> <name><surname>Liu</surname> <given-names>J</given-names></name> <name><surname>Zhong</surname> <given-names>Q</given-names></name></person-group>. <article-title>Machine learning for multi-omics data integration in cancer</article-title>. <source>Iscience</source>. (<year>2022</year>) <volume>25</volume>:<fpage>103798</fpage>. <pub-id pub-id-type="doi">10.1016/j.isci.2022.103798</pub-id><pub-id pub-id-type="pmid">35169688</pub-id></mixed-citation></ref>
<ref id="B68"><label>68.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Zhu</surname> <given-names>Y</given-names></name> <name><surname>Orre</surname> <given-names>LM</given-names></name> <name><surname>Tran</surname> <given-names>YZ</given-names></name> <name><surname>Mermelekas</surname> <given-names>G</given-names></name> <name><surname>Johansson</surname> <given-names>HJ</given-names></name> <name><surname>Malyutina</surname> <given-names>A</given-names></name><etal/></person-group><article-title>DEqMS: a method for accurate variance estimation in differential protein expression analysis</article-title>. <source>Mol Cell Proteom</source>. (<year>2020</year>) <volume>19</volume>:<fpage>1047</fpage>&#x2013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.1074/mcp.TIR119.001646</pub-id></mixed-citation></ref>
<ref id="B69"><label>69.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Law</surname> <given-names>CW</given-names></name> <name><surname>Chen</surname> <given-names>Y</given-names></name> <name><surname>Shi</surname> <given-names>W</given-names></name> <name><surname>Smyth</surname> <given-names>GK</given-names></name></person-group>. <article-title>Voom: precision weights unlock linear model analysis tools for RNA-seq read counts</article-title>. <source>Genome Biol</source>. (<year>2014</year>) <volume>15</volume>:<fpage>1</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1186/gb-2014-15-2-r29</pub-id></mixed-citation></ref>
<ref id="B70"><label>70.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Hannemann</surname> <given-names>A</given-names></name> <name><surname>Ewald</surname> <given-names>J</given-names></name> <name><surname>Seeger</surname> <given-names>L</given-names></name> <name><surname>Buchmann</surname> <given-names>E</given-names></name></person-group>. <article-title>Federated learning on transcriptomic data: model quality and performance trade-offs</article-title>. <comment>In: <italic>International Conference on Computational Science</italic> (2024). p. 279&#x2013;93</comment>.</mixed-citation></ref>
<ref id="B71"><label>71.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Tong</surname> <given-names>J</given-names></name> <name><surname>Anjum</surname> <given-names>MM</given-names></name> <name><surname>Mohammed</surname> <given-names>N</given-names></name> <name><surname>Chen</surname> <given-names>Y</given-names></name> <name><surname>Jiang</surname> <given-names>X</given-names></name></person-group>. <article-title>Federated learning algorithms for generalized mixed-effects model (GLMM) on horizontally partitioned data from distributed sources</article-title>. <source>BMC Med Inform Decis Mak</source>. (<year>2022</year>) <volume>22</volume>:<fpage>269</fpage>. <pub-id pub-id-type="doi">10.1186/s12911-022-02014-1</pub-id><pub-id pub-id-type="pmid">36244993</pub-id></mixed-citation></ref>
<ref id="B72"><label>72.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>S</given-names></name> <name><surname>Kim</surname> <given-names>M</given-names></name> <name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Jiang</surname> <given-names>X</given-names></name> <name><surname>Chen</surname> <given-names>H</given-names></name> <name><surname>Harmanci</surname> <given-names>A</given-names></name></person-group>. <article-title>Privacy-aware estimation of relatedness in admixed populations</article-title>. <source>Brief Bioinform</source>. (<year>2022</year>) <volume>23</volume>:<fpage>bbac473</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbac473</pub-id><pub-id pub-id-type="pmid">36384083</pub-id></mixed-citation></ref>
<ref id="B73"><label>73.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Chen</surname> <given-names>H</given-names></name> <name><surname>Jiang</surname> <given-names>X</given-names></name> <name><surname>Harmanci</surname> <given-names>A</given-names></name></person-group>. <article-title>FedGMMAT: federated generalized linear mixed model association tests</article-title>. <source>PLoS Comput Biol</source>. (<year>2024</year>) <volume>20</volume>:<fpage>e1012142</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1012142</pub-id><pub-id pub-id-type="pmid">39047024</pub-id></mixed-citation></ref>
<ref id="B74"><label>74.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Cho</surname> <given-names>H</given-names></name> <name><surname>Froelicher</surname> <given-names>D</given-names></name> <name><surname>Chen</surname> <given-names>J</given-names></name> <name><surname>Edupalli</surname> <given-names>M</given-names></name> <name><surname>Pyrgelis</surname> <given-names>A</given-names></name> <name><surname>Troncoso-Pastoriza</surname> <given-names>JR</given-names></name><etal/></person-group><article-title>Secure and federated genome-wide association studies for biobank-scale datasets</article-title>. <source>Nat Genet</source>. (<year>2025</year>) <volume>57</volume>:<fpage>809</fpage>&#x2013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1038/s41588-025-02109-1</pub-id><pub-id pub-id-type="pmid">39994472</pub-id></mixed-citation></ref>
<ref id="B75"><label>75.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Mbatchou</surname> <given-names>J</given-names></name> <name><surname>Barnard</surname> <given-names>L</given-names></name> <name><surname>Backman</surname> <given-names>J</given-names></name> <name><surname>Marcketta</surname> <given-names>A</given-names></name> <name><surname>Kosmicki</surname> <given-names>JA</given-names></name> <name><surname>Ziyatdinov</surname> <given-names>A</given-names></name><etal/></person-group><article-title>Computationally efficient whole-genome regression for quantitative and binary traits</article-title>. <source>Nat Genet</source>. (<year>2021</year>) <volume>53</volume>:<fpage>1097</fpage>&#x2013;<lpage>103</lpage>. <pub-id pub-id-type="doi">10.1038/s41588-021-00870-7</pub-id><pub-id pub-id-type="pmid">34017140</pub-id></mixed-citation></ref>
<ref id="B76"><label>76.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>S</given-names></name> <name><surname>Shen</surname> <given-names>B</given-names></name> <name><surname>Guo</surname> <given-names>L</given-names></name> <name><surname>Shang</surname> <given-names>M</given-names></name> <name><surname>Liu</surname> <given-names>J</given-names></name> <name><surname>Sun</surname> <given-names>Q</given-names></name><etal/></person-group><article-title>Scfed: federated learning for cell type classification with scRNA-seq</article-title>. <source>Brief Bioinform</source>. (<year>2024</year>) <volume>25</volume>:<fpage>bbad507</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbad507</pub-id></mixed-citation></ref>
<ref id="B77"><label>77.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>Q</given-names></name> <name><surname>Wu</surname> <given-names>Z</given-names></name> <name><surname>Cai</surname> <given-names>Y</given-names></name> <name><surname>Han</surname> <given-names>Y</given-names></name> <name><surname>Yung</surname> <given-names>CM</given-names></name> <name><surname>Fu</surname> <given-names>T</given-names></name><etal/></person-group><article-title>FedTree: a federated learning system for trees</article-title>. <source>Proc Mach Learn Syst</source>. (<year>2023</year>) <volume>5</volume>:<fpage>89</fpage>&#x2013;<lpage>103</lpage>.</mixed-citation></ref>
<ref id="B78"><label>78.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname> <given-names>Q</given-names></name> <name><surname>He</surname> <given-names>M</given-names></name> <name><surname>Guo</surname> <given-names>L</given-names></name> <name><surname>Chai</surname> <given-names>H</given-names></name></person-group>. <article-title>AFEI: adaptive optimized vertical federated learning for heterogeneous multi-omics data integration</article-title>. <source>Brief Bioinform</source>. (<year>2023</year>) <volume>24</volume>:<fpage>bbad269</fpage>. <pub-id pub-id-type="doi">10.1093/bib/bbad269</pub-id><pub-id pub-id-type="pmid">37497720</pub-id></mixed-citation></ref>
<ref id="B79"><label>79.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Danek</surname> <given-names>BP</given-names></name> <name><surname>Makarious</surname> <given-names>MB</given-names></name> <name><surname>Dadu</surname> <given-names>A</given-names></name> <name><surname>Vitale</surname> <given-names>D</given-names></name> <name><surname>Lee</surname> <given-names>PS</given-names></name> <name><surname>Singleton</surname> <given-names>AB</given-names></name><etal/></person-group><article-title>Federated learning for multi-omics: a performance evaluation in Parkinson&#x2019;s disease</article-title>. <source>Patterns</source>. (<year>2024</year>) <volume>5</volume>:<fpage>100945</fpage>. <pub-id pub-id-type="doi">10.1016/j.patter.2024.100945</pub-id><pub-id pub-id-type="pmid">38487808</pub-id></mixed-citation></ref>
<ref id="B80"><label>80.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bdair</surname> <given-names>T</given-names></name> <name><surname>Navab</surname> <given-names>N</given-names></name> <name><surname>Albarqouni</surname> <given-names>S</given-names></name></person-group>. <article-title>Semi-supervised federated peer learning for skin lesion classification</article-title>. <source>Mach Learn Biomed Imaging</source>. (<year>2022</year>) <volume>1</volume>:<fpage>1</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.59275/j.melba.2022-8g82</pub-id></mixed-citation></ref>
<ref id="B81"><label>81.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yan</surname> <given-names>R</given-names></name> <name><surname>Qu</surname> <given-names>L</given-names></name> <name><surname>Wei</surname> <given-names>Q</given-names></name> <name><surname>Huang</surname> <given-names>S</given-names></name> <name><surname>Shen</surname> <given-names>L</given-names></name> <name><surname>Rubin</surname> <given-names>DL</given-names></name><etal/></person-group><article-title>Label-efficient self-supervised federated learning for tackling data heterogeneity in medical imaging</article-title>. <source>IEEE Trans Med Imaging</source>. (<year>2023</year>) <volume>42</volume>:<fpage>1932</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1109/TMI.2022.3233574</pub-id><pub-id pub-id-type="pmid">37018314</pub-id></mixed-citation></ref>
<ref id="B82"><label>82.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Jiang</surname> <given-names>M</given-names></name> <name><surname>Wang</surname> <given-names>Z</given-names></name> <name><surname>Dou</surname> <given-names>Q</given-names></name></person-group>. <article-title>Harmofl: harmonizing local and global drifts in federated learning on heterogeneous medical images</article-title>. <source>Proc AAAI Conf Artif Intell</source>. (<year>2022</year>) <volume>36</volume>:<fpage>1087</fpage>&#x2013;<lpage>95</lpage>. <pub-id pub-id-type="doi">10.1609/aaai.v36i1.19993</pub-id></mixed-citation></ref>
<ref id="B83"><label>83.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Haggenm&#x00FC;ller</surname> <given-names>S</given-names></name> <name><surname>Schmitt</surname> <given-names>M</given-names></name> <name><surname>Krieghoff-Henning</surname> <given-names>E</given-names></name> <name><surname>Hekler</surname> <given-names>A</given-names></name> <name><surname>Maron</surname> <given-names>RC</given-names></name> <name><surname>Wies</surname> <given-names>C</given-names></name><etal/></person-group><article-title>Federated learning for decentralized artificial intelligence in melanoma diagnostics</article-title>. <source>JAMA Dermatol</source>. (<year>2024</year>) <volume>160</volume>:<fpage>303</fpage>. <pub-id pub-id-type="doi">10.1001/jamadermatol.2023.5550</pub-id></mixed-citation></ref>
<ref id="B84"><label>84.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Linardos</surname> <given-names>A</given-names></name> <name><surname>Kushibar</surname> <given-names>K</given-names></name> <name><surname>Walsh</surname> <given-names>S</given-names></name> <name><surname>Gkontra</surname> <given-names>P</given-names></name> <name><surname>Lekadir</surname> <given-names>K</given-names></name></person-group>. <article-title>Federated learning for multi-center imaging diagnostics: a simulation study in cardiovascular disease</article-title>. <source>Sci Rep</source>. (<year>2022</year>) <volume>12</volume>:<fpage>3551</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-022-07186-4</pub-id><pub-id pub-id-type="pmid">35241683</pub-id></mixed-citation></ref>
<ref id="B85"><label>85.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yang</surname> <given-names>D</given-names></name> <name><surname>Xu</surname> <given-names>Z</given-names></name> <name><surname>Li</surname> <given-names>W</given-names></name> <name><surname>Myronenko</surname> <given-names>A</given-names></name> <name><surname>Roth</surname> <given-names>HR</given-names></name> <name><surname>Harmon</surname> <given-names>S</given-names></name><etal/></person-group><article-title>Federated semi-supervised learning for COVID region segmentation in chest CT using multi-national data from China, Italy, Japan</article-title>. <source>Med Image Anal</source>. (<year>2021</year>) <volume>70</volume>:<fpage>101992</fpage>. <pub-id pub-id-type="doi">10.1016/j.media.2021.101992</pub-id><pub-id pub-id-type="pmid">33601166</pub-id></mixed-citation></ref>
<ref id="B86"><label>86.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Matschinske</surname> <given-names>J</given-names></name> <name><surname>Sp&#x00E4;th</surname> <given-names>J</given-names></name> <name><surname>Bakhtiari</surname> <given-names>M</given-names></name> <name><surname>Probul</surname> <given-names>N</given-names></name> <name><surname>Majdabadi</surname> <given-names>MMK</given-names></name> <name><surname>Nasirigerdeh</surname> <given-names>R</given-names></name><etal/></person-group><article-title>The featurecloud platform for federated learning in biomedicine: unified approach</article-title>. <source>J Med Internet Res</source>. (<year>2023</year>) <volume>25</volume>:<fpage>e42621</fpage>. <pub-id pub-id-type="doi">10.2196/42621</pub-id><pub-id pub-id-type="pmid">37436815</pub-id></mixed-citation></ref>
<ref id="B87"><label>87.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Berger</surname> <given-names>B</given-names></name> <name><surname>Cho</surname> <given-names>H</given-names></name></person-group>. <article-title>Emerging technologies towards enhancing privacy in genomic data sharing</article-title>. <source>Genome Biol</source>. (<year>2019</year>) <volume>20</volume>:<fpage>128</fpage>. <pub-id pub-id-type="doi">10.1186/s13059-019-1741-0</pub-id><pub-id pub-id-type="pmid">31262363</pub-id></mixed-citation></ref>
<ref id="B88"><label>88.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Froelicher</surname> <given-names>D</given-names></name> <name><surname>Troncoso-Pastoriza</surname> <given-names>JR</given-names></name> <name><surname>Raisaro</surname> <given-names>JL</given-names></name> <name><surname>Cuendet</surname> <given-names>MA</given-names></name> <name><surname>Sousa</surname> <given-names>JS</given-names></name> <name><surname>Cho</surname> <given-names>H</given-names></name><etal/></person-group><article-title>Truly privacy-preserving federated analytics for precision medicine with multiparty homomorphic encryption</article-title>. <source>Nat Commun</source>. (<year>2021</year>) <volume>12</volume>:<fpage>5910</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-021-25972-y</pub-id><pub-id pub-id-type="pmid">34635645</pub-id></mixed-citation></ref>
<ref id="B89"><label>89.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Hwang</surname> <given-names>B</given-names></name> <name><surname>Lee</surname> <given-names>JH</given-names></name> <name><surname>Bang</surname> <given-names>D</given-names></name></person-group>. <article-title>Single-cell RNA sequencing technologies and bioinformatics pipelines</article-title>. <source>Exp Mol Med</source>. (<year>2018</year>) <volume>50</volume>:<fpage>1</fpage>&#x2013;<lpage>14</lpage>. <pub-id pub-id-type="doi">10.1038/s12276-018-0071-8</pub-id></mixed-citation></ref>
<ref id="B90"><label>90.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Papalexi</surname> <given-names>E</given-names></name> <name><surname>Satija</surname> <given-names>R</given-names></name></person-group>. <article-title>Single-cell RNA sequencing to explore immune cell heterogeneity</article-title>. <source>Nat Rev Immunol</source>. (<year>2018</year>) <volume>18</volume>:<fpage>35</fpage>&#x2013;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.1038/nri.2017.76</pub-id><pub-id pub-id-type="pmid">28787399</pub-id></mixed-citation></ref>
<ref id="B91"><label>91.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ma</surname> <given-names>F</given-names></name> <name><surname>Pellegrini</surname> <given-names>M</given-names></name></person-group>. <article-title>ACTINN: automated identification of cell types in single cell RNA sequencing</article-title>. <source>Bioinformatics</source>. (<year>2020</year>) <volume>36</volume>:<fpage>533</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1093/bioinformatics/btz592</pub-id><pub-id pub-id-type="pmid">31359028</pub-id></mixed-citation></ref>
<ref id="B92"><label>92.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Theodoris</surname> <given-names>CV</given-names></name> <name><surname>Xiao</surname> <given-names>L</given-names></name> <name><surname>Chopra</surname> <given-names>A</given-names></name> <name><surname>Chaffin</surname> <given-names>MD</given-names></name> <name><surname>Al Sayed</surname> <given-names>ZR</given-names></name> <name><surname>Hill</surname> <given-names>MC</given-names></name><etal/></person-group><article-title>Transfer learning enables predictions in network biology</article-title>. <source>Nature</source>. (<year>2023</year>) <volume>618</volume>:<fpage>616</fpage>&#x2013;<lpage>24</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-023-06139-9</pub-id><pub-id pub-id-type="pmid">37258680</pub-id></mixed-citation></ref>
<ref id="B93"><label>93.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Bakhtiari</surname> <given-names>M</given-names></name> <name><surname>Bonn</surname> <given-names>S</given-names></name> <name><surname>Theis</surname> <given-names>F</given-names></name> <name><surname>Zolotareva</surname> <given-names>O</given-names></name> <name><surname>Baumbach</surname> <given-names>J</given-names></name></person-group>. <article-title>FedscGEN: privacy-preserving federated batch effect correction of single-cell RNA sequencing Data</article-title>. <source>Genome Biol</source>. (<year>2025</year>) <volume>26</volume>:<fpage>216</fpage>. <pub-id pub-id-type="doi">10.1186/s13059-025-03684-6</pub-id><pub-id pub-id-type="pmid">40696440</pub-id></mixed-citation></ref>
<ref id="B94"><label>94.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lotfollahi</surname> <given-names>M</given-names></name> <name><surname>Wolf</surname> <given-names>FA</given-names></name> <name><surname>Theis</surname> <given-names>FJ</given-names></name></person-group>. <article-title>scGEN predicts single-cell perturbation responses</article-title>. <source>Nat Methods</source>. (<year>2019</year>) <volume>16</volume>:<fpage>715</fpage>&#x2013;<lpage>21</lpage>. <pub-id pub-id-type="doi">10.1038/s41592-019-0494-8</pub-id><pub-id pub-id-type="pmid">31363220</pub-id></mixed-citation></ref>
<ref id="B95"><label>95.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Civelek</surname> <given-names>M</given-names></name> <name><surname>Lusis</surname> <given-names>AJ</given-names></name></person-group>. <article-title>Systems genetics approaches to understand complex traits</article-title>. <source>Nat Rev Genet</source>. (<year>2014</year>) <volume>15</volume>:<fpage>34</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1038/nrg3575</pub-id><pub-id pub-id-type="pmid">24296534</pub-id></mixed-citation></ref>
<ref id="B96"><label>96.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>Y</given-names></name> <name><surname>Kang</surname> <given-names>Y</given-names></name> <name><surname>Zou</surname> <given-names>T</given-names></name> <name><surname>Pu</surname> <given-names>Y</given-names></name> <name><surname>He</surname> <given-names>Y</given-names></name> <name><surname>Ye</surname> <given-names>X</given-names></name><etal/></person-group><article-title>Vertical federated learning: concepts, advances, and challenges</article-title>. <source>IEEE Trans Knowl Data Eng</source>. (<year>2024</year>) <volume>36</volume>:<fpage>3615</fpage>&#x2013;<lpage>34</lpage>. <pub-id pub-id-type="doi">10.1109/TKDE.2024.3352628</pub-id></mixed-citation></ref>
<ref id="B97"><label>97.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Rajput</surname> <given-names>D</given-names></name> <name><surname>Wang</surname> <given-names>W</given-names></name> <name><surname>Chen</surname> <given-names>C</given-names></name></person-group>. <article-title>Evaluation of a decided sample size in machine learning applications</article-title>. <source>BMC Bioinform</source>. (<year>2023</year>) <volume>24</volume>:<fpage>48</fpage>. <pub-id pub-id-type="doi">10.1186/s12859-023-05156-9</pub-id></mixed-citation></ref>
<ref id="B98"><label>98.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Suetens</surname> <given-names>P</given-names></name></person-group>, <source>Fundamentals of Medical Imaging</source>. <edition>3rd</edition> ed. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name> (<year>2017</year>).</mixed-citation></ref>
<ref id="B99"><label>99.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wan</surname> <given-names>Z</given-names></name> <name><surname>Hazel</surname> <given-names>JW</given-names></name> <name><surname>Clayton</surname> <given-names>EW</given-names></name> <name><surname>Vorobeychik</surname> <given-names>Y</given-names></name> <name><surname>Kantarcioglu</surname> <given-names>M</given-names></name> <name><surname>Malin</surname> <given-names>BA</given-names></name></person-group>. <article-title>Sociotechnical safeguards for genomic data privacy</article-title>. <source>Nat Rev Genet</source>. (<year>2022</year>) <volume>23</volume>:<fpage>429</fpage>&#x2013;<lpage>45</lpage>. <pub-id pub-id-type="doi">10.1038/s41576-022-00455-y</pub-id><pub-id pub-id-type="pmid">35246669</pub-id></mixed-citation></ref>
<ref id="B100"><label>100.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Mouchet</surname> <given-names>CV</given-names></name> <name><surname>Bossuat</surname> <given-names>J</given-names></name> <name><surname>Troncoso-Pastoriza</surname> <given-names>JR</given-names></name> <name><surname>Hubaux</surname> <given-names>J</given-names></name></person-group>. <article-title>Lattigo: a multiparty homomorphic encryption library in go</article-title>. <comment>In: <italic>Proceedings of the 8th Workshop on Encrypted Computing and Applied Homomorphic Cryptography</italic> (2020). p. 64&#x2013;70</comment>.</mixed-citation></ref>
<ref id="B101"><label>101.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Bell</surname> <given-names>JH</given-names></name> <name><surname>Bonawitz</surname> <given-names>KA</given-names></name> <name><surname>Gasc&#x00F3;n</surname> <given-names>A</given-names></name> <name><surname>Lepoint</surname> <given-names>T</given-names></name> <name><surname>Raykova</surname> <given-names>M</given-names></name></person-group>. <article-title>Secure single-server aggregation with (Poly) logarithmic overhead</article-title>. <comment>In: <italic>Proceedings of the 2020 ACM Sigsac Conference on Computer and Communications Security</italic> (2020). p. 1253&#x2013;69</comment>.</mixed-citation></ref>
<ref id="B102"><label>102.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>KH</given-names></name> <name><surname>de Gusm&#x00E3;o</surname> <given-names>PPB</given-names></name> <name><surname>Beutel</surname> <given-names>DJ</given-names></name> <name><surname>Lane</surname> <given-names>ND</given-names></name></person-group>. <article-title>Secure aggregation for federated learning in flower</article-title>. <comment>In: <italic>Proceedings of the 2nd ACM International Workshop on Distributed Machine Learning</italic> (2021). p. 8&#x2013;14</comment>.</mixed-citation></ref>
<ref id="B103"><label>103.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ballhausen</surname> <given-names>H</given-names></name> <name><surname>Corradini</surname> <given-names>S</given-names></name> <name><surname>Belka</surname> <given-names>C</given-names></name> <name><surname>Bogdanov</surname> <given-names>D</given-names></name> <name><surname>Boldrini</surname> <given-names>L</given-names></name> <name><surname>Bono</surname> <given-names>F</given-names></name><etal/></person-group><article-title>Privacy-friendly evaluation of patient data with secure multiparty computation in a European pilot study</article-title>. <source>npj Digit Med</source>. (<year>2024</year>) <volume>7</volume>:<fpage>280</fpage>. <pub-id pub-id-type="doi">10.1038/s41746-024-01293-4</pub-id><pub-id pub-id-type="pmid">39397162</pub-id></mixed-citation></ref>
<ref id="B104"><label>104.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Lieftink</surname> <given-names>N</given-names></name> <name><surname>Kroon</surname> <given-names>M</given-names></name> <name><surname>Haringhuizen</surname> <given-names>GB</given-names></name> <name><surname>Wong</surname> <given-names>A</given-names></name> <name><surname>van de Burgwal</surname> <given-names>LHM</given-names></name></person-group>. <article-title>The potential of federated learning for public health purposes: a qualitative analysis of GDPR compliance, Europe, 2021</article-title>. <source>Eurosurveillance</source>. (<year>2024</year>) <volume>29</volume>:<fpage>2300695</fpage>. <pub-id pub-id-type="doi">10.2807/1560-7917.ES.2024.29.38.2300695</pub-id><pub-id pub-id-type="pmid">39301744</pub-id></mixed-citation></ref>
<ref id="B105"><label>105.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Sun</surname> <given-names>C</given-names></name> <name><surname>van Soest</surname> <given-names>J</given-names></name> <name><surname>Koster</surname> <given-names>A</given-names></name> <name><surname>Eussen</surname> <given-names>SJ</given-names></name> <name><surname>Schram</surname> <given-names>MT</given-names></name> <name><surname>Stehouwer</surname> <given-names>CD</given-names></name><etal/></person-group><article-title>Studying the association of diabetes and healthcare cost on distributed data from the Maastricht Study and Statistics Netherlands using a privacy-preserving federated learning infrastructure</article-title>. <source>J Biomed Inform</source>. (<year>2022</year>) <volume>134</volume>:<fpage>104194</fpage>. <pub-id pub-id-type="doi">10.1016/j.jbi.2022.104194</pub-id><pub-id pub-id-type="pmid">36064113</pub-id></mixed-citation></ref>
<ref id="B106"><label>106.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Volini</surname> <given-names>GA</given-names></name></person-group>. <article-title>A deep dive into technical encryption concepts to better understand cybersecurity &#x0026; data privacy legal &#x0026; policy issues</article-title>. <source>J Intell Prop Law</source>. (<year>2020</year>) <volume>28</volume>:<fpage>291</fpage>.</mixed-citation></ref>
<ref id="B107"><label>107.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Martin</surname> <given-names>YD</given-names></name> <name><surname>Kung</surname> <given-names>A</given-names></name></person-group>. <article-title>Methods and tools for GDPR compliance through privacy and data protection engineering</article-title>. <comment>In: <italic>IEEE European Symposium on Security and Privacy Workshops</italic> (2018). p. 108&#x2013;11</comment>.</mixed-citation></ref>
<ref id="B108"><label>108.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>J&#x00E9;gou</surname> <given-names>R</given-names></name> <name><surname>Bachot</surname> <given-names>C</given-names></name> <name><surname>Monteil</surname> <given-names>C</given-names></name> <name><surname>Boernert</surname> <given-names>E</given-names></name> <name><surname>Chmiel</surname> <given-names>J</given-names></name> <name><surname>Boucher</surname> <given-names>M</given-names></name><etal/></person-group><article-title>Capability and accuracy of usual statistical analyses in a real-world setting using a federated approach</article-title>. <source>PLoS ONE</source>. (<year>2024</year>) <volume>19</volume>:<fpage>e0312697</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0312697</pub-id></mixed-citation></ref>
<ref id="B109"><label>109.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><name><surname>Minssen</surname> <given-names>T</given-names></name> <name><surname>Pierce</surname> <given-names>J</given-names></name></person-group>, <source>Big Data and Intellectual Property Rights in the Health and Life Sciences</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name> (<year>2018</year>). p. <fpage>311</fpage>&#x2013;<lpage>23</lpage>. <comment>Chap. 21</comment>.</mixed-citation></ref>
<ref id="B110"><label>110.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Tekgul</surname> <given-names>BGA</given-names></name> <name><surname>Xia</surname> <given-names>Y</given-names></name> <name><surname>Marchal</surname> <given-names>S</given-names></name> <name><surname>Asokan</surname> <given-names>N</given-names></name></person-group>. <article-title>WAFFLE: watermarking in federated learning</article-title>. <comment>In: <italic>40th International Symposium on Reliable Distributed Systems</italic> (2021). p. 310&#x2013;20</comment>.</mixed-citation></ref>
<ref id="B111"><label>111.</label><mixed-citation publication-type="other"><collab>International Trade Administration, US Department of Commerce</collab>. <article-title>Data Privacy Framework (2025)</article-title>. <comment>Available online at:</comment> <ext-link ext-link-type="uri" xlink:href="https://www.dataprivacyframework.gov/">https://www.dataprivacyframework.gov/</ext-link> <comment>(Accessed June 10, 2025)</comment>.</mixed-citation></ref>
<ref id="B112"><label>112.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Daly</surname> <given-names>K</given-names></name> <name><surname>Eichner</surname> <given-names>H</given-names></name> <name><surname>Kairouz</surname> <given-names>P</given-names></name> <name><surname>McMahan</surname> <given-names>HB</given-names></name> <name><surname>Ramage</surname> <given-names>D</given-names></name> <name><surname>Xu</surname> <given-names>Z</given-names></name></person-group>. <article-title>Federated learning in practice: reflections and projections</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:2410.08892</italic> (2025)</comment>.</mixed-citation></ref>
<ref id="B113"><label>113.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><name><surname>Sabt</surname> <given-names>M</given-names></name> <name><surname>Achemlal</surname> <given-names>M</given-names></name> <name><surname>Bouabdallah</surname> <given-names>A</given-names></name></person-group>. <article-title>Trusted execution environment: what it is, and what it is not</article-title>. <comment>In: <italic>2015 IEEE Trustcom/BigDataSE/ISPA</italic> (2015). p. 57&#x2013;64</comment>.</mixed-citation></ref>
<ref id="B114"><label>114.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Wen</surname> <given-names>J</given-names></name> <name><surname>Zhang</surname> <given-names>Z</given-names></name> <name><surname>Lan</surname> <given-names>Y</given-names></name> <name><surname>Cui</surname> <given-names>Z</given-names></name> <name><surname>Cai</surname> <given-names>J</given-names></name> <name><surname>Zhang</surname> <given-names>W</given-names></name></person-group>. <article-title>A survey on federated learning: challenges and applications</article-title>. <source>Int J Mach Learn Cybern</source>. (<year>2023</year>) <volume>14</volume>:<fpage>513</fpage>&#x2013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.1007/s13042-022-01647-y</pub-id><pub-id pub-id-type="pmid">36407495</pub-id></mixed-citation></ref>
<ref id="B115"><label>115.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Yurdem</surname> <given-names>B</given-names></name> <name><surname>Kuzlu</surname> <given-names>M</given-names></name> <name><surname>Gullu</surname> <given-names>MK</given-names></name> <name><surname>Catak</surname> <given-names>FO</given-names></name> <name><surname>Tabassum</surname> <given-names>M</given-names></name></person-group>. <article-title>Federated learning: overview, strategies, applications, tools and future directions</article-title>. <source>Heliyon</source>. (<year>2024</year>) <volume>10</volume>:<fpage>e38137</fpage>. <pub-id pub-id-type="doi">10.1016/j.heliyon.2024.e38137</pub-id><pub-id pub-id-type="pmid">39391509</pub-id></mixed-citation></ref>
<ref id="B116"><label>116.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Ren</surname> <given-names>C</given-names></name> <name><surname>Yu</surname> <given-names>H</given-names></name> <name><surname>Peng</surname> <given-names>H</given-names></name> <name><surname>Tang</surname> <given-names>X</given-names></name> <name><surname>Zhao</surname> <given-names>B</given-names></name> <name><surname>Yi</surname> <given-names>L</given-names></name><etal/></person-group><article-title>Advances and open challenges in federated foundation models</article-title>. <source>IEEE Commun Surv Tutor</source>. (<year>2025</year>) <fpage>1</fpage>. <pub-id pub-id-type="doi">10.1109/COMST.2025.3552524</pub-id></mixed-citation></ref>
<ref id="B117"><label>117.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Gilbert</surname> <given-names>S</given-names></name> <name><surname>Adler</surname> <given-names>R</given-names></name> <name><surname>Holoyad</surname> <given-names>T</given-names></name> <name><surname>Weicken</surname> <given-names>E</given-names></name></person-group>. <article-title>Could transparent model cards with layered accessible information drive trust and safety in health AI?</article-title> <source>npj Digit Med</source>. (<year>2025</year>) <volume>8</volume>:<fpage>124</fpage>. <pub-id pub-id-type="doi">10.1038/s41746-025-01482-9</pub-id><pub-id pub-id-type="pmid">40000736</pub-id></mixed-citation></ref>
<ref id="B118"><label>118.</label><mixed-citation publication-type="other"><collab>Coalition for Health AI</collab>. <article-title>Applied Model Card (2024)</article-title>. <comment>Available online at:</comment> <ext-link ext-link-type="uri" xlink:href="https://www.chai.org/workgroup/applied-model">https://www.chai.org/workgroup/applied-model</ext-link> <comment>(Accessed June 10, 2025)</comment>.</mixed-citation></ref>
<ref id="B119"><label>119.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><name><surname>Collins</surname> <given-names>GS</given-names></name> <name><surname>Moons</surname> <given-names>KGM</given-names></name> <name><surname>Dhiman</surname> <given-names>P</given-names></name> <name><surname>Riley</surname> <given-names>RD</given-names></name> <name><surname>Beam</surname> <given-names>AL</given-names></name> <name><surname>Van Calster</surname> <given-names>B</given-names></name><etal/></person-group><article-title>TRIPOD+AI statement: updated guidance for reporting clinical prediction models that use regression or machine learning methods</article-title>. <source>bmj</source>. (<year>2024</year>) <volume>385</volume>:<fpage>e078378</fpage>. <pub-id pub-id-type="doi">10.1136/bmj-2023-078378</pub-id><pub-id pub-id-type="pmid">38626948</pub-id></mixed-citation></ref></ref-list>
<fn-group>
<fn id="n1" fn-type="custom" custom-type="edited-by"><p>Edited by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1022178/overview">Emmanouil Spanakis</ext-link>, Foundation for Research and Technology Hellas (FORTH), Greece</p></fn>
<fn id="n2" fn-type="custom" custom-type="reviewed-by"><p>Reviewed by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/665431/overview">Uwe Aickelin</ext-link>, The University of Melbourne, Australia</p>
<p><ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3189576/overview">Konstantina Athanasopoulou</ext-link>, National and Kapodistrian University of Athens, Greece</p></fn>
</fn-group>
</back>
</article>