<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/40516?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/40516?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44722/step-by-step-guide-to-running-genome-assembly</guid>
	<pubDate>Fri, 13 Dec 2024 11:35:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44722/step-by-step-guide-to-running-genome-assembly</link>
	<title><![CDATA[Step-by-Step Guide to Running Genome Assembly]]></title>
	<description><![CDATA[<p>Genome assembly is a critical process in bioinformatics, enabling the reconstruction of an organism's genome from short DNA sequence reads. Whether you&rsquo;re working on a new microbial genome or a complex eukaryotic organism, this guide will walk you through the steps of genome assembly using state-of-the-art tools and best practices.</p><h4><strong>What is Genome Assembly?</strong></h4><p>Genome assembly involves piecing together short DNA sequence reads generated by sequencing platforms (e.g., Illumina, PacBio, Oxford Nanopore) into longer, contiguous sequences called contigs. This can be performed as:</p><ul>
<li><strong>De Novo Assembly</strong>: Without a reference genome.</li>
<li><strong>Reference-Guided Assembly</strong>: Using a reference genome to guide the assembly process.</li>
</ul><h4><strong>Step 1: Preparing Your Data</strong></h4><p>Before starting the assembly, ensure that your raw sequencing data is high quality.</p><ol>
<li>
<p><strong>Input Data</strong></p>
<ul>
<li><strong>Short Reads</strong>: Illumina sequencing generates short, accurate reads ideal for scaffolding.</li>
<li><strong>Long Reads</strong>: PacBio and Nanopore sequencing provide long reads for resolving repetitive regions.</li>
</ul>
</li>
<li>
<p><strong>Quality Control (QC)</strong><br />Use tools like <strong>FastQC</strong> or <strong>MultiQC</strong> to assess the quality of your reads:</p>
<div>
<div dir="ltr"><code>fastqc reads.fastq multiqc . </code></div>
</div>
<p>Look for issues like low-quality bases, adapter contamination, or overrepresented sequences.</p>
</li>
<li>
<p><strong>Read Trimming and Filtering</strong><br />Trim low-quality bases and adapters using <strong>Trimmomatic</strong> or <strong>Cutadapt</strong>:</p>
<div>
<div dir="ltr"><code>trimmomatic PE reads_R1.fastq reads_R2.fastq trimmed_R1.fastq trimmed_R2.fastq \ ILLUMINACLIP:adapters.fa:2:30:10 LEADING:3 TRAILING:3 SLIDINGWINDOW:4:20 MINLEN:36 </code></div>
</div>
</li>
</ol><h4><strong>Step 2: Choosing an Assembly Strategy</strong></h4><p>Select an assembly strategy based on your data type:</p><ul>
<li>
<p><strong>Short-Read Assemblers</strong>:</p>
<ul>
<li>SPAdes: Popular for microbial genomes.</li>
<li>Velvet: Fast for smaller genomes.</li>
</ul>
</li>
<li>
<p><strong>Long-Read Assemblers</strong>:</p>
<ul>
<li>Canu: Ideal for long-read datasets.</li>
<li>Flye: Versatile for small and large genomes.</li>
</ul>
</li>
<li>
<p><strong>Hybrid Assemblers</strong>:</p>
<ul>
<li>MaSuRCA: Combines short and long reads.</li>
<li>Unicycler: Optimized for bacterial genomes.</li>
</ul>
</li>
</ul><h4><strong>Step 3: Running the Assembly</strong></h4><h5><strong>3.1. SPAdes (Short-Read Assembly)</strong></h5><p>SPAdes is an excellent choice for small genomes, such as bacteria.</p><div><div dir="ltr"><code>spades.py -1 trimmed_R1.fastq -2 trimmed_R2.fastq -o spades_output </code></div></div><p>The output includes assembled contigs (<code>contigs.fasta</code>) and scaffolds (<code>scaffolds.fasta</code>).</p><h5><strong>3.2. Canu (Long-Read Assembly)</strong></h5><p>Canu is designed for high-error long reads from PacBio or Nanopore.</p><div><div dir="ltr"><code>canu -p genome -d canu_output genomeSize=4.7m -nanopore-raw reads.fastq </code></div></div><p>The output will be in <code>canu_output/genome.contigs.fasta</code>.</p><h5><strong>3.3. Hybrid Assembly with Unicycler</strong></h5><p>Unicycler combines short and long reads for improved assemblies.</p><div><div dir="ltr"><code>unicycler -1 trimmed_R1.fastq -2 trimmed_R2.fastq -l long_reads.fastq -o unicycler_output </code></div></div><h4><strong>Step 4: Assessing Assembly Quality</strong></h4><p>After assembly, evaluate its quality using the following tools:</p><ol>
<li>
<p><strong>QUAST</strong><br />QUAST generates assembly statistics, such as N50, genome size, and GC content:</p>
<div>
<div dir="ltr"><code>quast contigs.fasta -o quast_output </code></div>
</div>
</li>
<li>
<p><strong>BUSCO</strong><br />BUSCO checks genome completeness by identifying conserved genes:</p>
<div>
<div dir="ltr"><code>busco -i contigs.fasta -o busco_output -l fungi_odb10 -m genome </code></div>
</div>
</li>
<li>
<p><strong>Assembly Graph Visualization</strong><br />Visualize assembly graphs with <strong>Bandage</strong>:</p>
<div>
<div dir="ltr"><code>Bandage load assembly_graph.gfa </code></div>
</div>
</li>
</ol><hr><h4><strong>Step 5: Post-Assembly Steps</strong></h4><ol>
<li>
<p><strong>Polishing</strong><br />Improve assembly accuracy using tools like <strong>Pilon</strong> (for short reads) or <strong>Racon</strong> (for long reads).</p>
<div>
<div dir="ltr"><code>racon long_reads.fasta mapped_reads.sam contigs.fasta &gt; polished_contigs.fasta </code></div>
</div>
</li>
<li>
<p><strong>Scaffolding</strong><br />Link contigs into scaffolds using tools like <strong>SSPACE</strong> or <strong>Opera-LG</strong> if required.</p>
</li>
<li>
<p><strong>Annotation</strong><br />Annotate the assembled genome using <strong>Prokka</strong> for prokaryotes or <strong>Maker</strong> for eukaryotes.</p>
<div>
<div dir="ltr"><code>prokka --outdir annotation_output --prefix genome contigs.fasta </code></div>
</div>
</li>
</ol><h4><strong>Step 6: Sharing and Archiving</strong></h4><ol>
<li>
<p><strong>Submit to Public Repositories</strong><br />Share your assembly in databases like <strong>NCBI GenBank</strong>, <strong>ENA</strong>, or <strong>DDBJ</strong>.</p>
</li>
<li>
<p><strong>Metadata Preparation</strong><br />Include detailed metadata for your submission, such as organism name, sequencing platform, and coverage.</p>
</li>
</ol><h4><strong>Best Practices</strong></h4><ul>
<li>Always perform quality checks at each stage to ensure data integrity.</li>
<li>Use multiple tools to cross-validate results when working with complex genomes.</li>
<li>Document parameters and software versions for reproducibility.</li>
</ul><h4><strong>Conclusion</strong></h4><p>Genome assembly is a powerful process that transforms raw sequencing data into a coherent representation of an organism&rsquo;s genome. By following this step-by-step guide, you can successfully assemble genomes and uncover valuable biological insights. Whether you&rsquo;re assembling a microbial genome or tackling the complexities of a eukaryotic genome, these tools and strategies will set you on the path to success.</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37414/arc-pipeline-which-facilitates-iterative-reference-guided-de-novo-assemblies</guid>
	<pubDate>Thu, 26 Jul 2018 09:20:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37414/arc-pipeline-which-facilitates-iterative-reference-guided-de-novo-assemblies</link>
	<title><![CDATA[ARC: pipeline which facilitates iterative, reference guided de novo assemblies]]></title>
	<description><![CDATA[<p>ARC is a pipeline which facilitates iterative, reference guided&nbsp;<em>de novo</em>&nbsp;assemblies with the intent of:</p>
<ol>
<li>Reducing time in analysis and increasing accuracy of results by only considering those reads which should assemble together.</li>
<li>Reducing/removing reference bias as compared to mapping based approaches.</li>
</ol>
<p><span>The software is designed to work in situations where a whole-genome assembly is not the objective, but rather when the researcher wishes to assemble discreet 'targets' contained within next-generation shotgun sequence data. ARC decomplexifies the traditionally difficult problem of assembly by breaking the reads into small, manageable subsets which can then be assembled quickly and efficiently in parallel. Applications include those in which the researcher wishes to&nbsp;</span><em>de novo</em><span>&nbsp;assemble specific content and a set of semi-similar reference targets is available to initialize the assembly process.</span></p>
<p>https://ibest.github.io/ARC/</p><p>Address of the bookmark: <a href="https://ibest.github.io/ARC/" rel="nofollow">https://ibest.github.io/ARC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39830/the-extensive-de-novo-te-annotator-edta</guid>
	<pubDate>Thu, 08 Aug 2019 04:05:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39830/the-extensive-de-novo-te-annotator-edta</link>
	<title><![CDATA[The Extensive de novo TE Annotator (EDTA)]]></title>
	<description><![CDATA[<p><span>The EDTA package was designed to filter out false discoveries in raw TE candidates and generate a high-quality non-redundant TE library for whole-genome TE annotations. Selection of initial search programs were based on benckmarkings on the annotation performance using a manually curated TE library in the rice genome.</span></p><p>Address of the bookmark: <a href="https://github.com/oushujun/EDTA" rel="nofollow">https://github.com/oushujun/EDTA</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</guid>
	<pubDate>Thu, 02 Aug 2018 07:39:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37473/lsc-a-long-read-error-correction-tool</link>
	<title><![CDATA[LSC :a long read error correction tool]]></title>
	<description><![CDATA[<h2>Getting Started</h2>
<p>These simple steps will help you integrate LSC into your transcriptomics analysis pipeline.</p>
<ul>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_requirements.asp">LSC_requirements</a>&nbsp;for running LSC.</li>
<li><a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_download.asp">Download</a>&nbsp;and set-up the LSC package.</li>
<li>Follow the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_tutorial.asp">tutorial</a>&nbsp;to see how LSC works on some example data.</li>
<li>Read the&nbsp;<a href="https://www.healthcare.uiowa.edu/labs/au/LSC/LSC_manual.asp">manual</a>&nbsp;if anything is unclear.</li>
<li>You're ready, Happy LSCing!</li>
</ul>
<h2>Latest publication</h2>
<p><span>Kin Fai Au, Jason Underwood, Lawrence Lee and Wing Hung Wong&nbsp;</span><br><strong>Improving PacBio Long Read Accuracy by Short Read Alignment&nbsp;</strong><span>[</span><a href="http://journals.plos.org/plosone/article?id=10.1371%2Fjournal.pone.0046679">Manuscript</a><span>]&nbsp;</span><br><em>PLoS ONE</em><span>&nbsp;2012. 7(10): e46679. doi:10.1371/journal.pone.0046679</span></p><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</guid>
	<pubDate>Fri, 05 Jan 2018 04:02:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35057/ectools-long-read-correction-and-other-correction-tools</link>
	<title><![CDATA[ECTOOLS: Long Read Correction and other Correction tools]]></title>
	<description><![CDATA[<p>Long Read Correction and other Correction tools</p>
<p>This package is a loose collection of scripts. To run the correction<br>routine see the section below. Descriptions of the other scripts<br>are at the bottom of this file.</p>
<p>Contact: gurtowsk@cshl.edu</p>
<p>In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:<br>http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf</p><p>Address of the bookmark: <a href="https://github.com/jgurtowski/ectools" rel="nofollow">https://github.com/jgurtowski/ectools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</guid>
	<pubDate>Tue, 06 Mar 2018 16:35:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</link>
	<title><![CDATA[ARCS: scaffolding genome drafts with linked reads]]></title>
	<description><![CDATA[<p><span>ARCS, an application that utilizes the barcoding information contained in linked reads to further organize draft genomes into highly contiguous assemblies. We show how the contiguity of an ABySS&nbsp;</span><em>H.sapiens</em><span>genome assembly can be increased over six-fold, using moderate coverage (25-fold) Chromium data. We expect ARCS to have broad utility in harnessing the barcoding information contained in linked read data for connecting high-quality sequences in genome assembly drafts.</span></p><p>Address of the bookmark: <a href="https://github.com/bcgsc/ARCS/" rel="nofollow">https://github.com/bcgsc/ARCS/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</guid>
	<pubDate>Tue, 15 May 2018 08:59:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36630/frequent-paired-end-reads-pe-2x100-mapping-command-lines</link>
	<title><![CDATA[Frequent Paired-end reads (PE 2x100) mapping command lines]]></title>
	<description><![CDATA[
<p>bowtie2 -x hs37m -X 650 -q -1 r1.fq -2 r2.fq -S r12.bowtie2.sam  </p>

<p>bwa aln hs37m.fa r1.fq &gt; r1.sai &amp;&amp; bwa aln hs37m.fa r2.fq &gt; r2.sai \  <br />    &amp;&amp; bwa sampe hs37m r1.sai r2.sai r1.fq r2.fq &gt; r12.bwa.sam  </p>

<p>bwa bwasw ../index/bwa/hs37m.fa r12.fq &gt; r12.bwasw.sam  </p>

<p>gsnap -A sam -d hs37m r1.fq r2.fq &gt; r12.gsnap.sam  </p>

<p>novoalign -r Random -o SAM -f r1.fq r2.fq -i 500 50 -d hs37m-k14s3.novo &gt; r12.novo.sam  </p>

<p>smalt map -f samsoft -i 650 -o r12.smalt-k20s13.sam hs37m-k20s13 r1.fq r2.fq  </p>

<p>stampy.py -g hs37m -h hs37m -o r12.stampy.sam -M r1.fq,r2.fq  </p>

<p>soap -D hs37m.fa.index -a r1.fq -b r2.fq -l 32 -g 3 -u dummy -2 dummy -o r12.soap</p>
]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</guid>
	<pubDate>Thu, 24 May 2018 10:06:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36758/pbalign-maps-pacbio-reads-to-reference-sequences-and-saves-alignments-to-a-bam-file</link>
	<title><![CDATA[pbalign: maps PacBio reads to reference sequences and saves alignments to a BAM file]]></title>
	<description><![CDATA[pbalign aligns PacBio reads to reference sequences, filters aligned reads according to user-specific filtering criteria, and converts the output to either the SAM format or PacBio Compare HDF5 (e.g., .cmp.h5) format. The output Compare HDF5 file will be compatible with Quiver if --forQuiver option is specified.<p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/pbalign" rel="nofollow">https://github.com/PacificBiosciences/pbalign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>