A contig assembly program based on sensitive detection of fragment overlaps.
An effective computer program for assembling DNA fragments, the contig assembly program (CAP), has been developed. In the CAP program, a filter is used to eliminate quickly fragment pairs that could not possibly overlap, a dynamic programming algorithm is applied to compute the maximal-scoring overlapping alignment between each remaining pair of fragments, and a simple greedy approach is employed to assemble fragments in order of alignment scores. To identify the true fragment overlaps, the dynamic programming algorithm uses specially chosen sets of alignment parameters to tolerate sequencing errors and to penalize "mutational" changes between different copies of a repetitive sequence. The performance tests of the program on fragment data from genomic sequencing projects produced satisfactory results. The CAP program is efficient in computer time and memory; it took about 4 h to assemble a set of 1015 fragments into long contigs on a Sun workstation.
Huang
X
X
Department of Computer Science, Michigan Technological University, Houghton 49931.
D000465:Algorithms; D001483:Base Sequence; D003198:Computer Simulation; D004247:DNA / Q000032:analysis*; D006801:Humans; D008957:Models, Genetic; D008969:Molecular Sequence Data; D016693:Receptors, Antigen, T-Cell, alpha-beta / Q000235:genetics; D012091:Repetitive Sequences, Nucleic Acid; D017385:Sequence Homology; D012984:Software
D016693:Receptors, Antigen, T-Cell, alpha-beta; D004247:DNA