Volume 7, Issue 15 (7-2015)
J Crop Breed 2015, 7(15): 31-39 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
(2015). Select the Shortest Superstring using Particle Swarm Algorithm in DNA. J Crop Breed. 7(15), 31-39.
URL: http://jcb.sanru.ac.ir/article-1-421-en.html
URL: http://jcb.sanru.ac.ir/article-1-421-en.html
Abstract: (4063 Views)
A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) is a proper estimation of the main DNA string. Therefore aims of the present study is demonstrating an evolutionary algorithm for selecting the shortest superstring into a DNA string. The practical problem in current study is the shortest superstring problem (SSP). We solve the problem using particle swarm optimization algorithm (PSO) in evolutionary algorithm level by programming language MATLAB version R2011a. In comparison with solving problem by genetic algorithm, the result of present study was much better than the above mentioned algorithm.
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
