title: A computational method for resequencing long DNA targets by universal oligonucleotide arrays.
abstract: Universal arrays contain all possible oligonucleotides of a certain length, typically 6-10 bases. They can determine in a single experiment all substrings of that length that occur along a target sequence. That information, also called the spectrum of the sequence, is not sufficient to uniquely reconstruct a sequence longer than a few hundred bases. We have devised a polynomial algorithm that reconstructs the sequence, given the spectrum and an additional reference sequence, homologous to the target sequence. Such a reference is available, for example, in the identification of single-nucleotide polymorphisms. The algorithm can handle errors in the spectrum as well as substitutions, insertions, and deletions in the target sequence. We present extensive simulation results, which show that the algorithm correctly reconstructs target sequences of >2,000 nucleotides from error-prone 8-mer spectra when realistic levels of single-nucleotide polymorphisms are present.
authors.affiliation: School of Computer Science, Tel Aviv University, Israel. izik@tau.ac.il
authors.forename: Itsik
authors.initials: I
authors.lastname: Pe'er
authors.forename: Naama
authors.initials: N
authors.lastname: Arbili
authors.forename: Ron
authors.initials: R
authors.lastname: Shamir
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D004247:DNA / Q000235:genetics*; D009693:Nucleic Acid Hybridization; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software
chemical_list: D004247:DNA