An Eulerian path approach to global multiple alignment for DNA sequences.
With the rapid increase in the dataset of genome sequences, the multiple sequence alignment problem is increasingly important and frequently involves the alignment of a large number of sequences. Many heuristic algorithms have been proposed to improve the speed of computation and the quality of alignment. We introduce a novel approach that is fundamentally different from all currently available methods. Our motivation comes from the Eulerian method for fragment assembly in DNA sequencing that transforms all DNA fragments into a de Bruijn graph and then reduces sequence assembly to a Eulerian path problem. The paper focuses on global multiple alignment of DNA sequences, where entire sequences are aligned into one configuration. Our main result is an algorithm with almost linear computational speed with respect to the total size (number of letters) of sequences to be aligned. Five hundred simulated sequences (averaging 500 bases per sequence and as low as 70% pairwise identity) have been aligned within three minutes on a personal computer, and the quality of alignment is satisfactory. As a result, accurate and simultaneous alignment of thousands of long sequences within a reasonable amount of time becomes possible. Data from an Arabidopsis sequencing project is used to demonstrate the performance.
Department of Mathematics, University of Southern California, 1042 W. 36th Place (DRB 289), Los Angeles, CA 90089-1113, USA. yuzhang@usc.edu
Yu
Y
Zhang
Michael S
MS
Waterman
D000465:Algorithms; D017360:Arabidopsis / Q000235:genetics; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods*; D003198:Computer Simulation; D004247:DNA / Q000235:genetics*; D018744:DNA, Plant / Q000235:genetics; D030561:Databases, Nucleic Acid; D008969:Molecular Sequence Data; D011336:Probability; D016415:Sequence Alignment / Q000379:methods*; D012689:Sequence Homology, Nucleic Acid
D018744:DNA, Plant; D004247:DNA