<?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/34328?offset=280</link>
	<atom:link href="https://bioinformaticsonline.com/related/34328?offset=280" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</guid>
	<pubDate>Wed, 14 Feb 2018 02:49:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</link>
	<title><![CDATA[MeDuSa: a multi-draft based scaffolder]]></title>
	<description><![CDATA[<p><span>MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/combogenomics/medusa" rel="nofollow">https://github.com/combogenomics/medusa</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36239/scilifelab-tutorial-for-bioinformatics-analysis</guid>
	<pubDate>Tue, 17 Apr 2018 04:33:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36239/scilifelab-tutorial-for-bioinformatics-analysis</link>
	<title><![CDATA[SciLifeLab tutorial for bioinformatics analysis !]]></title>
	<description><![CDATA[<p>SciLifeLab is a national center for molecular biosciences with focus on health and environmental research.</p>
<h2 id="courses">Courses</h2>
<p><a href="http://uppnex.se/twiki/bin/view/Courses/">Old courses (2012-2014)</a></p>
<h3 id="metagenomics-workshop">Metagenomics Workshop</h3>
<p><a href="https://scilifelab.github.io/courses/Metagenomics/1511/">2015 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/Metagenomics/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/Metagenomics/1711/">2017 November - Uppsala</a></p>
<h3 id="introduction-to-bioinformatics-using-ngs-data">Introduction to Bioinformatics Using NGS Data</h3>
<p><a href="https://scilifelab.github.io/courses/ngsintro/1502/">2015 February - Uppsala</a>&nbsp;<br><a href="https://scilifelab.github.io/courses/ngsintro/1505/">2015 May - Gothenburg</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1509/">2015 September - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1511/">2015 November - Lund</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1601/">2016 January - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1604/">2016 April - Link&ouml;ping</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1609/">2016 September - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1611/">2016 November - Ume&aring;</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1701/">2017 January - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1705/">2017 May - Gothenburg</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1709/">2017 September - Lund</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1711/">2017 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/ngsintro/1802/">2018 February - Uppsala</a></p>
<h3 id="introduction-to-genome-annotation">Introduction to Genome Annotation</h3>
<p><a href="https://scilifelab.github.io/courses/annotation/2015/">2015 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2016/">2016 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2017/">2017 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/annotation/2018/">2018 May - Uppsala</a></p>
<h3 id="de-novo-genome-assembly">De Novo Genome Assembly</h3>
<p><a href="https://scilifelab.github.io/courses/assembly/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/assembly/2017-11-15/">2017 November - Uppsala</a></p>
<h3 id="rna-seq-course">RNA-seq course</h3>
<p><a href="https://scilifelab.github.io/courses/rnaseq/1510/">2015 October - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1604/">2016 April - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1610/">2016 October - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1703/">2017 March - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/1711/">2017 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/rnaseq/labs">RNAseq tutorials</a></p>
<h3 id="r-programming-foundations-for-life-scientists">R Programming Foundations for Life Scientists</h3>
<p><a href="https://scilifelab.github.io/courses/r_programming/1611/">2016 November - Uppsala</a><br><a href="https://scilifelab.github.io/courses/r_programming/1703/">2017 Mars - Uppsala</a></p>
<h3 id="single-cell-rna-sequencing-analysis">Single cell RNA sequencing analysis</h3>
<p><a href="https://scilifelab.github.io/courses/scrnaseq/1710/">2017 October - Uppsala</a></p><p>Address of the bookmark: <a href="https://scilifelab.github.io/courses/" rel="nofollow">https://scilifelab.github.io/courses/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</guid>
	<pubDate>Mon, 11 Jun 2018 05:43:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</link>
	<title><![CDATA[GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments]]></title>
	<description><![CDATA[GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap closure. We demonstrate with sequencing data from various organisms that the gap-closing accuracy of GMcloser is 3–100-fold higher than those of other available tools, with similar efficiency.

https://academic.oup.com/bioinformatics/article/31/23/3733/209212<p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/23/3733/209212" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/23/3733/209212</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/37581/comparativegenomics-exercise2</guid>
	<pubDate>Wed, 22 Aug 2018 22:10:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/37581/comparativegenomics-exercise2</link>
	<title><![CDATA[ComparativeGenomics Exercise2]]></title>
	<description><![CDATA[<p>COMPARATIVE MICROBIAL GENOMICS ANALYSIS WORKSHOP&nbsp; @&nbsp;cbs.dtu.dk</p><p>Free Bioinformatics workbench https://www.mn.uio.no/ifi/english/research/networks/clsi/earlier_seminars/2012/tammivesth_osloseminarfinal.pdf</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/37581" length="139956" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</guid>
	<pubDate>Tue, 30 Oct 2018 10:46:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38039/vgsc-a-web-based-vector-graph-toolkit-of-genome-synteny-and-collinearity</link>
	<title><![CDATA[VGSC: A Web-Based Vector Graph Toolkit of Genome Synteny and Collinearity]]></title>
	<description><![CDATA[<p><span>VGSC, the Vector Graph toolkit of genome Synteny and Collinearity, and its online service, to visualize the synteny and collinearity in the common graphical format, including both raster (JPEG, Bitmap, and PNG) and vector graphic (SVG, EPS, and PDF).</span><em>&nbsp;</em></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/38418/charles-swanton-lab</guid>
  <pubDate>Tue, 11 Dec 2018 08:09:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[CHARLES SWANTON LAB]]></title>
  <description><![CDATA[
<p>They are using the latest DNA sequencing technology to read the genetic makeup of cancer cells within tumours in ever greater detail, teasing out patterns of evolution (evolutionary rule books), cancer heterogeneity and working out what changes have happened as a tumour evolves. We’re also investigating the processes that cause mutations and accelerate tumour evolution and working out how they might be stopped. And we are running evolutionary clinical trials with immune and targeted therapies to bring the benefits of our work to patients as quickly as possible.</p>

<p>https://www.crick.ac.uk/research/labs/charles-swanton</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</guid>
	<pubDate>Wed, 17 Apr 2019 19:45:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39269/ragoo-fast-reference-guided-scaffolding-of-genome-assembly-contigs</link>
	<title><![CDATA[RaGOO: Fast Reference-Guided Scaffolding of Genome Assembly Contigs]]></title>
	<description><![CDATA[<p>Alonge M, Soyk S, Ramakrishnan S, Wang X, Goodwin S, Sedlazeck FJ, Lippman ZB, Schatz MC:&nbsp;<a href="https://www.biorxiv.org/content/early/2019/01/13/519637">Fast and accurate reference-guided scaffolding of draft genomes</a>.&nbsp;<em>bioRxiv</em>&nbsp;2019.</p>
<p>RaGOO is a tool for coalescing genome assembly contigs into pseudochromosomes via minimap2 alignments to a closely related reference genome. The focus of this tool is on practicality and therefore has the following features:</p>
<ol>
<li>Good performance. On a MacBook Pro using Arabidopsis data, pseudochromosome construction takes less than a minute and the whole pipeline with SV calling takes ~2 minutes.</li>
<li>Intact ordering and orienting of contigs.</li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Breaking-Chimeric-Contigs">Chimeric contig correction</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/GFF-File-Lift-Over">GFF lift-over</a></li>
<li><a href="https://github.com/malonge/RaGOO/wiki/Calling-Structural-Variants">Structural variant calling with and integrated version of Assemblytics</a></li>
<li>Confidence scores associated with the grouping, localization, and orientation for each contig.</li>
</ol><p>Address of the bookmark: <a href="https://github.com/malonge/RaGOO" rel="nofollow">https://github.com/malonge/RaGOO</a></p>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40549/mgse-mapping-based-genome-size-estimation</guid>
	<pubDate>Fri, 17 Jan 2020 02:11:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40549/mgse-mapping-based-genome-size-estimation</link>
	<title><![CDATA[MGSE: Mapping-based Genome Size Estimation]]></title>
	<description><![CDATA[<p>MGSE can harness the power of files generated in genome sequencing projects to predict the genome size. Required are the FASTA file containing a high continuity assembly and a BAM file with all available reads mapped to this assembly. The script construct_cov_file.py (https://doi.org/10.1186/s12864-018-5360-z) allows the generation of a COV file based on the (sorted) BAM file (also possible via MGSE directly). Next, this COV file can be used by MGSE to calculate the coverage in provided reference regions and to calculate the total number of mapped bases. Both values are subjected to the genome size estimation. Providing accurate reference regions is crucial for this genome size estimation.</p><p>Address of the bookmark: <a href="https://github.com/bpucker/MGSE" rel="nofollow">https://github.com/bpucker/MGSE</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41330/u-plot-genome-u-plot-sample-implementation</guid>
	<pubDate>Tue, 03 Mar 2020 01:39:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41330/u-plot-genome-u-plot-sample-implementation</link>
	<title><![CDATA[U-Plot: Genome U-Plot sample implementation]]></title>
	<description><![CDATA[<p>The Genome U-Plot is a JavaScript tool to visualize Chromosomal abnormalities in the Human Genome using a U-shape layout.</p>
<p><img src="https://raw.githubusercontent.com/gaitat/GenomeUPlot/master/public/data/LNCAP.png" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="https://github.com/gaitat/GenomeUPlot" rel="nofollow">https://github.com/gaitat/GenomeUPlot</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>