EFFICIENT TWO-LEVEL SWARM INTELLIGENCE APPROACH FOR MULTIPLE SEQUENCE ALIGNMENT

被引:0
|
作者
Lalwani, Soniya [1 ]
Kumar, Rajesh [2 ]
Gupta, Nilama [3 ]
机构
[1] Birla Inst Sci Res, Malaviya Natl Inst Technol R&D, Adv Bioinformat Ctr, Dept Math, Jaipur, Rajasthan, India
[2] Malaviya Natl Inst Technol, Dept Elect Engn, Jaipur, Rajasthan, India
[3] Malaviya Natl Inst Technol, Dept Math, Jaipur, Rajasthan, India
关键词
Particle swarm optimization; multiple sequence alignment; average pairwise sequence identity; time complexity; scoring schemes; GENETIC ALGORITHM; OPTIMIZATION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes two-level particle swarm optimization (TL-PSO), an efficient PSO variant that addresses two levels of optimization problem. Level one works on optimizing dimension for entire swarm, whereas level two works for optimizing each particle's position. The issue addressed here is one of the most challenging multiple sequence alignment (MSA) problem. TL-PSO deals with the arduous task of determination of exact sequence length with most suitable gap positions in MSA. The two levels considered here are: to obtain optimal sequence length in level one and to attain optimum gap positions for maximal alignment score in level two. The performance of TL-PSO has been assessed through a comparative study with two kinds of benchmark dataset of DNA and RNA. The efficiency of the proposed approach is evaluated with four popular scoring schemes at spe-cific parameters. TL-PSO alignments are compared with four PSO variants, i.e. S-PSO, M-PSO, ED-MPSO and CPSO-Sk, and two leading alignment software, i.e. ClustalW and T-Coffee, at different alignment scores. Hence obtained results prove the competence of TL-PSO at accuracy aspects and conclude better score scheme.
引用
收藏
页码:963 / 985
页数:23
相关论文
共 50 条
  • [41] Multiple sequence alignment using enhanced bird swarm align algorithm
    Rehman, Hafiz Asadul
    Zafar, Kashif
    Khan, Ayesha
    Imtiaz, Abdullah
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (01) : 1097 - 1114
  • [42] Memory-efficient A* heuristics for multiple sequence alignment
    McNaughton, M
    Lu, P
    Schaeffer, J
    Szafron, D
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 737 - 743
  • [43] Efficient Constrained Multiple Sequence Alignment with performance guarantee
    Chin, FYL
    Ho, NL
    Lam, TW
    Wong, PWH
    Chan, MY
    PROCEEDINGS OF THE 2003 IEEE BIOINFORMATICS CONFERENCE, 2003, : 337 - 346
  • [44] A Swarm Intelligence Approach to the Quadratic Multiple Knapsack Problem
    Sundar, Shyam
    Singh, Alok
    NEURAL INFORMATION PROCESSING: THEORY AND ALGORITHMS, PT I, 2010, 6443 : 626 - 633
  • [45] Efficient approach to seek exact analytical solutions of periodically driven two-level systems
    Yang, Xiaoxue
    Wu, Ying
    JOURNAL OF PHYSICS B-ATOMIC MOLECULAR AND OPTICAL PHYSICS, 2006, 39 (09) : 2285 - 2290
  • [46] An approach to generating two-level video abstraction
    Cheng, WG
    Xu, D
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 2896 - 2900
  • [47] An improved approach for two-level microstructure fabrication
    Wang, Y
    Zhu, CC
    Li, Y
    Wu, CY
    ELECTROCHEMICAL AND SOLID STATE LETTERS, 2004, 7 (09) : C104 - C106
  • [48] A Two-Level Online Parameter Identification Approach
    Chen, Runze
    Wu, Wenchuan
    Sun, Hongbin
    Zhang, Boming
    2013 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING (PES), 2013,
  • [49] A TWO-LEVEL APPROACH TO WEB GENRE CLASSIFICATION
    Waltinger, Ulli
    Mehler, Alexander
    Wegner, Armin
    WEBIST 2009: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND TECHNOLOGIES, 2009, : 689 - 692
  • [50] Clustering DTDs: An interactive two-level approach
    Zhou, AY
    Qian, WI
    Qian, HL
    Zhang, L
    Liang, YQ
    Jin, W
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2002, 17 (06) : 807 - 819