Jorge Miguel Silva
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jorge Miguel Silva has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Diogo Pratas
University of Aveiro
8 shared publications - Carlos Costa
University of Aveiro, Aveiro, Portugal
7 shared publications - José Luís Oliveira
IEETA / DETI, LASI, University of Aveiro, Portugal
7 shared publications - Sérgio Matos
University of Aveiro
6 shared publications - Armando J. Pinho
University of Aveiro
4 shared publications - João Figueira Silva
DETI/IEETA, University of Aveiro, Aveiro, Portugal
4 shared publications
Latest Publications
- 12 October 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (10) , 805
Sharing observational health data following FAIR principles
- 12 October 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (10) , 805
Sharing observational health data following FAIR principles
- Open Access
- 21 May 2026
- Published by IOS Press
- Vol. 336, 1607-1608
A Risk Analysis Tool for Medical Studies
Clinical research studies face substantial operational and methodological challenges that compromise quality and reproducibility. Traditional risk assessment requires specialized expertise and significant time investment, creating barriers for research teams. With the advent of new agentic AI models, there are emerging opportunities to leverage these processes more effectively. Therefore, this paper proposes an integrated web-based assistant that democratizes risk assessment in observational clinical studies through automated guideline import, structured question-answer workflows, and automated report generation. By combining document-oriented database architecture with workflow orchestration, the proposed tool addresses gaps between commercial quality management systems and practical needs of smaller research teams when conducting observational studies.
- 21 May 2026
- Published by IOS Press
- Vol. 336, 1607-1608
Open AccessA Risk Analysis Tool for Medical Studies
Clinical research studies face substantial operational and methodological challenges that compromise quality and reproducibility. Traditional risk assessment requires specialized expertise and significant time investment, creating barriers for research teams. With the advent of new agentic AI models, there are emerging opportunities to leverage these processes more effectively. Therefore, this paper proposes an integrated web-based assistant that democratizes risk assessment in observational clinical studies through automated guideline import, structured question-answer workflows, and automated report generation. By combining document-oriented database architecture with workflow orchestration, the proposed tool addresses gaps between commercial quality management systems and practical needs of smaller research teams when conducting observational studies.
- Open Access
- 9 April 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Biochef: a client-side WebAssembly-based workflow builder for genomic data analysis
Background: Genomics analyses often rely on command-line tools executed via remote servers, imposing usability barriers for non-technical users and raising privacy concerns. WebAssembly (WASM) enables native-code execution directly in web browsers, eliminating installations and data transfers. Results: We introduce BioChef, a client-side genomic workflow platform that uses WASM. BioChef compiles a genomics toolkit into browser-executable modules and exposes them through a drag-and-drop GUI designed to be intuitive. The system provides real-time validation, flexible input methods (form-based and JSON), intermediate step inspections, and reproducible workflows exportable as bash scripts or configuration files. Performance benchmarks across major browsers (Chromium, Gecko, WebKit) demonstrate rapid initialization (LCP 0.583 s), responsive interactivity (INP 30.5 ms), minimal layout shifts (CLS 0.01), and acceptable overhead (average 181.5 ms initial WASM module load). Although browser execution introduced performance penalties ( $$\sim $$ 130 $$\times $$ slower than native), BioChef workflows still significantly outperformed traditional web services such as Galaxy by avoiding network delays and server-side queueing (11.3 $$\times $$ faster in a standard pipeline benchmark). Conclusions: BioChef shows how WebAssembly on the client side can democratize genomic data processing, ensuring privacy, reproducibility and ease of use without external dependencies. To our knowledge, this is the first fully client-side, graphical genomic workflow environment powered by WASM.- 9 April 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Open AccessBiochef: a client-side WebAssembly-based workflow builder for genomic data analysis
Background: Genomics analyses often rely on command-line tools executed via remote servers, imposing usability barriers for non-technical users and raising privacy concerns. WebAssembly (WASM) enables native-code execution directly in web browsers, eliminating installations and data transfers. Results: We introduce BioChef, a client-side genomic workflow platform that uses WASM. BioChef compiles a genomics toolkit into browser-executable modules and exposes them through a drag-and-drop GUI designed to be intuitive. The system provides real-time validation, flexible input methods (form-based and JSON), intermediate step inspections, and reproducible workflows exportable as bash scripts or configuration files. Performance benchmarks across major browsers (Chromium, Gecko, WebKit) demonstrate rapid initialization (LCP 0.583 s), responsive interactivity (INP 30.5 ms), minimal layout shifts (CLS 0.01), and acceptable overhead (average 181.5 ms initial WASM module load). Although browser execution introduced performance penalties ( $$\sim $$ 130 $$\times $$ slower than native), BioChef workflows still significantly outperformed traditional web services such as Galaxy by avoiding network delays and server-side queueing (11.3 $$\times $$ faster in a standard pipeline benchmark). Conclusions: BioChef shows how WebAssembly on the client side can democratize genomic data processing, ensuring privacy, reproducibility and ease of use without external dependencies. To our knowledge, this is the first fully client-side, graphical genomic workflow environment powered by WASM. - Open Access
Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
The intersection of two context-free languages is not generally context-free, but no geometric criterion has characterized when it remains so. The crossing gap (max(i'-i, j'-j) for two crossing push-pop arcs) is the natural candidate. We refute this: we exhibit CFLs whose intersection is CFL despite unbounded-gap crossings. The governing quantity is the inner segment measure: for crossing arcs inducing a decomposition w = P1 P2 P3 P4, it is max(|P2|,|P3|), the length of the longer inner segment between interleaved crossing endpoints. We prove a dichotomy for this measure: bounded inner segments imply context-freeness via a finite buffer construction; growing inner segments with pump-sensitive linkages imply non-context-freeness. The inner segment concept applies to all CFL intersections; the strictness of the resulting characterization depends on the language class. For block-counting CFLs (languages requiring equality among designated pairs of block lengths), the dichotomy is complete: the intersection is CFL if and only if the combined arcs are jointly well-nested. For general CFLs, the CFL direction is unconditional; the non-CFL direction requires pump-sensitive linkages whose necessity is the main open problem, reducing the general CFL intersection problem to a specific property of pump-sensitive decompositions.
Open AccessGeometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
The intersection of two context-free languages is not generally context-free, but no geometric criterion has characterized when it remains so. The crossing gap (max(i'-i, j'-j) for two crossing push-pop arcs) is the natural candidate. We refute this: we exhibit CFLs whose intersection is CFL despite unbounded-gap crossings. The governing quantity is the inner segment measure: for crossing arcs inducing a decomposition w = P1 P2 P3 P4, it is max(|P2|,|P3|), the length of the longer inner segment between interleaved crossing endpoints. We prove a dichotomy for this measure: bounded inner segments imply context-freeness via a finite buffer construction; growing inner segments with pump-sensitive linkages imply non-context-freeness. The inner segment concept applies to all CFL intersections; the strictness of the resulting characterization depends on the language class. For block-counting CFLs (languages requiring equality among designated pairs of block lengths), the dichotomy is complete: the intersection is CFL if and only if the combined arcs are jointly well-nested. For general CFLs, the CFL direction is unconditional; the non-CFL direction requires pump-sensitive linkages whose necessity is the main open problem, reducing the general CFL intersection problem to a specific property of pump-sensitive decompositions.
- Open Access
- 21 January 2026
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 15
HYMET: a hybrid metagenomic pipeline for accurate and efficient taxonomic classification
Background: Reliable taxonomic classification of metagenomic sequences remains constrained by high mutation rates, fragmented assemblies, and large heterogeneous reference databases. HYMET (Hybrid Metagenomic Tool) was developed to overcome these challenges through a 2–stage hybrid design combining adaptive Mash–based screening with Minimap2 alignment and a coverage–weighted Lowest Common Ancestor classifier. Its sample–adaptive thresholds and on–the–fly reference database construction enable efficient, domain–agnostic classification while maintaining accuracy across divergent genomes. Results: Across 7 CAMI assembly datasets in contig mode, HYMET achieved a mean F1 of 83.89%, with genus–level F1 of 76.75% and species–level F1 of 60.18%, while averaging 115.93 s runtime and a mean peak memory of 6.24 GB. Performance remained stable under mutation rates up to 30% for most domains (F1 $\ge$ 0.8), with viral sequences showing the expected decline (F1 $\approx$ 0.5 at 30%). Read and contig inputs produced nearly identical results when sharing reference caches, and real–world datasets confirmed robustness with the human gut metagenome, which reproduced typical anaerobic profiles, while in the ZymoBIOMICS mock community, HYMET recovered all bacterial members; a further ground-truth evaluation on the ZymoBIOMICS Gut Microbiome Standard (D6331) yielded near-perfect genus-level concordance (Pearson $r = 0.998$, Bray–Curtis $= 0.04$) across bacteria, fungi, and archaea. Conclusions: HYMET achieves a practical balance of accuracy, efficiency, and scalability for metagenomic classification. Its adaptive candidate selection, alignment–anchored taxonomy, and reproducible reference caching collectively enhance performance across domains. HYMET source code is fully available at https://github.com/ieeta-pt/HYMET.- 21 January 2026
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 15
Open AccessHYMET: a hybrid metagenomic pipeline for accurate and efficient taxonomic classification
Background: Reliable taxonomic classification of metagenomic sequences remains constrained by high mutation rates, fragmented assemblies, and large heterogeneous reference databases. HYMET (Hybrid Metagenomic Tool) was developed to overcome these challenges through a 2–stage hybrid design combining adaptive Mash–based screening with Minimap2 alignment and a coverage–weighted Lowest Common Ancestor classifier. Its sample–adaptive thresholds and on–the–fly reference database construction enable efficient, domain–agnostic classification while maintaining accuracy across divergent genomes. Results: Across 7 CAMI assembly datasets in contig mode, HYMET achieved a mean F1 of 83.89%, with genus–level F1 of 76.75% and species–level F1 of 60.18%, while averaging 115.93 s runtime and a mean peak memory of 6.24 GB. Performance remained stable under mutation rates up to 30% for most domains (F1 $\ge$ 0.8), with viral sequences showing the expected decline (F1 $\approx$ 0.5 at 30%). Read and contig inputs produced nearly identical results when sharing reference caches, and real–world datasets confirmed robustness with the human gut metagenome, which reproduced typical anaerobic profiles, while in the ZymoBIOMICS mock community, HYMET recovered all bacterial members; a further ground-truth evaluation on the ZymoBIOMICS Gut Microbiome Standard (D6331) yielded near-perfect genus-level concordance (Pearson $r = 0.998$, Bray–Curtis $= 0.04$) across bacteria, fungi, and archaea. Conclusions: HYMET achieves a practical balance of accuracy, efficiency, and scalability for metagenomic classification. Its adaptive candidate selection, alignment–anchored taxonomy, and reproducible reference caching collectively enhance performance across domains. HYMET source code is fully available at https://github.com/ieeta-pt/HYMET. - 16 November 2025
- Published by Springer Nature
- p. 85-96
VCFX: A Minimalist, Modular Toolkit for Streamlined Variant Analysis
- 16 November 2025
- Published by Springer Nature
- p. 85-96
VCFX: A Minimalist, Modular Toolkit for Streamlined Variant Analysis
- Open Access
- 22 October 2025
- Published by Springer Nature in Research Square
BioChef: A Client-Side WebAssembly-Based Workflow Builder for Genomic Data Analysis
Background: Genomics analyses often rely on command-line tools executed via remote servers, imposing usability barriers for non-technical users and raising privacy concerns. WebAssembly (WASM) enables native-code execution directly in web browsers, eliminating installations and data transfers. Results: We introduce BioChef, a client-side genomic workflow platform that uses WASM. BioChef compiles a genomics toolkit into browser-executable modules accessible via an intuitive drag-and-drop GUI. The system provides real-time validation, flexible input methods (form-based and JSON), intermediate step inspections, and reproducible workflows exportable as bash scripts or configuration files. Performance benchmarks across major browsers (Chromium, Gecko, WebKit) demonstrate rapid initialization (LCP 0.583 s), responsive interactivity (INP 30.5 ms), minimal layout shifts (CLS 0.01), and acceptable overhead (average 181.5 ms initial WASM module load). Although browser execution introduced performance penalties (~130x slower than native), BioChef workflows still significantly outperformed traditional web services such as Galaxy by avoiding network delays and server-side queueing (11.3x faster in a standard pipeline benchmark). Conclusions: BioChef shows how WebAssembly on the client side can democratize genomic data processing, ensuring privacy, reproducibility and ease of use without external dependencies. To our knowledge, this is the first fully client-side, graphical genomic workflow environment powered by WASM. Availability: Online demo: https://ieeta-pt.github.io/Biochef. Source code, WebAssembly binaries, and reproducibility artifacts: https://github.com/ieeta-pt/Biochef.
- 22 October 2025
- Published by Springer Nature in Research Square
Open AccessBioChef: A Client-Side WebAssembly-Based Workflow Builder for Genomic Data Analysis
Background: Genomics analyses often rely on command-line tools executed via remote servers, imposing usability barriers for non-technical users and raising privacy concerns. WebAssembly (WASM) enables native-code execution directly in web browsers, eliminating installations and data transfers. Results: We introduce BioChef, a client-side genomic workflow platform that uses WASM. BioChef compiles a genomics toolkit into browser-executable modules accessible via an intuitive drag-and-drop GUI. The system provides real-time validation, flexible input methods (form-based and JSON), intermediate step inspections, and reproducible workflows exportable as bash scripts or configuration files. Performance benchmarks across major browsers (Chromium, Gecko, WebKit) demonstrate rapid initialization (LCP 0.583 s), responsive interactivity (INP 30.5 ms), minimal layout shifts (CLS 0.01), and acceptable overhead (average 181.5 ms initial WASM module load). Although browser execution introduced performance penalties (~130x slower than native), BioChef workflows still significantly outperformed traditional web services such as Galaxy by avoiding network delays and server-side queueing (11.3x faster in a standard pipeline benchmark). Conclusions: BioChef shows how WebAssembly on the client side can democratize genomic data processing, ensuring privacy, reproducibility and ease of use without external dependencies. To our knowledge, this is the first fully client-side, graphical genomic workflow environment powered by WASM. Availability: Online demo: https://ieeta-pt.github.io/Biochef. Source code, WebAssembly binaries, and reproducibility artifacts: https://github.com/ieeta-pt/Biochef.
- Open Access
- 23 September 2025
- Published by Elsevier in Informatics in Medicine Unlocked
- Vol. 58
PhenoQC: An integrated toolkit for quality control of phenotypic data in genomic research
- 23 September 2025
- Published by Elsevier in Informatics in Medicine Unlocked
- Vol. 58
Open AccessPhenoQC: An integrated toolkit for quality control of phenotypic data in genomic research
- Open Access
A Federated Random Forest Solution for Secure Distributed Machine Learning
Privacy and regulatory barriers often hinder centralized machine learning solutions, particularly in sectors like healthcare where data cannot be freely shared. Federated learning has emerged as a powerful paradigm to address these concerns; however, existing frameworks primarily support gradient-based models, leaving a gap for more interpretable, tree-based approaches. This paper introduces a federated learning framework for Random Forest classifiers that preserves data privacy and provides robust performance in distributed settings. By leveraging PySyft for secure, privacy-aware computation, our method enables multiple institutions to collaboratively train Random Forest models on locally stored data without exposing sensitive information. The framework supports weighted model averaging to account for varying data distributions, incremental learning to progressively refine models, and local evaluation to assess performance across heterogeneous datasets. Experiments on two real-world healthcare benchmarks demonstrate that the federated approach maintains competitive predictive accuracy - within a maximum 9\% margin of centralized methods - while satisfying stringent privacy requirements. These findings underscore the viability of tree-based federated learning for scenarios where data cannot be centralized due to regulatory, competitive, or technical constraints. The proposed solution addresses a notable gap in existing federated learning libraries, offering an adaptable tool for secure distributed machine learning tasks that demand both transparency and reliable performance. The tool is available at https://github.com/ieeta-pt/fed_rf.
Open AccessA Federated Random Forest Solution for Secure Distributed Machine Learning
Privacy and regulatory barriers often hinder centralized machine learning solutions, particularly in sectors like healthcare where data cannot be freely shared. Federated learning has emerged as a powerful paradigm to address these concerns; however, existing frameworks primarily support gradient-based models, leaving a gap for more interpretable, tree-based approaches. This paper introduces a federated learning framework for Random Forest classifiers that preserves data privacy and provides robust performance in distributed settings. By leveraging PySyft for secure, privacy-aware computation, our method enables multiple institutions to collaboratively train Random Forest models on locally stored data without exposing sensitive information. The framework supports weighted model averaging to account for varying data distributions, incremental learning to progressively refine models, and local evaluation to assess performance across heterogeneous datasets. Experiments on two real-world healthcare benchmarks demonstrate that the federated approach maintains competitive predictive accuracy - within a maximum 9\% margin of centralized methods - while satisfying stringent privacy requirements. These findings underscore the viability of tree-based federated learning for scenarios where data cannot be centralized due to regulatory, competitive, or technical constraints. The proposed solution addresses a notable gap in existing federated learning libraries, offering an adaptable tool for secure distributed machine learning tasks that demand both transparency and reliable performance. The tool is available at https://github.com/ieeta-pt/fed_rf.
- Open Access
- 14 August 2024
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 156, 102948
Enhancing metagenomic classification with compression-based features
- 14 August 2024
- Published by Elsevier in Artificial Intelligence in Medicine
- Vol. 156, 102948
Open AccessEnhancing metagenomic classification with compression-based features