From 1bfa3a962ad9c9fec14ff3ac51919ad4a55c3050 Mon Sep 17 00:00:00 2001 From: Helena Rasche Date: Thu, 23 Nov 2023 10:08:43 +0100 Subject: [PATCH] fix some links --- topics/assembly/tutorials/debruijn-graph-assembly/tutorial.md | 4 ++-- topics/contributing/tutorials/python/tutorial.md | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.md b/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.md index 4a06b3e5f8bbf5..75331556b1de34 100644 --- a/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.md +++ b/topics/assembly/tutorials/debruijn-graph-assembly/tutorial.md @@ -27,9 +27,9 @@ contributors: 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](https://github.com/slugger70/VelvetOptimiser) +The Velvet Optimiser is a script written by {% include _includes/contributor-badge.html id="slugger70" %} to optimise the k-mer size and coverage cutoff parameters for Velvet. More information can be found [in its repository](https://github.com/slugger70/VelvetOptimiser). -SPAdes is a de novo genome assembler written by Pavel Pevzner's group in St. Petersburg. More details on it can be found [here](http://cab.spbu.ru/software/spades/) +SPAdes is a de novo genome assembler written by Pavel Pevzner's group in St. Petersburg. More details on it can be found [on Spades' website](http://cab.spbu.ru/software/spades/)> diff --git a/topics/contributing/tutorials/python/tutorial.md b/topics/contributing/tutorials/python/tutorial.md index 4a7de8cdeb380d..9da942e19a1ac1 100644 --- a/topics/contributing/tutorials/python/tutorial.md +++ b/topics/contributing/tutorials/python/tutorial.md @@ -139,7 +139,7 @@ This was generated by [hexylena/auto-python](https://github.com/hexylena/auto-py When teaching programming one must constantly be cognisant of the student's cognitive load. It is a complicated task that demands a lot of students, requiring types of explicit logic analysis that they may not have engaged in before. Both learning based on problem-solving and worked examples may cause high cognitive loads for different audiences, and exploring alternatives is important ({% cite Retnowati_2017 %}). Faded examples such as what is seen below are exactly such an alternative, starting with a fully worked example and removing successive components until we reach a problem description requiring a full solution. This leads to fewer unproductive learning events ({% cite Renkl_2004 %}). ```python -# Write a function that multiplies two numbers +### Write a function that multiplies two numbers def multiply(a, b): c = a * b return c