title: Deconvolving sequence variation in mixed DNA populations.
abstract: We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtype DNA sequence, a set of observed variations at each position collected from sequencing data, and a complete catalog of all possible mutations, determine the smallest set of mutations from the catalog that could fully explain the observed variations. The algorithmic complexity of the problem is analyzed for several classes of mutations, including block substitutions, single-range deletions, and single-range insertions. The reconstruction problem is shown to be NP-complete for single-range insertions and deletions, while for block substitutions, single character insertion, and single character deletion mutations, polynomial time algorithms are provided. Once a minimum set of mutations compatible with the observed sequence is found, the relative frequency of those mutations is recovered by solving a system of linear equations. Simulation results show the algorithm successfully deconvolving mutations in p53 known to cause cancer. An extension of the algorithm is proposed as a new method of high throughput screening for single nucleotide polymorphisms by multiplexing DNA.
authors.affiliation: Genera Biosystems, 4 Research Drive, Bundoora, 3151 Victoria, Australia. wildenberg@wehi.edu.au
authors.forename: Andy
authors.initials: A
authors.lastname: Wildenberg
authors.forename: Steven
authors.initials: S
authors.lastname: Skiena
authors.forename: Pavel
authors.initials: P
authors.lastname: Sumazin
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003627:Data Interpretation, Statistical; D005787:Gene Frequency; D014644:Genetic Variation; D009154:Mutation; D020641:Polymorphism, Single Nucleotide; D017422:Sequence Analysis, DNA / Q000379:methods*; D017384:Sequence Deletion