Shailendra Pratap Singh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shailendra Pratap Singh has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Anoj Kumar
Motilal Nehru National Institute of Technology Allahabad
3 shared publications- Amit Verma
School of Computer Science, University of Petroleum and Energy Studies Dehradun, Uttarakhand, India Senior Member, IEEE
1 shared publication - Anand Nayyar
Graduate School, Faculty of Information Technology, Duy Tan University, Da Nang, Vietnam
1 shared publication - Anoj Kumar
Motilal Nehru National Institute of Technology
1 shared publication - Darshika G. Perera
Department of Electrical and Computer Engineering, University of Colorado Colorado Springs, 1420 Austin Bluffs Parkway, Colorado Springs, CO 80918, USA
1 shared publication Deepak Kumar Singh
Sachedeva Institute of Technology, Frah
1 shared publication
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 159-171
Exploiting Fog Computing and Federated Learning in Health Monitoring
- 2 January 2026
- Published by Springer Nature
- p. 159-171
Exploiting Fog Computing and Federated Learning in Health Monitoring
- 22 July 2024
- Published by Springer Nature in Functional & Integrative Genomics
- Vol. 24 (4) , 1-15
Intelligent mutation based evolutionary optimization algorithm for genomics and precision medicine
In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data’s great dimensionality and complexity, the processing and interpretation of large-scale genomic data present major challenges. In order to overcome these difficulties, this research suggests a novel Intelligent Mutation-Based Evolutionary Optimization Algorithm (IMBOA) created particularly for applications in genomics and precision medicine. In the proposed IMBOA, the mutation operator is guided by genome-based information, allowing for the introduction of variants in candidate solutions that are consistent with known biological processes. The algorithm’s combination of Differential Evolution with this intelligent mutation mechanism enables effective exploration and exploitation of the solution space. Applying a domain-specific fitness function, the system evaluates potential solutions for each generation based on genomic correctness and fitness. The fitness function directs the search toward ideal solutions that achieve the problem’s objectives, while the genome accuracy measure assures that the solutions have physiologically relevant genomic properties. This work demonstrates extensive tests on diverse genomics datasets, including genotype-phenotype association studies and predictive modeling tasks in precision medicine, to verify the accuracy of the proposed approach. The results demonstrate that, in terms of precision, convergence rate, mean error, standard deviation, prediction, and fitness cost of physiologically important genomic biomarkers, the IMBOA consistently outperforms other cutting-edge optimization methods.
- 22 July 2024
- Published by Springer Nature in Functional & Integrative Genomics
- Vol. 24 (4) , 1-15
Intelligent mutation based evolutionary optimization algorithm for genomics and precision medicine
In this paper, genomics and precision medicine have witnessed remarkable progress with the advent of high-throughput sequencing technologies and advances in data analytics. However, because of the data’s great dimensionality and complexity, the processing and interpretation of large-scale genomic data present major challenges. In order to overcome these difficulties, this research suggests a novel Intelligent Mutation-Based Evolutionary Optimization Algorithm (IMBOA) created particularly for applications in genomics and precision medicine. In the proposed IMBOA, the mutation operator is guided by genome-based information, allowing for the introduction of variants in candidate solutions that are consistent with known biological processes. The algorithm’s combination of Differential Evolution with this intelligent mutation mechanism enables effective exploration and exploitation of the solution space. Applying a domain-specific fitness function, the system evaluates potential solutions for each generation based on genomic correctness and fitness. The fitness function directs the search toward ideal solutions that achieve the problem’s objectives, while the genome accuracy measure assures that the solutions have physiologically relevant genomic properties. This work demonstrates extensive tests on diverse genomics datasets, including genotype-phenotype association studies and predictive modeling tasks in precision medicine, to verify the accuracy of the proposed approach. The results demonstrate that, in terms of precision, convergence rate, mean error, standard deviation, prediction, and fitness cost of physiologically important genomic biomarkers, the IMBOA consistently outperforms other cutting-edge optimization methods.
- 20 May 2024
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 31 (8) , 4805-4851
Comprehensive Review on MRI-Based Brain Tumor Segmentation: A Comparative Study from 2017 Onwards
- 20 May 2024
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 31 (8) , 4805-4851
Comprehensive Review on MRI-Based Brain Tumor Segmentation: A Comparative Study from 2017 Onwards
- 3 January 2024
- Published by Springer Nature
- p. 61-73
Development of an Online Collectable Items Marketplace Using Modern Practices of SDLC and Web Technologies
- 3 January 2024
- Published by Springer Nature
- p. 61-73
Development of an Online Collectable Items Marketplace Using Modern Practices of SDLC and Web Technologies
- 3 January 2020
- Published by Springer Nature
- p. 227-235
Differential Evolution Algorithm Using Enhance-Based Adaption Mutant Vector
- 3 January 2020
- Published by Springer Nature
- p. 227-235
Differential Evolution Algorithm Using Enhance-Based Adaption Mutant Vector
- 15 October 2019
- Published by Springer Nature in Iran Journal of Computer Science
- Vol. 3 (2) , 115-126
Cost estimation model using enhance-based differential evolution algorithm
- 15 October 2019
- Published by Springer Nature in Iran Journal of Computer Science
- Vol. 3 (2) , 115-126
Cost estimation model using enhance-based differential evolution algorithm
- 21 July 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (3) , 628-650
Multiobjective differential evolution using homeostasis based mutation for application in software cost estimation
- 21 July 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (3) , 628-650
Multiobjective differential evolution using homeostasis based mutation for application in software cost estimation
- 28 May 2017
- Published by Springer Nature
- p. 579-587
Differential Evolution Algorithm Using Population-Based Homeostasis Difference Vector
- 28 May 2017
- Published by Springer Nature
- p. 579-587
Differential Evolution Algorithm Using Population-Based Homeostasis Difference Vector
- 24 April 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 32 (5) , 3245-3257
Pareto based differential evolution with homeostasis based mutation
Differential evolution algorithm is a very popular nature inspired algorithm and it is used for solving single objective optimization problems. Due to its high convergence rate and ability to produce diverse solutions, it has been extended to solve m
- 24 April 2017
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 32 (5) , 3245-3257
Pareto based differential evolution with homeostasis based mutation
Differential evolution algorithm is a very popular nature inspired algorithm and it is used for solving single objective optimization problems. Due to its high convergence rate and ability to produce diverse solutions, it has been extended to solve m