# De Bruijn Graph Assembly

### Overview

Questions:
• What are the factors that affect genome assembly?

• How does Genome assembly work?

Objectives:
• Perform an optimised Velvet assembly with the Velvet Optimiser

• Compare this assembly with those we did in the basic tutorial

• Perform an assembly using the SPAdes assembler.

Requirements:
Time estimation: 2 hours
Level: Introductory Introductory
Supporting Materials:
Last modification: Mar 12, 2021

# Optimised de Bruijn Graph assemblies using the Velvet Optimiser and SPAdes

In this activity, we will perform de novo assemblies of a short read set using the Velvet Optimiser and the SPAdes assemblers. We are using the Velvet Optimiser for illustrative purposes. For real assembly work, a more suitable assembler should be chosen - such as SPAdes.

The Velvet Optimiser is a script written by Simon Gladman to optimise the k-mer size and coverage cutoff parameters for Velvet. More information can be found here

SPAdes is a de novo genome assembler written by Pavel Pevzner’s group in St. Petersburg. More details on it can be found here

### Agenda

In this tutorial, we will deal with:

# Get the data

We will be using the same data that we used in the introductory tutorial, so if you have already completed that and have the data, skip this section.

### hands_on Hands-on: Getting the data

1. Create and name a new history for this tutorial.

### Tip: Creating a new history

Click the new-history icon at the top of the history panel.

If the new-history is missing:

1. Click on the galaxy-gear icon (History options) on the top of the history panel
2. Select the option Create New from the menu
2. Import the sequence read raw data (*.fastq) from Zenodo

https://zenodo.org/record/582600/files/mutant_R1.fastq
https://zenodo.org/record/582600/files/mutant_R2.fastq

• Open the Galaxy Upload Manager (galaxy-upload on the top-right of the tool panel)

• Select Paste/Fetch Data
• Paste the link into the text field

• Press Start

• Close the window
3. Rename the files galaxy-pencil

• The name of the files are the full URL, let’s make the names a little clearer
• Change the names to just the last part, Mutant_R1.fastq, Mutant_R2.fastq respectively

### Tip: Renaming a dataset

• Click on the galaxy-pencil pencil icon for the dataset to edit its attributes
• In the central panel, change the Name field
• Click the Save button

### question Questions

1. What are four key features of a FASTQ file?
2. What is the main difference between a FASTQ and a FASTA file?

# Assembly with the Velvet Optimiser

We will perform an assembly with the Velvet Optimiser, which automatically runs and optimises the output of the Velvet assembler (Zerbino and Birney 2008). It will automatically choose a suitable value for the k-mer size (k). It will then go on to optimise the coverage cutoff (cov_cutoff) which corrects for read errors. It will use the “n50” metric for optimising the k-mer size and the “total number of bases in contigs” for optimising the coverage cutoff.

### hands_on Hands-on: Assemble with the Velvet Optimiser

1. Velvet Optimiser tool: Optimise your assembly with the following parameters:
• “Start k-mer size”: 45
• “End k-mer size”: 73
• “Input file type”: Fastq
• “Single or paired end reads: Paired
• param-file “Select first set of reads: mutant_R1.fastq
• param-file “Select second set of reads: mutant_R2.fastq

Your history will now contain a number of new files:

• Velvet optimiser contigs
• A fasta file of the final assembled contigs
• Velvet optimiser contig stats
• A table of the lengths (in k-mer length) and coverages (k-mer coverages) for the final contigs.

Have a look at each file.

### hands_on Hands-on: Get contig statistics for Velvet Optimiser contigs

1. Fasta Statistics tool: Produce a summary of the velvet optimiser contigs:
• param-file “fasta or multifasta file”: Select your velvet optimiser contigs file
2. View the output

### question Questions

Compare the output we got here with the output of the simple assemblies obtained in the introductory tutorial.

1. What are the main differences between them?
2. Which has a higher “n50”? What does this mean?

Tables of results from (a) Simple assembly and (b) optimised assembly.

(a)

(b)

### details Details: Further reading on assembly with Velvet

• Heuristic Resolution of Repeats and Scaffolding in the Velvet Short-Read de Novo Assembler (Zerbino et al. 2009)

## Visualisation of the Assembly

Now that we’ve assembled the genomes, let’s visualise this assembly using Bandage (Wick et al. 2015). This tool will let us better understand how the assembly graph really looks, and can give us a feeling for if the genome was well assembled or not.

Currently VelvetOptimiser does not include the LastGraph output, so we will manually run velveth and velvetg with the optimised parameters.

### hands_on Hands-on: Manually running velvetg/h

1. Locate the output called “VelvetOptimiser: Contigs” in your history

2. Click the (i) information icon

3. Check the tool stderr in the information page for the optimised k-mer value

### question Question

What was the optimal k-mer value? (referred to as “hash” in the stderr log)

### solution Solution

55

With this information in hand, let’s run velvet:

### hands_on Hands-on: Manually running velvetg/h

1. velveth tool: Prepare a dataset for the Velvet velvetg Assembler
• “Hash length”: 55
• “Insert Input Files”:
• 1: Input Files
• “file format”: fastq
• “read type”: shortPaired reads
• “Dataset”: mutant_R1.fastq
• “Insert Input Files”:
• 2: Input Files
• “file format”: fastq
• “read type”: shortPaired reads
• “Dataset”: mutant_R2.fastq
2. velvetg tool: Velvet sequence assembler for very short reads
• “Velvet dataset”: output from velveth tool
• “Generate velvet LastGraph file”: Yes
• “Coverage cutoff”: Specify Cutoff Value
• “Remove nodes with coverage below”: 1.44
• “Using Paired Reads: Yes

The LastGraph contains a detailed representation of the De Bruijn graph, which can give us an idea how velvet has assembled the genome and potentially resolved any conflicts.

### hands_on Hands-on: Bandage

1. Bandage Image tool: visualize de novo assembly graphs
• “Graphical Fragment Assembly”: The “LastGraph” output of velvetg tool
• “Produce jpg, png or svg file?”: .svg
2. Execute
3. View the output file

And now you should be able to see the graph that velvet produced:

## Interpreting Bandage Graphs

k-mer size has a significant effect on the assembly. You can play around with various k-mers to see this effect in practice.

k-mer graph
21
33
53
77

The next thing to be aware of is that there can be multiple valid interpretations of a graph, all equally valid in absence of other data. The following is taken verbatim from Bandage’s wiki:

For a simple case, imagine a bacterial genome that contains a single repeated element in two separate places in the chromosome:

A researcher (who does not yet know the structure of the genome) sequences it, and the resulting 100 bp reads are assembled with a de novo assembler:

Because the repeated element is longer than the sequencing reads, the assembler was not able to reproduce the original genome as a single contig. Rather, three contigs are produced: one for the repeated sequence (even though it occurs twice) and one for each sequence between the repeated elements.

Given only the contigs, the relationship between these sequences is not clear. However, the assembly graph contains additional information which is made apparent in Bandage:

There are two principal underlying sequences compatible with this graph: two separate circular sequences that share a region in common, or a single larger circular sequence with an element that occurs twice:

Additional knowledge, such as information on the approximate size of the bacterial chromosome, can help the researcher to rule out the first alternative. In this way, Bandage has assisted in turning a fragmented assembly of three contigs into a completed genome of one sequence.

We will now perform an assembly with the much more modern SPAdes assembler (Bankevich et al. 2012). It goes through a similar process to Velvet in the fact that it uses and simplifies de Bruijn graphs but it uses multiple values for k-mer size and combines the resultant graphs. This combination produces very good assemblies. When using SPAdes it is typical to choose at least 3 k-mer sizes. One low, one medium and one high. We will use 33, 55 and 91.

### hands_on Hands-on: Assemble with SPAdes

• “Run only assembly”: yes
• “K-mers to use separated by commas”: 33,55,91 [note: no spaces!]
• “Coverage cutoff”: auto
• param-file “Files -> forward reads: mutant_R1.fastq
• param-file “Files -> reverse reads: mutant_R2.fastq
• “Output final assembly graph with scaffolds?”: Yes

You will now have 5 new files in your history:

• two Fasta files, one for contigs and one for scaffolds
• two statistics files, one for contigs and one for scaffolds

Examine each file, especially the stats files.

### question Questions

1. Why would one of the contigs have much higher coverage than the others?
2. What could this represent?

### hands_on Hands-on: Visualize assembly with Bandage

1. Bandage tool with the following parameters:
• “Graphical Fragment Assembly”: assembly graph with scaffolds output from SPAdes tool
2. Examine the output image galaxy-eye

The visualized assembly should look something like this:

### question Questions

Which assembly looks better to you? Why?

### hands_on Hands-on: Get contig statistics for SPAdes contigs

1. Fasta Statistics tool: Produce a summary of the SPAdes contigs:
• param-file “fasta or multifasta file”: Select your velvet optimiser contigs file
2. Look at the output file.

### question Questions

Compare the output we got here with the output of the simple assemblies obtained in the introductory tutorial.

1. What are the main differences between them?
2. Did SPAdes produce a better assembly than the Velvet Optimiser?

### Key points

• We learned about how the choice of k-mer size will affect assembly outcomes

• We learned about the strategies that assemblers use to make reference genomes

• We performed a number of assemblies with Velvet and SPAdes.

• You should use SPAdes or another more modern assembler than Velvet for actual assemblies now.

Have questions about this tutorial? Check out the tutorial FAQ page or the FAQ page for the Assembly topic to see if your question is listed there. If not, please ask your question on the GTN Gitter Channel or the Galaxy Help Forum

# References

1. Zerbino, D. R., and E. Birney, 2008 Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Research 18: 821–829. 10.1101/gr.074492.107
2. Zerbino, D. R., G. K. McEwen, E. H. Margulies, and E. Birney, 2009 Pebble and Rock Band: Heuristic Resolution of Repeats and Scaffolding in the Velvet Short-Read de Novo Assembler (S. L. Salzberg, Ed.). PLoS ONE 4: e8407. 10.1371/journal.pone.0008407
3. Bankevich, A., S. Nurk, D. Antipov, A. A. Gurevich, M. Dvorkin et al., 2012 SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing. Journal of Computational Biology 19: 455–477. 10.1089/cmb.2012.0021
4. Wick, R. R., M. B. Schultz, J. Zobel, and K. E. Holt, 2015 Bandage: interactive visualization ofde novogenome assemblies: Fig. 1. Bioinformatics 31: 3350–3352. 10.1093/bioinformatics/btv383

# Feedback

Did you use this material as an instructor? Feel free to give us feedback on how it went.
Did you use this material as a learner or student? Click the form below to leave feedback.

# Citing this Tutorial

1. Simon Gladman, Helena Rasche, Saskia Hiltemann, 2021 De Bruijn Graph Assembly (Galaxy Training Materials). https://training.galaxyproject.org/archive/2022-04-01/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.html Online; accessed TODAY
2. Batut et al., 2018 Community-Driven Data Analysis Training for Biology Cell Systems 10.1016/j.cels.2018.05.012

### details BibTeX

@misc{assembly-debruijn-graph-assembly,
title = "De Bruijn Graph Assembly (Galaxy Training Materials)",
year = "2021",
month = "03",
day = "12"
url = "\url{https://training.galaxyproject.org/archive/2022-04-01/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.html}",
note = "[Online; accessed TODAY]"
}
@article{Batut_2018,
doi = {10.1016/j.cels.2018.05.012},
url = {https://doi.org/10.1016%2Fj.cels.2018.05.012},
year = 2018,
month = {jun},
publisher = {Elsevier {BV}},
volume = {6},
number = {6},
pages = {752--758.e1},
author = {B{\'{e}}r{\'{e}}nice Batut and Saskia Hiltemann and Andrea Bagnacani and Dannon Baker and Vivek Bhardwaj and Clemens Blank and Anthony Bretaudeau and Loraine Brillet-Gu{\'{e}}guen and Martin {\v{C}}ech and John Chilton and Dave Clements and Olivia Doppelt-Azeroual and Anika Erxleben and Mallory Ann Freeberg and Simon Gladman and Youri Hoogstrate and Hans-Rudolf Hotz and Torsten Houwaart and Pratik Jagtap and Delphine Larivi{\{e}}re and Gildas Le Corguill{\'{e}} and Thomas Manke and Fabien Mareuil and Fidel Ram{\'{\i}}rez and Devon Ryan and Florian Christoph Sigloch and Nicola Soranzo and Joachim Wolff and Pavankumar Videm and Markus Wolfien and Aisanjiang Wubuli and Dilmurat Yusuf and James Taylor and Rolf Backofen and Anton Nekrutenko and Björn Grüning},
title = {Community-Driven Data Analysis Training for Biology},
journal = {Cell Systems}
}
`