Fast scaffolding with small independent mixed integer programs.

ABSTRACT:

Motivation

Assembling genomes from short read data has become increasingly popular, but the problem remains computationally challenging especially for larger genomes. We study the scaffolding phase of sequence assembly where preassembled contigs are ordered based on mate pair data.

Results

We present MIP Scaffolder that divides the scaffolding problem into smaller subproblems and solves these with mixed integer programming. The scaffolding problem can be represented as a graph and the biconnected components of this graph can be solved independently. We present a technique for restricting the size of these subproblems so that they can be solved accurately with mixed integer programming. We compare MIP Scaffolder to two state of the art methods, SOPRA and SSPACE. MIP Scaffolde

SUBMITTER: Salmela L 

PROVIDER: S-EPMC3223363 | biostudies-literature | 2011 Dec

REPOSITORIES: biostudies-literature