Arturo Chavoya
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Arturo Chavoya has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Hector Alejandro Duran-Limon
CUCEA, University of Guadalajara
4 shared publications - Maria Elena Meda-Campana
Universidad de Guadalajara
4 shared publications Cuauhtemoc Lopez-Martin
Departamento de Sistemas de Información, CUCEA, Universidad de Guadalajara, Guadalajara, Mexico
3 shared publications- Cuauhtémoc López-Martín
Universidad de Guadalajara
3 shared publications Irma R. Andalon-Garcia
Department of Information Systems, CUCEA, Universidad de Guadalajara, Zapopan, Jalisco, Mexico
2 shared publications- Martha Hernández-Ochoa
CUNORTE, University of Guadalajara
2 shared publications
Latest Publications
- 16 November 2025
- Published by Springer Nature
- p. 25-51
Data Visualization in the Era of Data Science: A Review
- 16 November 2025
- Published by Springer Nature
- p. 25-51
Data Visualization in the Era of Data Science: A Review
- 4 November 2023
- Published by Springer Nature
- p. 47-74
The Role of Machine Learning in Big Data Analytics: Current Practices and Challenges
- 4 November 2023
- Published by Springer Nature
- p. 47-74
The Role of Machine Learning in Big Data Analytics: Current Practices and Challenges
- 22 July 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1201-1234
Parallel protein multiple sequence alignment approaches: a systematic literature review
- 22 July 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (2) , 1201-1234
Parallel protein multiple sequence alignment approaches: a systematic literature review
- 10 September 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (4) , 4014-4055
Performance prediction of parallel applications: a systematic literature review
- 10 September 2020
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 77 (4) , 4014-4055
Performance prediction of parallel applications: a systematic literature review
- 3 May 2018
- Published by Bentham Science Publishers Ltd. in Current Bioinformatics
- Vol. 13 (3) , 290-298
SARELI: Sequence Alignment by Radial Evaluation of Local Interactions
Background: A robust guide tree is necessary as a first step for the multiple sequence alignment of proteins. The guide tree is normally generated using an initial distance matrix based on a particular distance metric. Objective: A new tool for generating guide trees for multiple protein sequence alignment is presented. Method: The algorithm involved in the initialization of the progressive algorithm for the alignment of sequences is computed by a novel metric termed Radial Distance that estimates the variation around symbols in two sequences; after the initial distance matrix is generated, a guide tree is created using the neighbor joining algorithm. The guide trees generated with our tool were then fed independently into MUSCLE and Clustal Omega-as these methods can accept external guide trees-to produce the final alignments. Results: The results from our approach in the alignment of the sequences were compared with those from MUSCLE and Clustal Omega (with their original guide trees) on the BAliBASE, SABRE, and PREFAB protein sequence databases. For scoring the alignments, we obtained the sum of pairs score and the column score against the reference alignments of the protein benchmark databases used. The alignments produced using the guide trees generated by SARELI obtained statistically superior scores on sum of pairs and column scores than those using the original guide trees from MUSCLE and Clustal Omega on the SABRE and PREFAB databases. Conclusion: Our proposed approach can generate guide trees that can be used by established multiple sequence alignment methods for proteins.
- 3 May 2018
- Published by Bentham Science Publishers Ltd. in Current Bioinformatics
- Vol. 13 (3) , 290-298
SARELI: Sequence Alignment by Radial Evaluation of Local Interactions
Background: A robust guide tree is necessary as a first step for the multiple sequence alignment of proteins. The guide tree is normally generated using an initial distance matrix based on a particular distance metric. Objective: A new tool for generating guide trees for multiple protein sequence alignment is presented. Method: The algorithm involved in the initialization of the progressive algorithm for the alignment of sequences is computed by a novel metric termed Radial Distance that estimates the variation around symbols in two sequences; after the initial distance matrix is generated, a guide tree is created using the neighbor joining algorithm. The guide trees generated with our tool were then fed independently into MUSCLE and Clustal Omega-as these methods can accept external guide trees-to produce the final alignments. Results: The results from our approach in the alignment of the sequences were compared with those from MUSCLE and Clustal Omega (with their original guide trees) on the BAliBASE, SABRE, and PREFAB protein sequence databases. For scoring the alignments, we obtained the sum of pairs score and the column score against the reference alignments of the protein benchmark databases used. The alignments produced using the guide trees generated by SARELI obtained statistically superior scores on sum of pairs and column scores than those using the original guide trees from MUSCLE and Clustal Omega on the SABRE and PREFAB databases. Conclusion: Our proposed approach can generate guide trees that can be used by established multiple sequence alignment methods for proteins.
- Open Access
- 3 April 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (4) , e93233
Discovery of Possible Gene Relationships through the Application of Self-Organizing Maps to DNA Microarray Databases
DNA microarrays and cell cycle synchronization experiments have made possible the study of the mechanisms of cell cycle regulation of Saccharomyces cerevisiae by simultaneously monitoring the expression levels of thousands of genes at specific time points. On the other hand, pattern recognition techniques can contribute to the analysis of such massive measurements, providing a model of gene expression level evolution through the cell cycle process. In this paper, we propose the use of one of such techniques –an unsupervised artificial neural network called a Self-Organizing Map (SOM)–which has been successfully applied to processes involving very noisy signals, classifying and organizing them, and assisting in the discovery of behavior patterns without requiring prior knowledge about the process under analysis. As a test bed for the use of SOMs in finding possible relationships among genes and their possible contribution in some biological processes, we selected 282 S. cerevisiae genes that have been shown through biological experiments to have an activity during the cell cycle. The expression level of these genes was analyzed in five of the most cited time series DNA microarray databases used in the study of the cell cycle of this organism. With the use of SOM, it was possible to find clusters of genes with similar behavior in the five databases along two cell cycles. This result suggested that some of these genes might be biologically related or might have a regulatory relationship, as was corroborated by comparing some of the clusters obtained with SOMs against a previously reported regulatory network that was generated using biological knowledge, such as protein-protein interactions, gene expression levels, metabolism dynamics, promoter binding, and modification, regulation and transport of proteins. The methodology described in this paper could be applied to the study of gene relationships of other biological processes in different organisms.
- 3 April 2014
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 9 (4) , e93233
Open AccessDiscovery of Possible Gene Relationships through the Application of Self-Organizing Maps to DNA Microarray Databases
DNA microarrays and cell cycle synchronization experiments have made possible the study of the mechanisms of cell cycle regulation of Saccharomyces cerevisiae by simultaneously monitoring the expression levels of thousands of genes at specific time points. On the other hand, pattern recognition techniques can contribute to the analysis of such massive measurements, providing a model of gene expression level evolution through the cell cycle process. In this paper, we propose the use of one of such techniques –an unsupervised artificial neural network called a Self-Organizing Map (SOM)–which has been successfully applied to processes involving very noisy signals, classifying and organizing them, and assisting in the discovery of behavior patterns without requiring prior knowledge about the process under analysis. As a test bed for the use of SOMs in finding possible relationships among genes and their possible contribution in some biological processes, we selected 282 S. cerevisiae genes that have been shown through biological experiments to have an activity during the cell cycle. The expression level of these genes was analyzed in five of the most cited time series DNA microarray databases used in the study of the cell cycle of this organism. With the use of SOM, it was possible to find clusters of genes with similar behavior in the five databases along two cell cycles. This result suggested that some of these genes might be biologically related or might have a regulatory relationship, as was corroborated by comparing some of the clusters obtained with SOMs against a previously reported regulatory network that was generated using biological knowledge, such as protein-protein interactions, gene expression levels, metabolism dynamics, promoter binding, and modification, regulation and transport of proteins. The methodology described in this paper could be applied to the study of gene relationships of other biological processes in different organisms.
- Open Access
- 30 November 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (11) , e50531
Genetic Programming as Alternative for Predicting Development Effort of Individual Software Projects
Statistical and genetic programming techniques have been used to predict the software development effort of large software projects. In this paper, a genetic programming model was used for predicting the effort required in individually developed projects. Accuracy obtained from a genetic programming model was compared against one generated from the application of a statistical regression model. A sample of 219 projects developed by 71 practitioners was used for generating the two models, whereas another sample of 130 projects developed by 38 practitioners was used for validating them. The models used two kinds of lines of code as well as programming language experience as independent variables. Accuracy results from the model obtained with genetic programming suggest that it could be used to predict the software development effort of individual projects when these projects have been developed in a disciplined manner within a development-controlled environment.
- 30 November 2012
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (11) , e50531
Open AccessGenetic Programming as Alternative for Predicting Development Effort of Individual Software Projects
Statistical and genetic programming techniques have been used to predict the software development effort of large software projects. In this paper, a genetic programming model was used for predicting the effort required in individually developed projects. Accuracy obtained from a genetic programming model was compared against one generated from the application of a statistical regression model. A sample of 219 projects developed by 71 practitioners was used for generating the two models, whereas another sample of 130 projects developed by 38 practitioners was used for validating them. The models used two kinds of lines of code as well as programming language experience as independent variables. Accuracy results from the model obtained with genetic programming suggest that it could be used to predict the software development effort of individual projects when these projects have been developed in a disciplined manner within a development-controlled environment.
- 1 January 2012
- Published by ACTA Press
Software Size Estimation of Individual Projects
- 3 December 2011
- Published by Springer Nature in Empirical Software Engineering
- Vol. 17 (6) , 738-756
Software development effort prediction of industrial projects applying a general regression neural network
- 3 December 2011
- Published by Springer Nature in Empirical Software Engineering
- Vol. 17 (6) , 738-756
Software development effort prediction of industrial projects applying a general regression neural network