title: Resolving Conflicting Predictions from Multimapping Reads.
abstract: The first step in the analysis of data produced by ultra-high-throughput next-generation sequencing technology is to map short sequence "reads" to a reference genome, if available. Sequencing errors, repeat regions, and polymorphisms may lead a read to align to multiple locations in the genome reasonably well. While ignoring such multimapping reads, or some of their alignments, will reduce the sensitivity of almost any type of downstream analysis (e.g., detecting structural variants), erroneous mappings will typically yield false positive predictions. Here we propose a framework that aims to identify true predictions among a large set of candidate predictions by selecting for each read a unique mapping that collectively imply conflict-free predictions. We formulate this problem as the maximum facility location problem, for which we propose LP-rounding heuristics. We provide a theoretic guarantee on the quality of the solution and demonstrate the utility of our algorithm in resolving conflicting deletions implied by simulated reads mapping ambiguously to Craig Venter's genome model and Illumina sequencing reads of the well-studied NA12878 individual.
authors.affiliation: 1 Toyota Technological Institute at Chicago , Chicago, Illinois.
authors.forename: Stefan
authors.initials: S
authors.lastname: Canzar
authors.affiliation: 2 Masdar Institute of Science and Technology , Abu Dhabi, United Arab Emirates .
authors.forename: Khaled
authors.initials: K
authors.lastname: Elbassioni
authors.affiliation: 3 School of Information Technologies, University of Sydney , Sydney, Australia .
authors.forename: Mitchell
authors.initials: M
authors.lastname: Jones
authors.affiliation: 3 School of Information Technologies, University of Sydney , Sydney, Australia .
authors.forename: Julián
authors.initials: J
authors.lastname: Mestre
mesh_terms: D000465:Algorithms; D020451:Contig Mapping / Q000379:methods* / Q000592:standards; D015894:Genome, Human; D016045:Human Genome Project; D006801:Humans; D011110:Polymorphism, Genetic
keywords: algorithms; combinatorial optimization