<?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/19631?offset=150</link>
	<atom:link href="https://bioinformaticsonline.com/related/19631?offset=150" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30214/megamerge-a-tool-to-merge-assembled-contigs-long-reads-from-metagenomic-sequencing-runs</guid>
	<pubDate>Mon, 19 Dec 2016 09:42:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30214/megamerge-a-tool-to-merge-assembled-contigs-long-reads-from-metagenomic-sequencing-runs</link>
	<title><![CDATA[MeGAMerge: A tool to merge assembled contigs, long reads from metagenomic sequencing runs]]></title>
	<description><![CDATA[<p>MeGAMerge</p>
<p>MeGAMerge (A tool to merge assembled contigs, long reads from metagenomic sequencing runs)</p>
<p>Description</p>
<p>MeGAMerge is a perl based wrapper/tool that can accept any number of sequence (FASTA) files containing assembled contigs of any length in Multi-FASTA format to produce an improved contig set based on OLC based assembly. All overlap parameters (Minimum Overlap Length, Identity, etc) are user-declarable at runtime. It is written to run on Linux.</p>
<p>Requirements:</p>
<p>You will need to have the following tools installed and in $PATH, or added to $binpath in the tool:</p>
<p>Newbler (specifically runAssembly)<br>Minimus2 (part of AMOS, also requires MUMmer)</p><p>Address of the bookmark: <a href="https://github.com/LANL-Bioinformatics/MeGAMerge" rel="nofollow">https://github.com/LANL-Bioinformatics/MeGAMerge</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/30364/bioinformatics-contest-2017</guid>
	<pubDate>Fri, 23 Dec 2016 14:03:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/30364/bioinformatics-contest-2017</link>
	<title><![CDATA[Bioinformatics Contest 2017!]]></title>
	<description><![CDATA[<p><a href="http://contest.bioinf.me" target="_blank">Bioinformatics Contest 2017</a>! Rosalind is co-organizer.<br /> Compete with thousands of people worldwide on bioinformatics problem solving.<br /> Everything is online. Qualification round starts on <strong>January 23, 2017</strong>. Final is on <span><span>Feb 18</span></span>.</p><p>You will need to solve bioinformatics problems using programming. The goal is to correctly solve as many problems as possible within 24 hours. Some of them will be approximation problems and will have partial grades. All rounds will be held online, submissions will be auto-graded in real time.</p><p>Check more at http://contest.bioinf.me/</p><p>Good luck!</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30538/gkno</guid>
	<pubDate>Tue, 17 Jan 2017 03:35:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30538/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>More at&nbsp;http://gkno.me/</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</guid>
	<pubDate>Fri, 17 Feb 2017 09:06:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</link>
	<title><![CDATA[J-Circos]]></title>
	<description><![CDATA[<p>Circos plot tool (J-Circos) that is an interactive visualization tool that can plot Circos figures, as well as being able to dynamically add data to the figure, and providing information for specific data points using mouse hover display and zoom in/out functions. J-Circos uses the Java computer language to enable it to be used on most operating systems (Windows, MacOS, Linux). Users can input data into J-Circos using flat data formats, as well as from the GUI. J-Circos will enable biologists to better study more complex chromosomal interactions and fusion transcripts that are otherwise difficult to visualize from next-generation sequencing data.</p><p>Address of the bookmark: <a href="http://www.australianprostatecentre.org/research/software/jcircos" rel="nofollow">http://www.australianprostatecentre.org/research/software/jcircos</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</guid>
	<pubDate>Fri, 03 Mar 2017 08:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</link>
	<title><![CDATA[MyCC: Accurate binning of metagenomic contigs via automated clustering sequences using information of genomic signatures and marker genes]]></title>
	<description><![CDATA[<p><span>MyCC, an automated binning tool that combines genomic signatures, marker genes and optional contig coverages within one or multiple samples, in order to visualize the metagenomes and to identify the reconstructed genomic fragments.</span></p>
<p><span>More at&nbsp;http://www.nature.com/articles/srep24175</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/sb2nhri/files/MyCC/" rel="nofollow">https://sourceforge.net/projects/sb2nhri/files/MyCC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</guid>
	<pubDate>Mon, 06 Mar 2017 03:49:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31345/prokka-tool-for-the-rapid-annotation-of-prokaryotic-genomes</link>
	<title><![CDATA[Prokka: tool for the rapid annotation of prokaryotic genomes]]></title>
	<description><![CDATA[<p>Prokka is a software tool for the rapid annotation of prokaryotic genomes. A typical 4 Mbp genome can be fully annotated in less than 10 minutes on a quad-core computer, and scales well to 32 core SMP systems. It produces GFF3, GBK and SQN files that are ready for editing in Sequin and ultimately submitted to Genbank/DDJB/ENA.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.vicbioinformatics.com/software.prokka.shtml" rel="nofollow">http://www.vicbioinformatics.com/software.prokka.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</guid>
	<pubDate>Tue, 07 Mar 2017 08:50:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</link>
	<title><![CDATA[COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)]]></title>
	<description><![CDATA[<p>COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.</p>
<p>News: Python version of COCACOLA is available now!</p><p>Address of the bookmark: <a href="https://github.com/younglululu/COCACOLA" rel="nofollow">https://github.com/younglululu/COCACOLA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/25993/hoffman-lab</guid>
  <pubDate>Tue, 12 Jan 2016 02:47:41 -0600</pubDate>
  <link></link>
  <title><![CDATA[Hoffman Lab]]></title>
  <description><![CDATA[
<p>They develop machine learning techniques to better understand chromatin biology. These models and algorithms transform high-dimensional functional genomics data into interpretable patterns and lead to new biological insight.</p>

<p>https://www.pmgenomics.ca/hoffmanlab/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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>

</channel>
</rss>