|
Tultialx KNz Sxquxntx zlignTxnt izsxK on Gxnxtit zlgorithTs znK KiviKx-znK-tonquxr Txthniquxs
PAyi-Ping ZAxn a, ZAung-Aui Lin a and PAi-Jay ZAxn a
aDxpartPxnt of ZoPputxr PZixnZx and InforPation xnginxxring National Taiwan UnivxrPity of PZixnZx and TxZAnology Taipxi 106, Taiwan, R. O. Z.
|
Abstract:
Multiple DNA sequence alignment is one of the important research topics of bioinformatics. Because of the huge length of DNA sequences of advanced organisms, some researchers used divide-and-conquer techniques to cut the sequences for decreasing the space complexity for sequence alignment. Because the cutting points of sequences of the existing methods are fixed at the middle or the near-middle points, the performance of sequence alignment of the existing methods is not good enough. In this paper, we present a new method for multiple DNA sequence alignment using genetic algorithms and divide-and-conquer techniques to choose optimal cut points of multiple DNA sequences. The experimental results show that the proposed method is better than the existing method for dealing with multiple DNA sequence alignment.
|
|
Keywords: DNA sequences; sequence alignment; multiple sequence alignment; divide-and- conquer techniques; genetic algorithms.
|
Download PDF
|
|
*Corresponding author; e-mail: smchen@et.ntust.edu.tw
|
©
2005
CSME , ISSN 0257-9731
|