Constructing a genome assembly that has the maximum likelihood

2013/02/18 by Ghodsi, Mohammadreza
#Computational Engineering #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Finance #and Science (cs.CE)

paper · doi:10.48550/arxiv.1302.4391

Abstract

We formulate genome assembly problem as an optimization problem in which the objective function is the likelihood of the assembly given the reads.

Related

• Theoretical Bounds on Mate-Pair Information for Accurate Genome Assembly
• Near-optimal Assembly for Shotgun Sequencing with Noisy Reads
• The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly
• Genome assembly, from practice to theory: safe, complete and linear-time
• Optimal Assembly for High Throughput Shotgun Sequencing