Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problem
Ko-Wei Huang, Jui-Le Chen, Chu‐Sing Yang, et al.
Neural Computing and Applications (2014) Vol. 26, Iss. 3, pp. 495-506
Closed Access | Times Cited: 37

Showing 1-25 of 37 citing articles:

Particle Swarm Optimization Algorithm and Its Applications: A Systematic Review
Ahmed G. Gad
Archives of Computational Methods in Engineering (2022) Vol. 29, Iss. 5, pp. 2531-2561
Open Access | Times Cited: 799
Major Advances in Particle Swarm Optimization: Theory, Analysis, and Application
Essam H. Houssein, Ahmed G. Gad, Kashif Hussain, et al.
Swarm and Evolutionary Computation (2021) Vol. 63, pp. 100868-100868
Closed Access | Times Cited: 321
Particle Swarm Optimization
Dimitra G. Triantali, Konstantinos E. Parsopoulos
(2024), pp. 1-51
Closed Access | Times Cited: 18
Bio-inspired search algorithms to solve robotic assembly line balancing problems
J. Mukund Nilakantan, S. G. Ponnambalam, N. Jawahar, et al.
Neural Computing and Applications (2015) Vol. 26, Iss. 6, pp. 1379-1393
Closed Access | Times Cited: 60
A Technical Analysis Information Fusion Approach for Stock Price Analysis and Modeling
Salim Lahmiri
Fluctuation and Noise Letters (2018) Vol. 17, Iss. 01, pp. 1850007-1850007
Open Access | Times Cited: 32
Optimizing the DNA fragment assembly using metaheuristic-based overlap layout consensus approach
Uzma, Zahid Halim
Applied Soft Computing (2020) Vol. 92, pp. 106256-106256
Open Access | Times Cited: 25
On the role of metaheuristic optimization in bioinformatics
Laura Calvet, Sergio Benito, Ángel A. Juan, et al.
International Transactions in Operational Research (2022) Vol. 30, Iss. 6, pp. 2909-2944
Open Access | Times Cited: 15
An Efficient-Assembler Whale Optimization Algorithm for DNA Fragment Assembly Problem: Analysis and Validations
Mohamed Abdel‐Basset, Reda Mohamed, Karam M. Sallam, et al.
IEEE Access (2020) Vol. 8, pp. 222144-222167
Open Access | Times Cited: 21
Optical NP problem solver on laser-written waveguide platform
Maria Ramos, Vibhav Bharadwaj, Belén Sotillo, et al.
Optics Express (2018) Vol. 26, Iss. 2, pp. 702-702
Open Access | Times Cited: 23
A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems
Ko-Wei Huang, Abba Suganda Girsang, Ze-Xue Wu, et al.
Applied Sciences (2019) Vol. 9, Iss. 7, pp. 1353-1353
Open Access | Times Cited: 22
Supply chain scheduling optimization based on genetic particle swarm optimization algorithm
Feng Xiong, Peisong Gong, Peng Jin, et al.
Cluster Computing (2018) Vol. 22, Iss. S6, pp. 14767-14775
Closed Access | Times Cited: 21
An efficient discrete PSO coupled with a fast local search heuristic for the DNA fragment assembly problem
Abdelkamel Ben Ali, Gabriel Luque, Enrique Alba
Information Sciences (2019) Vol. 512, pp. 880-908
Closed Access | Times Cited: 21
A memetic gravitation search algorithm for solving DNA fragment assembly problems
Ko-Wei Huang, Jui-Le Chen, Chu-Sing Yang, et al.
Journal of Intelligent & Fuzzy Systems (2016) Vol. 30, Iss. 4, pp. 2245-2255
Closed Access | Times Cited: 11
An improved problem aware local search algorithm for the DNA fragment assembly problem
Abdelkamel Ben Ali, Gabriel Luque, Enrique Alba, et al.
Soft Computing (2015) Vol. 21, Iss. 7, pp. 1709-1720
Closed Access | Times Cited: 10
Particle Swarm Methods
Konstantinos E. Parsopoulos
Springer eBooks (2015), pp. 1-47
Closed Access | Times Cited: 9
Particle Swarm Methods
Konstantinos E. Parsopoulos
Springer eBooks (2018), pp. 639-685
Closed Access | Times Cited: 8
Application of Particle Swarm Optimization to Solve Robotic Assembly Line Balancing Problems
J. Mukund Nilakantan, S. G. Ponnambalam, Peter Nielsen
Elsevier eBooks (2017), pp. 239-267
Closed Access | Times Cited: 8
A DFA‐based approach for the deployment of BPaaS fragments in the cloud
Ameni Hedhli, Haithem Mezni
Concurrency and Computation Practice and Experience (2018) Vol. 32, Iss. 14
Closed Access | Times Cited: 8
Maximum Exact Matches for High Throughput Genome Subsequence Assembly
G. Raja, U. Srinivasulu Reddy
IETE Journal of Research (2019) Vol. 68, Iss. 1, pp. 283-290
Closed Access | Times Cited: 8
PSGO: Particle Swarm Gravitation Optimization Algorithm
Ko-Wei Huang, Jui-Le Chen, Chu-Sing Yang, et al.
Journal of Intelligent & Fuzzy Systems (2015) Vol. 28, Iss. 6, pp. 2655-2665
Closed Access | Times Cited: 7
Solve DNA sequence assembly problem using hybrid crow search optimization and multi classification techniques
G. Raja, U. Srinivasulu Reddy
International Journal of Information Technology (2022) Vol. 14, Iss. 5, pp. 2541-2547
Closed Access | Times Cited: 4
Investigating stochastic diffusion search in DNA sequence assembly problem
Fatimah Majid al-Rifaie, Mohammad Majid al‐Rifaie
(2015) Vol. 4, pp. 625-631
Open Access | Times Cited: 4
Pe-DFA
Youcef Gheraibia, Abdelouahab Moussaoui, Sohag Kabir, et al.
International Journal of Applied Metaheuristic Computing (2016) Vol. 7, Iss. 2, pp. 58-70
Closed Access | Times Cited: 3
A Concise Overview of Particle Swarm Optimization Methods
E. M. Kazakova
Вестник КРАУНЦ Физико-математические науки (2022), Iss. 2, pp. 150-174
Open Access | Times Cited: 3
DNA Fragment Assembly Using Quantum-Inspired Genetic Algorithm
Manisha Rathee, Kumar Dilip, Ritu Rathee
Advances in computer and electrical engineering book series (2018), pp. 80-98
Closed Access | Times Cited: 3
Page 1 - Next Page

Scroll to top