Predicting the accuracy of multiple sequence alignment algorithms by using computational intelligent techniques

被引:10
|
作者
Ortuno, Francisco M. [1 ]
Valenzuela, Olga [2 ]
Pomares, Hector [1 ]
Rojas, Fernando [1 ]
Florido, Javier P. [3 ]
Urquiza, Jose M. [4 ]
Rojas, Ignacio [1 ]
机构
[1] Univ Granada UGR, Dept Comp Architecture & Comp Technol, Granada 18071, Spain
[2] Univ Granada UGR, Dept Appl Math, Granada 18071, Spain
[3] Andalusian Human Genome Sequencing Ctr CASEGH, Med Genome Project, Seville 41092, Spain
[4] Bellvitge Biomed Res Inst IDIBELL, Chromatin & Dis Grp, Barcelona 08907, Spain
关键词
MUTUAL INFORMATION; GENE ONTOLOGY; SELECTION;
D O I
10.1093/nar/gks919
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Multiple sequence alignments (MSAs) have become one of the most studied approaches in bioinformatics to perform other outstanding tasks such as structure prediction, biological function analysis or next-generation sequencing. However, current MSA algorithms do not always provide consistent solutions, since alignments become increasingly difficult when dealing with low similarity sequences. As widely known, these algorithms directly depend on specific features of the sequences, causing relevant influence on the alignment accuracy. Many MSA tools have been recently designed but it is not possible to know in advance which one is the most suitable for a particular set of sequences. In this work, we analyze some of the most used algorithms presented in the bibliography and their dependences on several features. A novel intelligent algorithm based on least square support vector machine is then developed to predict how accurate each alignment could be, depending on its analyzed features. This algorithm is performed with a dataset of 2180 MSAs. The proposed system first estimates the accuracy of possible alignments. The most promising methodologies are then selected in order to align each set of sequences. Since only one selected algorithm is run, the computational time is not excessively increased.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] Improving accuracy of multiple sequence alignment algorithms based on alignment of neighboring residues
    Lu, Yue
    Sze, Sing-Hoi
    NUCLEIC ACIDS RESEARCH, 2009, 37 (02) : 463 - 472
  • [2] Improving multiple sequence alignment biological accuracy through genetic algorithms
    Orobitg, Miquel
    Cores, Fernando
    Guirado, Fernando
    Roig, Concepcio
    Notredame, Cedric
    JOURNAL OF SUPERCOMPUTING, 2013, 65 (03): : 1076 - 1088
  • [3] Improving multiple sequence alignment biological accuracy through genetic algorithms
    Miquel Orobitg
    Fernando Cores
    Fernando Guirado
    Concepció Roig
    Cedric Notredame
    The Journal of Supercomputing, 2013, 65 : 1076 - 1088
  • [4] Multiple sequence alignment using parallel genetic algorithms
    Anbarasu, LA
    Narayanasamy, P
    Sundararajan, V
    SIMULATED EVOLUTION AND LEARNING, 1999, 1585 : 130 - 137
  • [5] MSAGA: Multiple sequence alignment using genetic algorithms
    Shyu, SJ
    Yin, PY
    6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XII, PROCEEDINGS: INDUSTRIAL SYSTEMS AND ENGINEERING II, 2002, : 450 - 455
  • [6] Multiple sequence alignment: Algorithms and applications
    Gotoh, O
    ADVANCES IN BIOPHYSICS, VOL 36, 1999, 1999, 36 : 159 - 206
  • [7] Multiple Sequence Alignment with Genetic Algorithms
    Botta, Marco
    Negro, Guido
    COMPUTATIONAL INTELLIGENCE METHODS FOR BIOINFORMATICS AND BIOSTATISTICS, 2010, 6160 : 206 - 214
  • [8] Approximation algorithms for multiple sequence alignment
    Bafna, V
    Lawler, EL
    Pevzner, PA
    THEORETICAL COMPUTER SCIENCE, 1997, 182 (1-2) : 233 - 244
  • [9] Computational intelligence in multiple sequence alignment
    Bi, Chengpeng
    INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2008, 1 (01) : 8 - 24
  • [10] Resolving Multiple Sequence Alignment Problem Using an Intelligent Cooperative Algorithm
    Chaabane, Lamiche
    2018 3RD INTERNATIONAL CONFERENCE ON PATTERN ANALYSIS AND INTELLIGENT SYSTEMS (PAIS), 2018, : 197 - 199