An integer programming approach to DNA sequence assembly

Authors:
Youngjung Chang;Nikolaos V. Sahinidis
Affiliations:
Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA;Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
Computational Biology and Chemistry
Year:
2011

Citing 9
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Euler circuits and DNA sequencing by hybridization

Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Complexity of DNA sequencing by hybridization

Theoretical Computer Science
Probabilistic nucleotide assembling method for sequencing by hybridization

Bioinformatics
Sequencing by hybridization with errors: handling longer sequences

Theoretical Computer Science
Restricting SBH ambiguity via restriction enzymes

Discrete Applied Mathematics
A metaheuristic approach for the sequencing by hybridization problem with positive and negative errors

Engineering Applications of Artificial Intelligence
An ant colony optimization algorithm for DNA sequencing by hybridization

Computers and Operations Research
Computability of models for sequence assembly

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

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.