Nodes (V) = reads Edges (E) = between overlapping reads Path = Contig (each node occurs at least once) Builds graph – alignments Removing ambiguities Output ...
確定! 回上一頁