Matias Gerard

Dr. Matias Gerard

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
6 November 2018 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MGMatias Gerard
Matias Gerard
GSGeorgina Stegmayer
Georgina Stegmayer
DMDiego H. Milone
Diego H. Milone
One of the current challenges in bioinformatics is to discover new ways to transform a set of compounds into specific products. The usual approach is finding the reactions to synthesize a particular product, from a given substrate, by means of classical searching algorithms. However, they have three main limitations: difficulty in handling large amounts of reactions and compounds; absence of a step that verifies the availability of substrates; and inability to find branched pathways. We present here a novel bio-inspired algorithm for synthesizing linear and branched metabolic pathways. It allows relating several compounds simultaneously, ensuring the availability of substrates for every reaction in the solution. Comparisons with classical searching algorithms and other recent metaheuristic approaches show clear advantages of this proposal, fully recovering well-known pathways. Furthermore, solutions found can be analyzed in a simple way through graphical representations on the web.

24 February 2020 in Bioinformatics
Verified
Journal Article
Closed access
LBL Bugnon
L Bugnon
CYC Yones
C Yones
JRJ Raad
J Raad
MGMatias Gerard
Matias Gerard
MRM Rubiolo
M Rubiolo
GSGeorgina Stegmayer
Georgina Stegmayer
Motivation: In precision medicine, next-generation sequencing and novel preclinical reports have led to an increasingly large amount of results, published in the scientific literature. However, identifying novel treatments or predicting a drug response in, for example, cancer patients, from the huge amount of papers available remains a laborious and challenging work. This task can be considered a text mining problem that requires reading a lot of academic documents for identifying a small set of papers describing specific relations between key terms. Due to the infeasibility of the manual curation of these relations, computational methods that can automatically identify them from the available literature are urgently needed. Results: We present DL4papers, a new method based on deep learning that is capable of analyzing and interpreting papers in order to automatically extract relevant relations between specific keywords. DL4papers receives as input a query with the desired keywords, and it returns a ranked list of papers that contain meaningful associations between the keywords. The comparison against related methods showed that our proposal outperformed them in a cancer corpus. The reliability of the DL4papers output list was also measured, revealing that 100% of the first two documents retrieved for a particular search have relevant relations, in average. This shows that our model can guarantee that in the top-2 papers of the ranked list, the relation can be effectively found. Furthermore, the model is capable of highlighting, within each document, the specific fragments that have the associations of the input keywords. This can be very useful in order to pay attention only to the highlighted text, instead of reading the full paper. We believe that our proposal could be used as an accurate tool for rapidly identifying relationships between genes and their mutations, drug responses and treatments in the context of a certain disease. This new approach can certainly be a very useful and valuable resource for the advancement of the precision medicine field. Availability and implementation: A web-demo is available at: http://sinc.unl.edu.ar/web-demo/dl4papers/. Full source code and data are available at: https://sourceforge.net/projects/sourcesinc/files/dl4papers/. Contact: lbugnon@sinc.unl.edu.ar Supplementary information: Supplementary data are available at Bioinformatics online.

1 August 2015 in BioSystems
Verified
Journal Article
Closed access
MGMatias Gerard
Matias Gerard
GSGeorgina Stegmayer
Georgina Stegmayer
DMDiego H. Milone
Diego H. Milone

1 December 2020 in BioSystems
Verified
Journal Article
Closed access
MGMatias Gerard
Matias Gerard
RCRaúl Comelli
Raúl Comelli

1 June 2016 in BioSystems
Verified
Journal Article
Open access
MGMatias Gerard
Matias Gerard
GSGeorgina Stegmayer
Georgina Stegmayer
DMDiego H. Milone
Diego H. Milone
Metabolic pathway building is an active field of research, necessary to understand and manipulate the metabolism of organisms. There are different approaches, mainly based on classical search methods, to find linear sequences of reactions linking two compounds. However, an important limitation of these methods is the exponential increase of search trees when a large number of compounds and reactions is considered. Besides, such models do not take into account all substrates for each reaction during the search, leading to solutions that lack biological feasibility in many cases. This work proposes a new evolutionary algorithm that allows searching not only linear, but also branched metabolic pathways, formed by feasible reactions that relate multiple compounds simultaneously. Tests performed using several sets of reactions show that this algorithm is able to find feasible linear and branched metabolic pathways.

29 July 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
JGJuan Cruz Gamba
Juan Cruz Gamba
EBEliana Borgna
Eliana Borgna
EPEstefania Prochetto
Estefania Prochetto
APAna Rosa Pérez
Ana Rosa Pérez
Alexander Batista DuharteAlexander Batista Duharte
Alexander Batista Duharte
GCGabriel Cabrera
Gabriel Cabrera
Background. Chagas disease, caused by the protozoan parasite Trypanosoma cruzi (T. cruzi), remains a major public health concern in Latin America. No licensed vaccine exists to prevent or treat T. cruzi infection. Identifying correlates of protection (CoPs) could provide substitute endpoints to guide and accelerate vaccine development. Although most CoPs established to date are antibody-based, their utility has not been demonstrated in T. cruzi vaccine reports. Thus, this study aimed to explore alternative strategies considering the use of immune cells as potential CoPs. Methods. Mice were immunized with a vaccine candidate based on the T. cruzi trans-sialidase protein (TSf) and potentiated with 5-fluorouracil (5FU) to deplete myeloid-derived suppressor cells (MDSCs). Percentages of CD4⁺, CD8⁺, and CD11b⁺Gr-1⁺ cellular biomarkers were assessed by flow cytometry from peripheral blood of immunized mice, which were subsequently challenged with a high dose of T. cruzi. Machine learning (ML) model based on Decision Trees was applied to identify potential CoPs to predict survival at day 25 post-infection. Results. Individual biomarkers obtained from flow cytometry did not show strong predictive performance. In contrast, biomarker engineering led to a combination that integrated biomarkers rationally: summing the percentages of CD8⁺ and CD4⁺ cells and subtracting the percentage of CD11b⁺Gr-1⁺ MDSC-like cells (REB), enhanced the predictive capacity. Subsequent computational analysis and ML application led to the identification of a better and even improved potential Integrative CoP: 〖2*%CD8〗^++ 〖%CD4〗^+ - 〖%CD11b〗^+ 〖 Gr1〗^+(pICoP), which significantly improved the performance of a simple one-level decision tree model, achieving an average accuracy of 0.86 and an average AUC-ROC of 0.87 for predicting survival in immunized and infected mice. Conclusion. Results presented herein provide evidence that integrating cellular immune biomarkers through rational biomarker engineering, together with ML analysis, could lead to the identification of potential CoPs for a T. cruzi vaccine.