title: An integer programming approach to DNA sequence assembly.
abstract: De novo sequence assembly is a ubiquitous combinatorial problem in all DNA sequencing technologies. In the presence of errors in the experimental data, the assembly problem is computationally challenging, and its solution may not lead to a unique reconstruct. The enumeration of all alternative solutions is important in drawing a reliable conclusion on the target sequence, and is often overlooked in the heuristic approaches that are currently available. In this paper, we develop an integer programming formulation and global optimization solution strategy to solve the sequence assembly problem with errors in the data. We also propose an efficient technique to identify all alternative reconstructs. When applied to examples of sequencing-by-hybridization, our approach dramatically increases the length of DNA sequences that can be handled with global optimality certificate to over 10,000, which is more than 10 times longer than previously reported. For some problem instances, alternative solutions exhibited a wide range of different ability in reproducing the target DNA sequence. Therefore, it is important to utilize the methodology proposed in this paper in order to obtain all alternative solutions to reliably infer the true reconstruct. These alternative solutions can be used to refine the obtained results and guide the design of further experiments to correctly reconstruct the target DNA sequence.
authors.affiliation: Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA. yjchang@andrew.cmu.edu
authors.forename: Youngjung
authors.initials: Y
authors.lastname: Chang
authors.forename: Nikolaos V
authors.initials: NV
authors.lastname: Sahinidis
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA / Q000379:methods*