<?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/34685?offset=130</link>
	<atom:link href="https://bioinformaticsonline.com/related/34685?offset=130" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31137/finishersc-a-repeat-aware-and-scalable-tool-for-upgrading-de-novo-assembly-using-long-reads</guid>
	<pubDate>Mon, 27 Feb 2017 09:49:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31137/finishersc-a-repeat-aware-and-scalable-tool-for-upgrading-de-novo-assembly-using-long-reads</link>
	<title><![CDATA[FinisherSC: a repeat-aware and scalable tool for upgrading de novo assembly using long reads]]></title>
	<description><![CDATA[<p><span>FinisherSC, a repeat-aware and scalable tool for upgrading&nbsp;</span><em>de novo</em><span>&nbsp;assembly using long reads. Experiments with real data suggest that FinisherSC can provide longer and higher quality contigs than existing tools while maintaining high concordance.</span></p><p>Address of the bookmark: <a href="http://kakitone.github.io/finishingTool/" rel="nofollow">http://kakitone.github.io/finishingTool/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</guid>
	<pubDate>Fri, 03 Mar 2017 09:57:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31300/clgenomics</link>
	<title><![CDATA[CLgenomics]]></title>
	<description><![CDATA[<p>CLgenomics is a standalone desktop software specifically designed for bacterial genome analysis. This program has a powerful multi-genome browser, which enables rapid and responsive exploration of bacterial genomes.</p>
<p>To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics).&nbsp;Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers &gt;40,000 CLG files of publicly available Bacterial and Archaeal genomes.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/clgenomics-software/" rel="nofollow">https://chunlab.wordpress.com/clgenomics-software/</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</guid>
	<pubDate>Tue, 07 Mar 2017 08:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</link>
	<title><![CDATA[PhenoGram]]></title>
	<description><![CDATA[<p><span>With PhenoGram researchers can create chomosomal ideograms annotated with lines in color at specific base-pair locations, or colored base-pair to base-pair regions, with or without other annotation. PhenoGram allows for annotation of chromosomal locations and/or regions with shapes in different colors, gene identifiers, or other text. PhenoGram also allows for creation of plots showing expanded chromosomal locations, providing a way to show results for specific chromosomal regions in greater detail.</span></p><p>Address of the bookmark: <a href="http://ritchielab.psu.edu/software/phenogram-downloads" rel="nofollow">http://ritchielab.psu.edu/software/phenogram-downloads</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31552/multigenome-assembly</guid>
	<pubDate>Tue, 14 Mar 2017 04:41:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31552/multigenome-assembly</link>
	<title><![CDATA[Multigenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</p>
<p>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p>
<p>See the associated&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">online guide</a>&nbsp;for detailed information.</p>
<p>https://github.com/MadsAlbertsen/multi-metagenome</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32713/salzberg-lab</guid>
  <pubDate>Mon, 15 May 2017 05:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Salzberg lab]]></title>
  <description><![CDATA[
<p>We are a computational biology lab that develops novel methods for analysis of DNA and RNA sequences. Our research includes software for aligning and assembling RNA-seq data, whole-genome assembly, and microbiome analysis. We work closely with biomedical scientists to apply these methods to current problems arising in a broad spectrum of biological and medical research areas. We’re also part of the Center for Computational Biology, a group of 20+ faculty members and their labs at Johns Hopkins working on computational, statistical, and mathematical methods that can turn massive genomic data sets into biologically and clinically useful information.</p>

<p>https://salzberg-lab.org/</p>
]]></description>
</item>
<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/36880/jvarkit-java-utilities-for-bioinformatics</guid>
	<pubDate>Fri, 08 Jun 2018 09:31:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36880/jvarkit-java-utilities-for-bioinformatics</link>
	<title><![CDATA[Jvarkit : Java utilities for Bioinformatics]]></title>
	<description><![CDATA[Collection of Java tool kits for bioinformatics works:

Jvarkit : Java utilities for Bioinformatics<p>Address of the bookmark: <a href="http://lindenb.github.io/jvarkit/" rel="nofollow">http://lindenb.github.io/jvarkit/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>