Journal
BIOINFORMATICS
Volume 27, Issue 23, Pages 3259-3265Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btr562
Keywords
-
Categories
Funding
- Academy of Finland [118653 (ALGODAN), 1140727]
- Helsinki Graduate School in Computer Science and Engineering
Ask authors/readers for more resources
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 Scaffolder is fast and produces better or as good scaffolds as its competitors on large genomes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available