2014
DOI: 10.1016/j.cmpb.2014.01.013
|View full text |Cite
|
Sign up to set email alerts
|

Multiple sequence alignment with affine gap by using multi-objective genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 52 publications
(26 citation statements)
references
References 24 publications
0
26
0
Order By: Relevance
“…To overcome this drawback, iterative alignment algorithms like improved version of Hidden Markov Model [15] is employed. Many evolutionary algorithms are used for this alignment problem [3] [7]. When considering local alignment, there are many algorithms like EMBOSS [16] which uses the modified version of SW algorithm to improve the speed up, LALIGN [4] which finds the internal duplications by calculating non-interesting local alignments of protein or DNA sequences and BLAST that enables to compare a query sequence with a library of sequences, and identify library sequences that resemble the query sequence above a certain threshold for pair-wise alignment problem.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…To overcome this drawback, iterative alignment algorithms like improved version of Hidden Markov Model [15] is employed. Many evolutionary algorithms are used for this alignment problem [3] [7]. When considering local alignment, there are many algorithms like EMBOSS [16] which uses the modified version of SW algorithm to improve the speed up, LALIGN [4] which finds the internal duplications by calculating non-interesting local alignments of protein or DNA sequences and BLAST that enables to compare a query sequence with a library of sequences, and identify library sequences that resemble the query sequence above a certain threshold for pair-wise alignment problem.…”
Section: Related Workmentioning
confidence: 99%
“…Orobitg et al, [14] in 2013 has proposed improved GA using Q score as objective function. Kaya et al, [7] in 2014 has proposed multi-objective GA with affine gap, SP and column score as the objective function for MSA problem. In 2014, Arabi et al [1] has proposed an enhanced dynamic algorithm to align genome sequences.…”
Section: Related Workmentioning
confidence: 99%
“…To overcome this drawback iterative alignment algorithms like [3], [4] are employed. As the MSA is an NP-complete problem [5], evolutionary approaches like [6], [7] are followed in order to find approximate solutions. In recent years, as there is an increase in the databases of the computational biology, the above said algorithms are considered to be time consuming ones.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Also, advanced computational approaches and machine-learning techniques are also widely used to improve the accuracy in MSAs. Thus, genetic algorithms can be implemented to combine different alignment scores in the fitness function and achieve more accurate MSAs [9,10]. Moreover, another well-known technique such as swarm optimization has been recently applied together with hidden Markov models (HMMs) to generate better alignments [11].…”
Section: Introductionmentioning
confidence: 99%
“…In the same way, other algorithms propose alternative evaluations by adding several features related to secondary structure, gaps and conservation [20,21]. However, most of the previously described alignment approaches still consider suboptimal scores such as PAM and BLOSUM [10,11] or STRIKE [9]. In this work, novel alternative scoring schemes will be proposed to address the MSA evaluation problem by integrating a wide dataset of both other scores and biological features.…”
Section: Introductionmentioning
confidence: 99%