CGAL: computing genome assembly likelihoods.
Assembly algorithms have been extensively benchmarked using simulated data so that results can be compared to ground truth. However, in de novo assembly, only crude metrics such as contig number and size are typically used to evaluate assembly quality. We present CGAL, a novel likelihood-based approach to assembly assessment in the absence of a ground truth. We show that likelihood is more accurate than other metrics currently used for evaluating assemblies, and describe its application to the optimization and comparison of assembly algorithms. Our methods are implemented in software that is freely available at http://bio.math.berkeley.edu/cgal/.
Atif
A
Rahman
Lior
L
Pachter
D000465:Algorithms; D001419:Bacteria / Q000235:genetics; D020451:Contig Mapping / Q000379:methods*; D016680:Genome, Bacterial; D015894:Genome, Human; D006801:Humans; D016013:Likelihood Functions; D017422:Sequence Analysis, DNA / Q000379:methods*