title: Application of a superword array in genome assembly.
abstract: We introduce a data structure called a superword array for finding quickly matches between DNA sequences. The superword array possesses some desirable features of the lookup table and suffix array. We describe simple algorithms for constructing and using a superword array to find pairs of sequences that share a unique superword. The algorithms are implemented in a genome assembly program called PCAP.REP for computation of overlaps between reads. Experimental results produced by PCAP.REP and PCAP on a whole-genome dataset show that PCAP.REP produced a more accurate and contiguous assembly than PCAP.
authors.affiliation: Department of Computer Science, Iowa State University, Ames, IA 50011-1040, USA. xqhuang@cs.iastate.edu
authors.forename: Xiaoqiu
authors.initials: X
authors.lastname: Huang
authors.forename: Shiaw-Pyng
authors.initials: SP
authors.lastname: Yang
authors.forename: Asif T
authors.initials: AT
authors.lastname: Chinwalla
authors.forename: LaDeana W
authors.initials: LW
authors.lastname: Hillier
authors.forename: Patrick
authors.initials: P
authors.lastname: Minx
authors.forename: Elaine R
authors.initials: ER
authors.lastname: Mardis
authors.forename: Richard K
authors.initials: RK
authors.lastname: Wilson
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D016681:Genome, Fungal; D023281:Genomics / Q000379:methods*; D006658:Histoplasma / Q000235:genetics