A JAYA algorithm based on normal clouds for DNA sequence optimization

D Zhu, S Wang, Z Huang, C Zhou, L Zhang - Cluster Computing, 2024 - Springer
DNA computing is one of the more popular computational methods currently studied, but the
requirements for nucleic acid molecules in DNA sequences are high, and it is an important …

A feasible solution to the beam-angle-optimization problem in radiotherapy planning with a DNA-based genetic algorithm

Y Li, J Lei - IEEE Transactions on biomedical engineering, 2009 - ieeexplore.ieee.org
Intensity-modulated radiotherapy (IMRT) is now becoming a powerful clinical technique to
improve the therapeutic radio for cancer treatment. It has been demonstrated that selection …

A novel genetic algorithm and its application in TSP

Y Liu, J Huang - 2008 IFIP International Conference on Network …, 2008 - ieeexplore.ieee.org
A novel was proposed for the defections of slow convergence and liable to" premature" of
traditional GA. It creates crossover and mutation by merging two kinds of heuristics …

A bio-soft computing approach to re-arrange a flexible manufacturing robot

RB Abu Bakar, J Watada - … : 11th International Conference, KES 2007, XVII …, 2007 - Springer
This paper presents a new model inspired from DNA bio-chemical procedures to rearrange
a robot in a flexible manufacturing system to assemble different products. In a bio-chemical …

Biological computation of optimal task arrangement for a flexible machining cell

RA Bakar, J Watada - … Engineers, Part I: Journal of Systems …, 2008 - journals.sagepub.com
A flexible manufacturing system (FMS) plays an important and central role in today's
advanced manufacturing. It replaces human tasks (especially those that are highly …

A DNA genetic algorithm for beam angle selection in radiotherapy planning

J Lei, Y Li - 2008 IEEE Conference on Cybernetics and …, 2008 - ieeexplore.ieee.org
There are few of evolutionary algorithms (EAs) considering the influence of bit positions
when mutation operation is implemented. A DNA genetic algorithm (DNA-GA) with a novel …

DNA inspired digital signal pattern matching algorithm

OH Kwon, KY Wang, JY Kim, J Park… - 2007 Frontiers in the …, 2007 - ieeexplore.ieee.org
In this paper, a new algorithm for supervised pattern classification is proposed. One
application area of DNA computing is the pattern matching problem which arise signal …

[PDF][PDF] Optimizing multiple sequence alignments using traveling salesman problem and order-based evolutionary algorithms

JDB Tapia, YJT Valdivia, JHC Humari, P Arequipa - Proceedings of CIBB, 2012 - Citeseer
This paper proposes and implements a method for solving the multiple sequence alignment
problem treating it as a traveling salesman problem, where each sequence is viewed as a …

[PDF][PDF] DNA Algorithm for Pancyclicity and Vertex Connectivity of Graph

A Xavier, A Arokiaraj - Citeseer
Abstract Finding the Pancyclicity and Vertex connectivity for a general graph is the problem
in NP complete class. In this paper, a bio-computation way of solving these two problems …

[PDF][PDF] Shortest Superstring in DNA Sequencing

R Pathak, B Kalita - International Journal of Computer Applications, 2014 - academia.edu
Shortest Superstring in DNA Sequencing Page 1 International Journal of Computer
Applications (0975 – 8887) Volume 89– No.6, March 2014 1 Shortest Superstring in DNA …