Matías Gabriel Rojas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matías Gabriel Rojas has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ana Carolina Olivera
Instituto Interdisciplinario de Ciencias Básicas (ICB), Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Universidad Nacional de Cuyo, Mendoza, Argentina
6 shared publications - Pablo Javier Vidal
Instituto Interdisciplinario de Ciencias Básicas (ICB), Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Universidad Nacional de Cuyo, Mendoza, Argentina
6 shared publications - Jessica Andrea Carballido
Instituto de Ciencias e Ingeniería de la Computación, Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Universidad Nacional del Sur, Bahía Blanca, Argentina
3 shared publications Ana Carolina Olivera
1 shared publicationJessica Andrea Carballido
1 shared publicationPablo Javier Vidal
1 shared publication
Latest Publications
- 1 August 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (6) , 1-18
Massive Production of Cancer Synthetic RNA-Seq Gene Expression Samples
- 1 August 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (6) , 1-18
Massive Production of Cancer Synthetic RNA-Seq Gene Expression Samples
- 9 June 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (5) , 1-36
A New Micro-genetic Crossover Operator for Effective Training of Medical Neural Networks
- 9 June 2025
- Published by Springer Nature in SN Computer Science
- Vol. 6 (5) , 1-36
A New Micro-genetic Crossover Operator for Effective Training of Medical Neural Networks
- Open Access
- 10 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 23 (3) , 216-222
Memetic Genetic Particle Swarm Optimization for Druglike Molecule Discovery
Given the vast and complex chemical search space, developing new techniques for identifying promising ligands that satisfy multiple objectives is highly desirable to reduce the costs and times required for effective drug discovery. Neural networks are frequently employed for this task, but they tend to generate molecules that are invalid both chemically and syntactically. As an alternative, metaheuristics have emerged as promising approaches, delivering notable results with reasonable computational costs. However, they often suffer from information loss during the process, leading to poor quality generations. In this work, we introduce a novel memetic algorithm that hybridizes Particle Swarm Optimization with Simulated Annealing. This approach aims to improve the balance between exploration and exploitation in the de-novo drug discovery process, ensuring that promising molecules are not overlooked during generation steps. We compare our approach against six state-of-the-art algorithms, and the results demonstrate that our algorithm enhances molecule generation quality, showing an increased diversity and improved chemical properties of the resulting ligands.
- 10 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 23 (3) , 216-222
Open AccessMemetic Genetic Particle Swarm Optimization for Druglike Molecule Discovery
Given the vast and complex chemical search space, developing new techniques for identifying promising ligands that satisfy multiple objectives is highly desirable to reduce the costs and times required for effective drug discovery. Neural networks are frequently employed for this task, but they tend to generate molecules that are invalid both chemically and syntactically. As an alternative, metaheuristics have emerged as promising approaches, delivering notable results with reasonable computational costs. However, they often suffer from information loss during the process, leading to poor quality generations. In this work, we introduce a novel memetic algorithm that hybridizes Particle Swarm Optimization with Simulated Annealing. This approach aims to improve the balance between exploration and exploitation in the de-novo drug discovery process, ensuring that promising molecules are not overlooked during generation steps. We compare our approach against six state-of-the-art algorithms, and the results demonstrate that our algorithm enhances molecule generation quality, showing an increased diversity and improved chemical properties of the resulting ligands.
- 22 December 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 151, 111192
A genetic operators-based Ant Lion Optimiser for training a medical multi-layer perceptron
- 22 December 2023
- Published by Elsevier in Applied Soft Computing
- Vol. 151, 111192
A genetic operators-based Ant Lion Optimiser for training a medical multi-layer perceptron
- Open Access
- 3 January 2023
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 17
Memetic micro-genetic algorithms for cancer data classification
- 3 January 2023
- Published by Elsevier in Intelligent Systems with Applications
- Vol. 17
Open AccessMemetic micro-genetic algorithms for cancer data classification
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 18 (11) , 1874-1883
A Memetic Cellular Genetic Algorithm for Cancer Data Microarray Feature Selection
Gene selection aims at identifying a -small- subset of informative genes from the initial data to obtain high predictive accuracy for classification in human cancers. Gene selection can be considered as a combinatorial search problem and thus can be conveniently handled with optimization methods. This paper proposes a Memetic Cellular Genetic Algorithm (MCGA) to solve the Feature Selection problem of cancer microarray datasets. Benchmark gene expression datasets, i.e., colon, lymphoma, and leukaemia available in the literature were used for experimentation. MCGA is compared with other well-known metaheuristic' strategies. The results demonstrate that our proposal can provide efficient solutions to find a minimal subset of the genes.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Latin America Transactions
- Vol. 18 (11) , 1874-1883
A Memetic Cellular Genetic Algorithm for Cancer Data Microarray Feature Selection
Gene selection aims at identifying a -small- subset of informative genes from the initial data to obtain high predictive accuracy for classification in human cancers. Gene selection can be considered as a combinatorial search problem and thus can be conveniently handled with optimization methods. This paper proposes a Memetic Cellular Genetic Algorithm (MCGA) to solve the Feature Selection problem of cancer microarray datasets. Benchmark gene expression datasets, i.e., colon, lymphoma, and leukaemia available in the literature were used for experimentation. MCGA is compared with other well-known metaheuristic' strategies. The results demonstrate that our proposal can provide efficient solutions to find a minimal subset of the genes.