Jorge Miguel Ferreira da Silva

Mr. Jorge Miguel Ferreira da Silva

Institute of Electronics and Informatics Engineering of Aveiro, University of Aveiro, 3810-193 Aveiro, Portugal
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2018
Verified
Conference Paper
Closed access
JSJoao Figueira Silva
Joao Figueira Silva
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
AGAntonio Guerra
Antonio Guerra
SMSergio Matos
Sergio Matos
CCCarlos Costa
Carlos Costa
Cardiovascular diseases are the leading cause of death worldwide. These diseases are related with a broad range of factors but usually show high correlation with diminished left ventricle function, which can be evaluated by measuring the ventricular ejection fraction through transthoracic echocardiography (TTE), a cost-effective and highly portable first-line diagnosing technique. Ejection fraction (EF) is currently determined through a semi-automatic process that requires manual delineation of the left ventricle area both in a diastolic and systolic frame of the patient's exam. To remove this manual annotation step, which is both time-consuming and user dependent, automatic Computer-Aided Diagnosis (CAD) systems can be used. Herein, we propose the first steps for such a system that classifies ejection fraction in four classes, based on TTE exams, with the objective of automatically providing valuable information to physicians. Our classification method is based on a 3D-Convolutional Neural Network (3D-CNN) trained on a dataset constructed with exams from a cardiology reference center. The dataset creation consisted of three main steps: firstly, for each exam, cine-loops showing the apical 4 chambers view were manually selected; then, 30 sequential frames were extracted from each cine-loop; finally, each frame was pre-processed to mask burned-in metadata. The neural network was designed to explore concepts such as convolutions using asymmetric filters and residual learning blocks. The model was trained on a dataset with 4000 TTE exams and tested on a separate dataset containing 1600 TTE cases. We obtained an accuracy of 78% and a F1 score of 71.3% for unhealthy EF (below 45%), 63.3% for intermediate EF (45-55%), 72.3% for healthy EF (55-75%) and 54.6% for abnormally high EF (above 75%). These results are promising and show that convolutional neural networks can be applied to this domain. Furthermore, this work will serve as a foundation for future research where other relevant cardiac metrics will be determined.

1 January 2018 in Journal of Biomedical Informatics
Verified
Journal Article
Closed access
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
EPEduardo Pinho
Eduardo Pinho
EMEriksson Monteiro
Eriksson Monteiro
JSJoão Figueira Silva
João Figueira Silva
CCCarlos Costa
Carlos Costa

11 August 2022 in GigaScience
Verified
Journal Article
Open access
PDF file
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
DPDiogo Pratas
Diogo Pratas
TCTania Caetano
Tania Caetano
SMSergio Matos
Sergio Matos
Background: Viruses are among the shortest yet highly abundant species that harbor minimal instructions to infect cells, adapt, multiply, and exist. However, with the current substantial availability of viral genome sequences, the scientific repertory lacks a complexity landscape that automatically enlights viral genomes’ organization, relation, and fundamental characteristics. Results: This work provides a comprehensive landscape of the viral genome’s complexity (or quantity of information), identifying the most redundant and complex groups regarding their genome sequence while providing their distribution and characteristics at a large and local scale. Moreover, we identify and quantify inverted repeats abundance in viral genomes. For this purpose, we measure the sequence complexity of each available viral genome using data compression, demonstrating that adequate data compressors can efficiently quantify the complexity of viral genome sequences, including subsequences better represented by algorithmic sources (e.g., inverted repeats). Using a state-of-the-art genomic compressor on an extensive viral genomes database, we show that double-stranded DNA viruses are, on average, the most redundant viruses while single-stranded DNA viruses are the least. Contrarily, double-stranded RNA viruses show a lower redundancy relative to single-stranded RNA. Furthermore, we extend the ability of data compressors to quantify local complexity (or information content) in viral genomes using complexity profiles, unprecedently providing a direct complexity analysis of human herpesviruses. We also conceive a features-based classification methodology that can accurately distinguish viral genomes at different taxonomic levels without direct comparisons between sequences. This methodology combines data compression with simple measures such as GC-content percentage and sequence length, followed by machine learning classifiers. Conclusions: This article presents methodologies and findings that are highly relevant for understanding the patterns of similarity and singularity between viral groups, opening new frontiers for studying viral genomes’ organization while depicting the complexity trends and classification components of these genomes at different taxonomic levels. The whole study is supported by an extensive website (https://asilab.github.io/canvas/) for comprehending the viral genome characterization using dynamic and interactive approaches.

18 October 2018 in International Journal of Medical Informatics
Verified
Journal Article
Closed access
MPMicael Pedrosa
Micael Pedrosa
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
JSJoão Figueira Silva
João Figueira Silva
SMSergio Matos
Sergio Matos
CCCarlos Costa
Carlos Costa

2 November 2019 in Entropy
Verified
Journal Article
Open access
PDF file
DPDiogo Pratas
Diogo Pratas
MHMorteza Hosseini
Morteza Hosseini
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
Armando PinhoArmando Pinho
Armando Pinho
The development of efficient data compressors for DNA sequences is crucial not only for reducing the storage and the bandwidth for transmission, but also for analysis purposes. In particular, the development of improved compression models directly influences the outcome of anthropological and biomedical compression-based methods. In this paper, we describe a new lossless compressor with improved compression capabilities for DNA sequences representing different domains and kingdoms. The reference-free method uses a competitive prediction model to estimate, for each symbol, the best class of models to be used before applying arithmetic encoding. There are two classes of models: weighted context models (including substitutional tolerant context models) and weighted stochastic repeat models. Both classes of models use specific sub-programs to handle inverted repeats efficiently. The results show that the proposed method attains a higher compression ratio than state-of-the-art approaches, on a balanced and diverse benchmark, using a competitive level of computational resources. An efficient implementation of the method is publicly available, under the GPLv3 license.

13 December 2022 in GigaScience
Verified
Journal Article
Open access
PDF file
JSJorge Miguel Ferreira da Silva
Jorge Miguel Ferreira da Silva
WQWeihong Qi
Weihong Qi
Armando PinhoArmando Pinho
Armando Pinho
DPDiogo Pratas
Diogo Pratas
Background: Low-complexity data analysis is the area that addresses the search and quantification of regions in sequences of elements that contain low-complexity or repetitive elements. For example, these can be tandem repeats, inverted repeats, homopolymer tails, GC-biased regions, similar genes, and hairpins, among many others. Identifying these regions is crucial because of their association with regulatory and structural characteristics. Moreover, their identification provides positional and quantity information where standard assembly methodologies face significant difficulties because of substantial higher depth coverage (mountains), ambiguous read mapping, or where sequencing or reconstruction defects may occur. However, the capability to distinguish low-complexity regions (LCRs) in genomic and proteomic sequences is a challenge that depends on the model’s ability to find them automatically. Low-complexity patterns can be implicit through specific or combined sources, such as algorithmic or probabilistic, and recurring to different spatial distances—namely, local, medium, or distant associations. Findings: This article addresses the challenge of automatically modeling and distinguishing LCRs, providing a new method and tool (AlcoR) for efficient and accurate segmentation and visualization of these regions in genomic and proteomic sequences. The method enables the use of models with different memories, providing the ability to distinguish local from distant low-complexity patterns. The method is reference and alignment free, providing additional methodologies for testing, including a highly flexible simulation method for generating biological sequences (DNA or protein) with different complexity levels, sequence masking, and a visualization tool for automatic computation of the LCR maps into an ideogram style. We provide illustrative demonstrations using synthetic, nearly synthetic, and natural sequences showing the high efficiency and accuracy of AlcoR. As large-scale results, we use AlcoR to unprecedentedly provide a whole-chromosome low-complexity map of a recent complete human genome and the haplotype-resolved chromosome pairs of a heterozygous diploid African cassava cultivar. Conclusions: The AlcoR method provides the ability of fast sequence characterization through data complexity analysis, ideally for scenarios entangling the presence of new or unknown sequences. AlcoR is implemented in C language using multithreading to increase the computational speed, is flexible for multiple applications, and does not contain external dependencies. The tool accepts any sequence in FASTA format. The source code is freely provided at https://github.com/cobilab/alcor.