Answers are grounded in this paper and cite their sources.
In this paper, we present a new algorithm to solve multiple alignments of nucleic acid sequences. The presented method is divided in three steps. Firstly, the algorithm separates the common regions between the aligned sequences (conserved regions) from the non-common regions. Consequently, the first step produces two types of sub-sequences. Secondly, the obtained non-common sub-sequences are aligned using a multi-objective genetic algorithm. Thirdly, we concatenate the sub-alignments obtained from the second step and the similar parts obtained from the first step to construct the final alignment. In order to evaluate the performance of the proposed algorithm, a comparative study has been performed using some of the most popular methods for alignment of nucleic acid sequences and the benchmark Bralibase (Benchmark RNA Database). The obtained results illustrate clearly the effectiveness of the proposed algorithm.
No takes yet. Share an insight, caveat, or question.
Fatmi et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: