SILP3: Maximum likelihood approach to scaffolding
暂无分享,去创建一个
Scaffolding is the important stage of genome assembly consisting of orienting and ordering contigs based on read pairs. We present a scalable scaffolding algorithm that finds most likely contig orientation using integer linear program solved by a non-serial dynamic programming approach. We then formulate the problem of finding most likely contig ordering as an optimization problem and propose a novel ordering algorithm improving over our previous scaffolding tool SILP2.
[1] Oleg Shcherbina. Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization , 2006, OR.
[2] M. Berriman,et al. A comprehensive evaluation of assembly scaffolding tools , 2014, Genome Biology.
[3] Ion I. Mandoiu,et al. Scalable genome scaffolding using integer linear programming , 2012, BCB.