<?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/28119?</link>
	<atom:link href="https://bioinformaticsonline.com/related/28119?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27971/samtools-primer</guid>
	<pubDate>Thu, 23 Jun 2016 07:18:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27971/samtools-primer</link>
	<title><![CDATA[Samtools Primer !!]]></title>
	<description><![CDATA[<p>SAMtools: Primer / Tutorial by Ethan Cerami, Ph.D.<br><br>keywords: samtools, next-gen, next-generation, sequencing, bowtie, sam, bam, primer, tutorial, how-to, introduction<br>Revisions<br><br>&nbsp;&nbsp;&nbsp; 1.0: May 30, 2013: First public release on biobits.org.<br>&nbsp;&nbsp;&nbsp; 1.1: July 24, 2013: Updated with Disqus Comments / Feedback section.<br>&nbsp;&nbsp;&nbsp; 1.2: December 19, 2014: Multiple updates, including:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Updated to use samtools 1.1 and bcftools 1.2.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Updated usage for bcftools.<br><br>About<br><br>SAMtools is a popular open-source tool used in next-generation sequence analysis. This primer provides an introduction to SAMtools, and is geared towards those new to next-generation sequence analysis. The primer is also designed to be self-contained and hands-on, meaning that you only need to install SAMtools, and no other tools, and sample data sets are provided. Terms in bold are also explained in the glossary at the end of the document.</p><p>Address of the bookmark: <a href="http://biobits.org/samtools_primer.html" rel="nofollow">http://biobits.org/samtools_primer.html</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44720/a-beginners-guide-to-using-kraken-for-taxonomic-classification</guid>
	<pubDate>Fri, 13 Dec 2024 11:29:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44720/a-beginners-guide-to-using-kraken-for-taxonomic-classification</link>
	<title><![CDATA[A Beginner&#039;s Guide to Using Kraken for Taxonomic Classification]]></title>
	<description><![CDATA[<div>Kraken is a popular bioinformatics tool designed for fast and accurate taxonomic classification of metagenomic sequences. Its efficiency and precision make it a go-to resource for analyzing microbial communities, including bacteria, viruses, archaea, and fungi. Whether you're new to bioinformatics or experienced in the field, Kraken is an indispensable tool for taxonomic analysis.</div><div><div><div><div dir="auto"><div><div><p>In this blog, we&rsquo;ll walk through the basics of Kraken, from installation to running an analysis, and highlight its key features and applications.</p><h4><strong>What is Kraken?</strong></h4><p>Kraken is a sequence classification tool that assigns taxonomic labels to DNA sequences using exact k-mer matching. It uses a reference database of genomes, dividing sequences into k-mers and identifying matches in a computationally efficient way.</p><h4><strong>Key Features of Kraken</strong></h4><ul>
<li><strong>Speed</strong>: Kraken processes data much faster than alignment-based methods.</li>
<li><strong>Accuracy</strong>: It uses a precise k-mer matching algorithm for high-resolution taxonomic assignments.</li>
<li><strong>Scalability</strong>: It can handle large metagenomic datasets.</li>
<li><strong>Custom Databases</strong>: You can build and use custom databases tailored to your research needs.</li>
</ul><h4><strong>Installing Kraken</strong></h4><ol>
<li>
<p><strong>System Requirements</strong></p>
<ul>
<li>A Unix-based operating system (Linux/macOS).</li>
<li>Sufficient computational resources for database building (RAM and disk space).</li>
</ul>
</li>
<li>
<p><strong>Installation Steps</strong></p>
<ul>
<li>Clone the Kraken repository from GitHub:
<div>
<div>&nbsp;</div>
<div dir="ltr"><code>git <span style="font-size: 12.8px; font-weight: normal;">clone</span> https://github.com/DerrickWood/kraken.git <span style="font-size: 12.8px; font-weight: normal;">cd</span> kraken </code></div>
</div>
</li>
<li>Compile the Kraken binaries:
<div>
<div>&nbsp;</div>
<div dir="ltr"><code>make </code></div>
</div>
</li>
<li>Add Kraken to your PATH for easy access:
<div>
<div>&nbsp;</div>
<div dir="ltr"><code><span style="font-size: 12.8px; font-weight: normal;">export</span> PATH=<span style="font-size: 12.8px; font-weight: normal;">$PATH</span>:/path/to/kraken </code></div>
</div>
</li>
</ul>
</li>
</ol><h4><strong>Preparing a Database</strong></h4><p>Kraken requires a database of reference genomes. You can use a pre-built database or create a custom one.</p><ol>
<li>
<p><strong>Downloading a Pre-built Database</strong><br />Kraken offers pre-built databases, such as the <em>MiniKraken</em> database, which is lightweight and suitable for smaller datasets. Download it using:</p>
<div>
<div dir="ltr"><code>kraken-build --download-library minikraken </code></div>
</div>
</li>
<li>
<p><strong>Building a Custom Database</strong><br />To include specific genomes, download FASTA files and build the database:</p>
<div>
<div dir="ltr"><code>kraken-build --download-library bacteria --threads 4 --db my_database kraken-build --build --db my_database </code></div>
</div>
<p>This process may take considerable time and resources, depending on the size of the database.</p>
</li>
</ol><h4><strong>Running Kraken</strong></h4><p>Once the database is ready, you can classify sequences.</p><ol>
<li>
<p><strong>Basic Usage</strong><br />Use the following command to classify sequences:</p>
<div>
<div dir="ltr"><code>kraken --db my_database --threads 4 --fastq-input input_sequences.fastq --output kraken_output.txt </code></div>
</div>
<p>Key options:</p>
<ul>
<li><code>--db</code>: Specifies the database.</li>
<li><code>--threads</code>: Number of threads for parallel processing.</li>
<li><code>--fastq-input</code>: Indicates input file format (FASTQ/FASTA).</li>
</ul>
</li>
<li>
<p><strong>Interpreting Results</strong><br />Kraken generates an output file with columns for sequence IDs, taxonomic classifications, and the confidence score.</p>
</li>
</ol><h4><strong>Visualizing Kraken Results</strong></h4><p>Kraken results can be visualized using tools like <strong>Krona</strong> or converted to human-readable reports using <code>kraken-report</code>.</p><ol>
<li>
<p><strong>Generate a Report</strong></p>
<div>
<div dir="ltr"><code>kraken-report --db my_database kraken_output.txt &gt; kraken_report.txt </code></div>
</div>
</li>
<li>
<p><strong>Krona Visualization</strong><br />Install Krona and convert Kraken output for visualization:</p>
<div>
<div dir="ltr"><code>cut -f2,3 kraken_output.txt | ktImportTaxonomy -o krona_output.html </code></div>
</div>
<p>Open the HTML file in your browser to interactively explore the taxonomic classifications.</p>
</li>
</ol><h4><strong>Advanced Usage</strong></h4><ol>
<li>
<p><strong>Confidence Thresholds</strong><br />Adjust the confidence threshold for classification using the <code>--confidence</code> option. Higher values reduce false positives but may miss some true positives:</p>
<div>
<div dir="ltr"><code>kraken --db my_database --confidence 0.1 --fastq-input input.fastq </code></div>
</div>
</li>
<li>
<p><strong>Paired-End Reads</strong><br />For paired-end sequencing data, use:</p>
<div>
<div dir="ltr"><code>kraken --db my_database --paired reads_1.fastq reads_2.fastq </code></div>
</div>
</li>
<li>
<p><strong>Customizing K-mers</strong><br />Kraken allows you to set custom k-mer lengths during database building for specific applications.</p>
</li>
</ol><h4><strong>Applications of Kraken</strong></h4><ul>
<li><strong>Microbial Ecology</strong>: Characterizing microbial communities in soil, water, and the human microbiome.</li>
<li><strong>Pathogen Detection</strong>: Identifying pathogens in clinical samples.</li>
<li><strong>Fungal Research</strong>: Analyzing fungal diversity in metagenomic datasets.</li>
<li><strong>Environmental Monitoring</strong>: Tracking microbial populations in diverse habitats.</li>
</ul><h4><strong>Conclusion</strong></h4><p>Kraken is a versatile and efficient tool for taxonomic classification in metagenomics. Its speed, accuracy, and flexibility make it a favorite among bioinformaticians. By following this guide, you can set up and use Kraken to unlock insights into microbial and fungal communities, paving the way for discoveries in ecology, medicine, and biotechnology.</p></div></div></div></div></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</guid>
	<pubDate>Fri, 03 Jun 2016 10:09:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</link>
	<title><![CDATA[methylKit]]></title>
	<description><![CDATA[<p><em>methylKit</em> is an <a href="http://en.wikipedia.org/wiki/R_%28programming_language%29">R</a> package for DNA methylation analysis and annotation from high-throughput bisulfite sequencing. The package is designed to deal with sequencing data from <a href="http://www.nature.com/nprot/journal/v6/n4/abs/nprot.2010.190.html">RRBS</a> and its variants, but also target-capture methods such as <a href="http://www.halogenomics.com/sureselect/methyl-seq">Agilent SureSelect methyl-seq</a>. In addition, methylKit can deal with base-pair resolution data for 5hmC obtained from Tab-seq or oxBS-seq. It can also handle whole-genome bisulfite sequencing data if proper input format is provided.</p><p>Address of the bookmark: <a href="https://github.com/al2na/methylKit" rel="nofollow">https://github.com/al2na/methylKit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30111/eager</guid>
	<pubDate>Sat, 10 Dec 2016 18:07:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30111/eager</link>
	<title><![CDATA[EAGER]]></title>
	<description><![CDATA[<p><span>The automated reconstruction of genome sequences in ancient genome analysis is a multifaceted process.</span></p>
<p><span>EAGER encompasses both state-of-the-art tools for each step as well as new complementary tools tailored for ancient DNA data within a single integrated solution in an easily accessible format.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0918-z</p><p>Address of the bookmark: <a href="https://github.com/apeltzer/EAGER-GUI" rel="nofollow">https://github.com/apeltzer/EAGER-GUI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</guid>
	<pubDate>Mon, 09 Jul 2018 05:20:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37257/asar-advanced-metagenomic-sequence-analysis-in-r</link>
	<title><![CDATA[ASAR: Advanced metagenomic Sequence Analysis in R]]></title>
	<description><![CDATA[<p><span>An interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.</span></p>
<p><span><span>To read the manual, please click the link&nbsp;</span><a href="https://askarbek-orakov.github.io/ASAR/">https://askarbek-orakov.github.io/ASAR/</a></span></p><p>Address of the bookmark: <a href="https://github.com/Askarbek-orakov/ASAR" rel="nofollow">https://github.com/Askarbek-orakov/ASAR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27328/platanus</guid>
	<pubDate>Fri, 13 May 2016 05:12:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27328/platanus</link>
	<title><![CDATA[Platanus]]></title>
	<description><![CDATA[<p>Platanus is a novel <em>de novo</em> sequence assembler that can reconstruct genomic sequences of<br> highly heterozygous diploids from massively parallel shotgun sequencing data.</p>
<p>The latest version is <a href="http://platanus.bio.titech.ac.jp/platanus/?page_id=14">1.2.4</a>.</p>
<p>To cite Platanus, please use the following:</p>
<p>Kajitani R, Toshimoto K, Noguchi H, Toyoda A, Ogura Y, Okuno M, Yabana M, Harada M, Nagayasu E, Maruyama H, Kohara Y, Fujiyama A, Hayashi T, Itoh T, &ldquo;Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads&rdquo;.&nbsp;Genome Res. 2014 Aug;24(8):1384-95. doi: 10.1101/gr.170720.113. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/24755901">abstract</a> |<a href="http://genome.cshlp.org/content/24/8/1384.long"> full text</a>]</p><p>Address of the bookmark: <a href="http://platanus.bio.titech.ac.jp/" rel="nofollow">http://platanus.bio.titech.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29384/phymmbl</guid>
	<pubDate>Mon, 10 Oct 2016 08:56:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29384/phymmbl</link>
	<title><![CDATA[PHYMMBL]]></title>
	<description><![CDATA[<p><span>Metagenomics sequencing projects collect samples of DNA from uncharacterized environments that may contain hundreds or even thousands of species. One of the main challenges in analyzing a metagenome is phylogenetic classification of raw sequence reads into groups representing the same or similar species. Such classification is a useful prerequisite for genome assembly and for analysis of the biological diversity present in a sample. The newest sequencing technologies have simultaneously made metagenomics easier, by making the sequencing process faster, and more difficult, by producing shorter read lengths than previous technologies. Methods for classifying sequences as short as 100 base pairs (bp) have until now been relatively inaccurate, requiring metagenomics projects to use older, long-read technologies.&nbsp;</span><strong>Phymm</strong><span>, a new classification approach for metagenomics data which uses interpolated Markov models (IMMs) to taxonomically classify DNA sequences, can accurately classify reads as short as 100 bp. Its accuracy for short reads represents a significant leap forward over previous composition-based classification methods.&nbsp;</span><strong>PhymmBL</strong><span>&nbsp;(rhymes with "thimble"), the hybrid classifier included in this distribution which combines analysis from both Phymm and&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/BLAST">BLAST</a><span>, produces even higher accuracy.</span></p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/software/phymm/" rel="nofollow">http://www.cbcb.umd.edu/software/phymm/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>