Combining de Bruijn graph, overlap graph and microassembly for de novo genome assembly A. Alexandrov, S. Kazakov, S. Melnikov, A. Sergushichev, P. Fedotov, F. Tsarev, A. Shalyto Genome Assembly Algorithms Laboratory St. Petersburg National Research University of Information Technologies, Mechanics and Optics Kazan, 23 Nov 2012
17
Embed
Combining de Bruijn graph, overlap graph and microassembly for de novo genome assembly
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Combining de Bruijn graph, overlap graph and
microassembly for de novo genome assembly
A. Alexandrov, S. Kazakov, S. Melnikov, A. Sergushichev, P. Fedotov, F. Tsarev,
A. Shalyto
Genome Assembly Algorithms Laboratory
St. Petersburg National Research University of Information Technologies, Mechanics and Optics
Kazan, 23 Nov 2012
22
Algorithm
Error correction
Quasi-contig
assembly
Initial contig
assembly
Contig micro-
assembly
De Bruijn graph
Overlap graph
Scaffolding
33
Error correction
• K-mers – substrings of length k.• “Trusted” and “untrusted” k-mers.• Replace “untrusted” k-mers with the
“trusted” ones.• If all the k-mers don’t fit into memory.
• Divide them into buckets.• Process the buckets independently.
44
Quasicontig assembly
??? GTCCATGC
ATGCATGCAGTG GTCCATGC
55
De Bruijn graph
De Bruijn graph for a set of strings S:
● V =
6
De Bruijn graph example (1)
7
De Bruijn graph example (2)
AGT GTG
GTC TCA CAT ATC TCC
CCA
CAA
AACACA
CAC
CAGAGGGGAGAG
88
Quasicontig assembly
• Build the de Bruijn graph.
• For each pair of reads (r1, r2) find the path between the first k-mer of r1 and the last k-mer of r2.
• The path has to be of appropriate length.
• The path has to be unique.
9
De Bruijn graph example (3)
10
De Bruijn graph example (4)
Unique paths correspond to quasicontigs
1212
Initial contig assembly
• Overlap– Suffix array– Inexact overlaps
• Layout– Overlap graph
• Consensus
13
Contig microassembly
• There are paired reads that map to different contigs.
• There are pairs of reads, one of which maps to one of the contigs and the other one maps to the gap between the contigs.
14
Contig microassembly algorithm
• Use Bowtie to find the positions of reads in contigs.
• Find all the pairs of contigs connected by many reads.
• Build the de Bruijn graph using the reads that map to at least one of the chosen contigs.
• Use the quasicontig assembly algorithm to fill the gap.