IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v7y2016i1p1-15.html
   My bibliography  Save this article

Cellular Automata-Based PSO Algorithm for Aligning Multiple Molecular Sequences

Author

Listed:
  • Jayapriya Jayakumar

    (National Institute of Technology, Tiruchirappalli, India)

  • Michael Arock

    (National Institute of Technology, Tiruchirappalli, India)

Abstract

In Bioinformatics, sequence analysis is the basic important concept that provides information for structural and functional analysis. Multiple Sequence Alignment (MSA) is a keystone problem in the sequence analysis that is used for constructing phylogenetic tree, finding motif, gene expression, etc. Basically, all biological computation issues are NP-complete problems. In this paper, a novel approach using Cellular Automata (CA) and Particle Swarm Optimization (PSO) techniques are proposed for MSA problem. Both of these techniques handle NP-complete problems very skillfully. For experimental analysis, the BaliBASE benchmark dataset and two scoring functions Sum of Pairs (SP) and Total Column (TC) are considered in this paper for calculating the similarity among the sequences. Using the Wilcoxon matched pair signed rank test the significance of the proposed algorithm (PSOCA) is explained. This algorithm is compared with PSO, genetic algorithm and the state-of-the-art techniques. The results show that the PSOCA approach yields better performance than other state-of-the-art algorithms.

Suggested Citation

  • Jayapriya Jayakumar & Michael Arock, 2016. "Cellular Automata-Based PSO Algorithm for Aligning Multiple Molecular Sequences," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 7(1), pages 1-15, January.
  • Handle: RePEc:igg:jaec00:v:7:y:2016:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2016010101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaec00:v:7:y:2016:i:1:p:1-15. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.