<?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/22053?offset=1160</link>
	<atom:link href="https://bioinformaticsonline.com/related/22053?offset=1160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</guid>
	<pubDate>Fri, 17 Feb 2017 16:13:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31024/dagchainer-computing-chains-of-syntenic-genes-in-complete-genomes</link>
	<title><![CDATA[DAGchainer: Computing Chains of Syntenic Genes in Complete Genomes]]></title>
	<description><![CDATA[<p>The DAGchainer software computes chains of syntenic genes found within complete genome sequences. As input, DAGchainer accepts a list of gene pairs with sequence homology along with their genome coordinates. Using a scoring function which accounts for the distance between neighboring genes on each DNA molecule and the BLAST E-value score between homologs, maximally scoring chains of ordered gene pairs are computed and reported. This algorithm can be used to mine large evolutionary conserved regions of genomes between two organisms. Alternatively, by examining colinear sets of homologous genes found within a single genome, segmental genome duplications can be revealed.</p>
<p>This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.</p><p>Address of the bookmark: <a href="http://dagchainer.sourceforge.net/" rel="nofollow">http://dagchainer.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</guid>
	<pubDate>Fri, 24 Feb 2017 04:55:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</link>
	<title><![CDATA[ConPADE: Genome Assembly Ploidy Estimation from Next-Generation Sequencing Data]]></title>
	<description><![CDATA[<p><span>ConPADE (Contig Ploidy and Allele Dosage Estimation), a probabilistic method that estimates the ploidy of any given contig/scaffold based on its allele proportions. In the process, they report findings regarding errors in sequencing. The method can be used for whole genome shotgun (WGS) sequencing data. They also show applicability of the method for variant calling and allele dosage estimation. Results for simulated and real datasets are discussed and provide evidence that ConPADE performs well as long as enough sequencing coverage is available, or the true contig ploidy is low.&nbsp;</span></p>
<p><span>https://github.com/microsoftgenomics</span></p><p>Address of the bookmark: <a href="https://github.com/microsoftgenomics" rel="nofollow">https://github.com/microsoftgenomics</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</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/31377/groopm-metagenomic-binning-toolset</guid>
	<pubDate>Tue, 07 Mar 2017 08:59:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31377/groopm-metagenomic-binning-toolset</link>
	<title><![CDATA[GroopM: Metagenomic binning toolset]]></title>
	<description><![CDATA[<p>GroopM is a metagenomic binning toolset. It leverages spatio-temoral<br>dynamics (differential coverage) to accurately (and almost automatically)<br>extract population genomes from multi-sample metagenomic datasets.</p>
<p>GroopM is largely parameter-free. Use: groopm -h for more info.</p>
<p>For installation and usage instructions see : http://ecogenomics.github.io/GroopM/</p><p>Address of the bookmark: <a href="https://github.com/ecogenomics/GroopM" rel="nofollow">https://github.com/ecogenomics/GroopM</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/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</guid>
	<pubDate>Sun, 02 Apr 2017 15:53:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</link>
	<title><![CDATA[TMAP - torrent mapping alignment program General Notes]]></title>
	<description><![CDATA[<p>TMAP - torrent mapping alignment program <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP#general-notes"></a>General Notes</p>
<p>TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.</p>
<ul>
<li>
<p>The latest TMAP is unsupported. To use a supported version, please see the TMAP version associated with a Torrent Suite release below.</p>
</li>
<li>
<p>Get the latest source code:</p>
<div>
<pre>git clone git://github.com/iontorrent/TMAP.git
 <span>cd</span> TMAP
 git submodule init
 git submodule update</pre>
</div>
</li>
</ul>
<p>https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</p><p>Address of the bookmark: <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP" rel="nofollow">https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/39262/biotechnology-eligibility-test-bet-answer-set</guid>
	<pubDate>Wed, 17 Apr 2019 04:57:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/39262/biotechnology-eligibility-test-bet-answer-set</link>
	<title><![CDATA[Biotechnology Eligibility Test (BET) Answer set !]]></title>
	<description><![CDATA[<p>DBT-BET JRF 2019 Exam was held successfully on 14th April 2019. Official Question Paper &amp; Answer key of&nbsp;DBT-BET 2019 Exam has been released.</p><p>The best part about the DBT-BET Exam is both the question paper &amp; answer key is released immediately after the exam so you get the upper hand here to check how well you did in the DBT-BET exam, how much you are going to score and if you can pass the Exam with good score. This helps you in planning your career ahead.</p><p>DBT Exam is held once in a year by Department of Biotechnology &ndash; Govt of India.&nbsp;Candidates willing to get DBT-Junior Research Fellowship &ndash; DBT JRF fellowship should take up the&nbsp; DBT-BET Exam, DBT &ndash; Biotechnology Eligibility Test (BET) 2020 to be held on somewhere in the month of April. Official Notification for DBT-BET 2020 will be released in Feb 2020.</p><p>Question at&nbsp;<a href="https://bioinformaticsonline.com/file/view/39260/biotechnology-eligibility-test-bet-question-paper">https://bioinformaticsonline.com/file/view/39260/biotechnology-eligibility-test-bet-question-paper</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/39262" length="88016" type="application/pdf" />
</item>

</channel>
</rss>