2016
DOI: 10.1109/tevc.2015.2469546
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Multiobjective Memetic Metaheuristic for Multiple Sequence Alignment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(28 citation statements)
references
References 44 publications
0
18
0
Order By: Relevance
“…To reduce the computational effort, we preselect three multi-objective formulations of MSA and limit our investigation thereon. Thus we choose one of the formulations from among {Gap, SOP} [23], {SOP, TC} [20] and {wSOP, TC} [31,26] (please see Section 4 Table 2). We experiment with five randomly selected replicates (R0, R4, R9, R14, R19) and then judge based on two criteria: firstly, we used multiple linear regression analysis to examine the association between individual objective function and FN rate; secondly, we assess the alignments generated through the optimization of each set of objective functions in terms resultant ML trees.…”
Section: Selection From Among the Existing Formulationsmentioning
confidence: 99%
See 2 more Smart Citations
“…To reduce the computational effort, we preselect three multi-objective formulations of MSA and limit our investigation thereon. Thus we choose one of the formulations from among {Gap, SOP} [23], {SOP, TC} [20] and {wSOP, TC} [31,26] (please see Section 4 Table 2). We experiment with five randomly selected replicates (R0, R4, R9, R14, R19) and then judge based on two criteria: firstly, we used multiple linear regression analysis to examine the association between individual objective function and FN rate; secondly, we assess the alignments generated through the optimization of each set of objective functions in terms resultant ML trees.…”
Section: Selection From Among the Existing Formulationsmentioning
confidence: 99%
“…• {wSOP, TC}: Maximize the weighted sum of pairs with affine gap penalties (wSOP) and the number totally aligned columns (TC) [31,26].…”
Section: Objective Functionsmentioning
confidence: 99%
See 1 more Smart Citation
“…As the VMP problem can be regarded as a combinatorial optimization problem (COP) [44], [45], many EC algorithms may be applicable [28]. EC algorithms have been successfully applied to many COPs, such as protein structure prediction [46], music composition [47], multiple sequence alignment [48], distribution network restoration [49], constrained optimization [50], scheduling problems [51], and haystack problem [52], and have shown promising performance. However, among the EC algorithms, the ACO paradigm [53], [54], especially its ant colony system (ACS) variant, fits COPs better and has shown particular strengths in solving real-world COPs.…”
mentioning
confidence: 99%
“…As we can see, the output of H4MSA is a set of non-dominated solutions, that is, a set of solutions that represents a trade-off between alignment quality (f 1 ) and consistency (f 2 ). A detailed description of the H4MSA algorithms appears in [18].…”
mentioning
confidence: 99%