مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

696
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

0
Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

SELECT THE SHORTEST SUPERSTRING USING PARTICLE SWARM ALGORITHM IN DNA

Pages

  31-39

Abstract

 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.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    RANJBAR, GOLAMALI, & KHADEMI AGHMASHHADI, FATEME. (2015). SELECT THE SHORTEST SUPERSTRING USING PARTICLE SWARM ALGORITHM IN DNA. JOURNAL OF CROP BREEDING, 7(15), 31-39. SID. https://sid.ir/paper/180965/en

    Vancouver: Copy

    RANJBAR GOLAMALI, KHADEMI AGHMASHHADI FATEME. SELECT THE SHORTEST SUPERSTRING USING PARTICLE SWARM ALGORITHM IN DNA. JOURNAL OF CROP BREEDING[Internet]. 2015;7(15):31-39. Available from: https://sid.ir/paper/180965/en

    IEEE: Copy

    GOLAMALI RANJBAR, and FATEME KHADEMI AGHMASHHADI, “SELECT THE SHORTEST SUPERSTRING USING PARTICLE SWARM ALGORITHM IN DNA,” JOURNAL OF CROP BREEDING, vol. 7, no. 15, pp. 31–39, 2015, [Online]. Available: https://sid.ir/paper/180965/en

    Related Journal Papers

    Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops





    Move to top