Skip to content

Constructing a Contig Adjacency Graph

mjsull edited this page Sep 15, 2015 · 1 revision

A Contig Adjacency Graph (CAG) is a directed graph where each contig in a de novo assembly is represented as two nodes (forward and reverse strand). A directed edge is created from node A to node B if the sequence represented by node B occurs directly after the sequence represented by node A.

Clone this wiki locally