<?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/26322?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/26322?offset=250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</guid>
	<pubDate>Wed, 29 Jun 2016 15:38:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</link>
	<title><![CDATA[SAM flags]]></title>
	<description><![CDATA[<p>Decoding SAM flags</p>
<p>This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.</p>
<p>To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.</p><p>Address of the bookmark: <a href="https://broadinstitute.github.io/picard/explain-flags.html" rel="nofollow">https://broadinstitute.github.io/picard/explain-flags.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</guid>
	<pubDate>Wed, 13 Jul 2016 07:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</link>
	<title><![CDATA[Scarpa]]></title>
	<description><![CDATA[<p><strong>Scarpa</strong>&nbsp;is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate insert size distributions from data. Scarpa is available free of charge for academic and commercial use under the GNU General Public License (GPL).</p>
<p>See the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/hapsembler-2.21_manual.pdf">user manual</a>&nbsp;or the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/scarpa_paper.pdf">paper</a>&nbsp;for more information about Scarpa. Click&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/ScarpaSupplementary.pdf">here</a>&nbsp;for the supplementary material.</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/scarpa.html" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/scarpa.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</guid>
	<pubDate>Tue, 06 Sep 2016 03:58:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</link>
	<title><![CDATA[Genome STRiP]]></title>
	<description><![CDATA[<p><strong>Genome STRiP</strong><span>&nbsp;(Genome STRucture In Populations) is a suite of tools for discovering and genotyping structural variations using sequencing data. The methods are designed to detect shared variation using data from multiple individuals.</span><br><br><span>Genome STRiP looks both across and within a set of sequenced genomes to detect variation. The methods are adaptive and support heterogeneous data sets, including variations in sequencing depth, read lengths and mixtures of paired and single-end reads. A minimum of 20 to 30 genomes are required to get acceptable results, but the method gains power across genomes and processing more genomes provide better results.</span><br><br><span>To run discovery or genotyping on a single sequenced genome or a small set of genomes, you need to call your data against a background population, such as a set of genomes from the 1000 Genomes Project.&nbsp; The background population does not need to be matched to the target individuals.</span></p><p>Address of the bookmark: <a href="http://software.broadinstitute.org/software/genomestrip/" rel="nofollow">http://software.broadinstitute.org/software/genomestrip/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28855/vcfr</guid>
	<pubDate>Fri, 19 Aug 2016 07:38:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28855/vcfr</link>
	<title><![CDATA[vcfR]]></title>
	<description><![CDATA[<p><span>Most variant calling pipelines result in files containing large quantities of variant information. The&nbsp;</span><a href="http://samtools.github.io/hts-specs/" title="VCF format at hts-specs">variant call format (vcf)</a><span>&nbsp;is an increasingly popular format for this data. The format of these files and their content is discussed in the vignette &lsquo;vcf data.&rsquo; These files are typically intended to be post-processed (i.e., filtered) as an attempt to remove false positives or otherwise problematic sites. The R package vcfR provides tools to facilitate this filtering as well as to visualize the effects of choices made during this process.</span></p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/vcfR/vignettes/visualization_1.html" rel="nofollow">https://cran.r-project.org/web/packages/vcfR/vignettes/visualization_1.html</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28915/useful-bioinformatics-tools</guid>
	<pubDate>Mon, 29 Aug 2016 04:08:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28915/useful-bioinformatics-tools</link>
	<title><![CDATA[Useful Bioinformatics Tools]]></title>
	<description><![CDATA[<p>Collections of few handy tools for bioinformatician</p>
<p>http://molbiol-tools.ca/Convert.htm</p><p>Address of the bookmark: <a href="http://molbiol-tools.ca/Convert.htm" rel="nofollow">http://molbiol-tools.ca/Convert.htm</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</guid>
	<pubDate>Wed, 07 Sep 2016 03:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</link>
	<title><![CDATA[Artemis Comparison Tool (ACT)]]></title>
	<description><![CDATA[<p><span>ACT is a Java application for displaying pairwise comparisons between two or more DNA sequences. It can be used to identify and analyse regions of similarity and difference between genomes and to explore conservation of synteny, in the context of the entire sequences and their annotation.&nbsp;It can read complete EMBL,&nbsp;GENBANK and GFF entries or sequences in FASTA or raw format.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act" rel="nofollow">http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</guid>
	<pubDate>Thu, 26 Jul 2018 04:51:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37409/nanopolis-polish-a-genome-assembly</link>
	<title><![CDATA[Nanopolis: polish a genome assembly]]></title>
	<description><![CDATA[<p><span>Software package for signal-level analysis of Oxford Nanopore sequencing data. Nanopolish can calculate an improved consensus sequence for a draft genome assembly, detect base modifications, call SNPs and indels with respect to a reference genome and more (see Nanopolish modules, below).</span></p>
<p>Quickstart</p>
<p>http://nanopolish.readthedocs.io/en/latest/quickstart_consensus.html</p>
<p>Algorithms</p>
<p>http://simpsonlab.github.io/2017/06/30/nanopolish-v0.7.0/</p><p>Address of the bookmark: <a href="https://github.com/jts/nanopolish" rel="nofollow">https://github.com/jts/nanopolish</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29112/sybil</guid>
	<pubDate>Wed, 07 Sep 2016 03:20:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29112/sybil</link>
	<title><![CDATA[Sybil]]></title>
	<description><![CDATA[<p><span>The Sybil software package provides a primarily web-based front-end to comparative genome datasets warehoused in a chado relational database. It was developed by the bioinformatics department at The Institute for Genomic Research (</span><a href="http://www.tigr.org/">TIGR</a><span>) and development continues at the J. Craig Venter Institute (</span><a href="http://jcvi.org/">JCVI</a><span>) and the Institute for Genome Sciences (</span><a href="http://igs.umaryland.edu/">IGS</a><span>) at the University of Maryland: Baltimore. Sybil has been used at TIGR/JCVI, IGS, NYU, New York Medical College, Novartis Vaccines and University of Maryland: College Park to support a number of research projects that involve comparative genome analysis. The following sections provide some high-level technical details about the overall architecture and external dependencies of the Sybil package.</span></p><p>Address of the bookmark: <a href="http://sybil.sourceforge.net/" rel="nofollow">http://sybil.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</guid>
	<pubDate>Mon, 07 Jan 2019 08:40:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/38618/canu-genome-assembly-parameters</link>
	<title><![CDATA[CANU genome assembly parameters !]]></title>
	<description><![CDATA[<p>Choose the appropriate parameters to run Canu and run it. The assembly will take about an hour. You can use two cores (parameter&nbsp;<code>-maxThreads=2</code>) and you would like to disable cluster option, since we compute on a single Amazon server set off the option to compute on cluster&nbsp;<code>useGrid=false</code>. This specifications should be for your project discussed with a local computing guru. The parameters that are in square brackets&nbsp;<code>[]</code>&nbsp;are optional, symbol&nbsp;<code>|</code>&nbsp;stands for "or".</p><pre><code>usage:   canu [-correct | -trim | -assemble | -trim-assemble] \
              [-s ] \
               -p  \
               -d  \
               genomeSize=[g|m|k] \
               -maxThreads=2 \
               useGrid=false \
              [other-options] \
               read_file.fastq.gz
</code></pre><p>A default&nbsp;<code>Canu</code>&nbsp;run produces usually high quality assembly, example of a command that was used for testing can be found below. However, there are still a lot of parameters that are possible to tweak. For example if we desire to assemble haplotypes separately of if we want to smash them together, we can alternate the error correction process.</p><pre><code>canu -p test_asmbl \
     -d asm_test3 \
     genomeSize=2m \
     -maxThreads=2 useGrid=false \
     -pacbio-raw \ ~/pacbio/dna/sample_reads.fastq.gz</code></pre><p>There is a brilliant&nbsp;<a href="http://canu.readthedocs.io/en/latest/faq.html#what-parameters-can-i-tweak">section in documentation</a>&nbsp;about parameter tweaking.</p><p>The output directory contains will contain many files. The most interesting ones are:</p><ul>
<li><code>*.correctedReads.fasta.gz</code>&nbsp;: file containing the input sequences after correction, trim and split based on consensus evidence.</li>
<li><code>*.trimmedReads.fastq</code>&nbsp;: file containing the sequences after correction and final trimming</li>
<li><code>*.layout</code>&nbsp;: file containing informations about read inclusion in the final assembly</li>
<li><code>*.gfa</code>&nbsp;: file containing the assembly graph by Canu</li>
<li><code>*.contigs.fasta</code>&nbsp;: file containing everything that could be assembled and is part of the primary assembly</li>
</ul><p>The basic stats of assembly can be read from reports generated by the assembler, or calculated using standard UNIX command line tools.</p><p>More at&nbsp;https://canu.readthedocs.io/en/latest/faq.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>