<?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/31300?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/31300?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29487/shinyheatmap</guid>
	<pubDate>Fri, 21 Oct 2016 05:12:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29487/shinyheatmap</link>
	<title><![CDATA[Shinyheatmap]]></title>
	<description><![CDATA[<p><span>Background: Transcriptomics, metabolomics, metagenomics, and other various next-generation sequencing (-omics) fields are known for their production of large datasets. Visualizing such big data has posed technical challenges in biology, both in terms of available computational resources as well as programming acumen. Since heatmaps are used to depict high-dimensional numerical data as a colored grid of cells, efficiency and speed have often proven to be critical considerations in the process of successfully converting data into graphics. For example, rendering interactive heatmaps from large input datasets (e.g., 100k+ rows) has been computationally infeasible on both desktop computers and web browsers. In addition to memory requirements, programming skills and knowledge have frequently been barriers-to-entry for creating highly customizable heatmaps. Results: We propose shinyheatmap: an advanced user-friendly heatmap software suite capable of efficiently creating highly customizable static and interactive biological heatmaps in a web browser. shinyheatmap is a low memory footprint program, making it particularly well-suited for the interactive visualization of extremely large datasets that cannot typically be computed in-memory due to size restrictions. Conclusions: shinyheatmap is hosted online as a freely available web server with an intuitive graphical user interface: http://shinyheatmap.com. The methods are implemented in R, and are available as part of the shinyheatmap project at: https://github.com/Bohdan-Khomtchouk/shinyheatmap.</span></p>
<p><span>More at&nbsp;http://biorxiv.org/content/early/2016/09/21/076463&nbsp;</span></p><p>Address of the bookmark: <a href="http://shinyheatmap.com/" rel="nofollow">http://shinyheatmap.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</guid>
	<pubDate>Thu, 08 Dec 2016 05:08:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</link>
	<title><![CDATA[SGA: String Graph Assembler]]></title>
	<description><![CDATA[<p><span>SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.</span></p>
<p><span>More at</span></p>
<p><span>https://github.com/jts/sga</span></p>
<p>SGA dependencies:<br> -google sparse hash library (http://code.google.com/p/google-sparsehash/)<br> -the bamtools library (https://github.com/pezmaster31/bamtools)<br> -zlib (http://www.zlib.net/)<br> -(optional but suggested) the jemalloc memory allocator (http://www.canonware.com/jemalloc/download.html)</p><p>Address of the bookmark: <a href="https://github.com/jts/sga" rel="nofollow">https://github.com/jts/sga</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/bookmarks/view/30540/progressive-cactus</guid>
	<pubDate>Tue, 17 Jan 2017 03:40:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30540/progressive-cactus</link>
	<title><![CDATA[Progressive Cactus]]></title>
	<description><![CDATA[<h1><em style="font-size: 12.8px; font-weight: normal;">v0.0 by Glenn Hickey (<a href="mailto:hickey@soe.ucsc.edu">hickey@soe.ucsc.edu</a>)</em></h1>
<p>Progressive Cactus is a whole-genome alignment package.</p>
<h3><a href="https://github.com/glennhickey/progressiveCactus#requirements"></a>Requirements</h3>
<ul>
<li>git</li>
<li>gcc 4.2 or newer</li>
<li>python 2.7</li>
<li>wget</li>
<li>64bit processor and build environment</li>
<li>150GB+ of memory on at least one machine when aligning mammal-sized genomes; less memory is needed for smaller genomes.</li>
<li>Parasol or SGE for cluster support.</li>
<li>750M disk space</li>
</ul>
<h3><a href="https://github.com/glennhickey/progressiveCactus#instructions"></a>Instructions</h3>
<p>IMPORTANT NOTE: Progressive Cactus does not presently support installation into paths that contain spaces. Until this is resolved, you can use a softlink as a workaround: ln -s "path with spaces" "installation path without spaces"</p>
<p>In the parent directory of where you want Progressive Cactus installed:</p>
<pre><code>git clone git://github.com/glennhickey/progressiveCactus.git
cd progressiveCactus
git pull
git submodule update --init
make
</code></pre>
<p>It is also convenient to add the location of&nbsp;<code>progressiveCactus/bin</code>&nbsp;to your PATH environment variable. In order to run the included tools (ex hal2maf) in the submodules/ directory structure, first source&nbsp;<code>progressiveCactus/environment</code>&nbsp;to load the installed environment.</p>
<p>If any errors occur during the build process, you are unlikely to be able to use the tool. Please submit a GitHub issue so we can help out: not only will you help yourself, but others who wish to use the tool as well.</p>
<p><em>Note that all dependencies are also built and included in the submodules/ directory. This increases the size and build time but greatly simplifies installation and version management. The installation does not create or modify any files outside the progressiveCactus/ directory.</em></p><p>Address of the bookmark: <a href="https://github.com/glennhickey/progressiveCactus" rel="nofollow">https://github.com/glennhickey/progressiveCactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</guid>
	<pubDate>Fri, 24 Feb 2017 04:50:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</link>
	<title><![CDATA[bedtools]]></title>
	<description><![CDATA[<p>Collectively, the&nbsp;<strong>bedtools</strong>&nbsp;utilities are a swiss-army knife of tools for a wide-range of genomics analysis tasks. The most widely-used tools enable&nbsp;<em>genome arithmetic</em>: that is, set theory on the genome. For example,&nbsp;<strong>bedtools</strong>&nbsp;allows one to<em>intersect</em>,&nbsp;<em>merge</em>,&nbsp;<em>count</em>,&nbsp;<em>complement</em>, and&nbsp;<em>shuffle</em>&nbsp;genomic intervals from multiple files in widely-used genomic file formats such as BAM, BED, GFF/GTF, VCF. While each individual tool is designed to do a relatively simple task (e.g.,&nbsp;<em>intersect</em>&nbsp;two interval files), quite sophisticated analyses can be conducted by combining multiple bedtools operations on the UNIX command line.</p>
<p><strong>bedtools</strong>&nbsp;is developed in the&nbsp;<a href="http://quinlanlab.org/">Quinlan laboratory</a>&nbsp;at the&nbsp;<a href="http://www.utah.edu/">University of Utah</a>&nbsp;and benefits from fantastic contributions made by scientists worldwide.</p><p>Address of the bookmark: <a href="http://bedtools.readthedocs.io/en/latest/index.html" rel="nofollow">http://bedtools.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</guid>
	<pubDate>Mon, 06 Mar 2017 04:03:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31351/maxbin-software-for-binning-assembled-metagenomic-sequences-based-on-an-expectation-maximization-algorithm</link>
	<title><![CDATA[MaxBin: software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm.]]></title>
	<description><![CDATA[<p><span>MaxBin is software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users can understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome-related statistics, including estimated completeness, GC content and genome size in the binning summary page.</span><br><br><span>Users can use MEGAN or similar software on MaxBin bins to find the taxonomy of each bin after the binning process is finished.</span></p>
<p>https://academic.oup.com/bioinformatics/article/32/4/605/1744462/MaxBin-2-0-an-automated-binning-algorithm-to<br><br><span>The most recent version of MaxBin is 2.2, which supports the analysis of coassemblies of multiple samples. It is available at this JBEI downloads sites as well as&nbsp;</span><a href="https://sourceforge.net/projects/maxbin/" target="_blank">MaxBin</a><span>&nbsp;and&nbsp;</span><a href="https://sourceforge.net/projects/maxbin2/" target="_blank">MaxBin 2.0</a><span>&nbsp;sourceforge sites.</span></p><p>Address of the bookmark: <a href="http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html" rel="nofollow">http://downloads.jbei.org/data/microbial_communities/MaxBin/MaxBin.html</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/32730/ncbi-prokaryotic-genome-annotation-pipeline</guid>
	<pubDate>Tue, 16 May 2017 08:56:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32730/ncbi-prokaryotic-genome-annotation-pipeline</link>
	<title><![CDATA[NCBI Prokaryotic Genome Annotation Pipeline]]></title>
	<description><![CDATA[<p>NCBI Prokaryotic Genome Annotation Pipeline is designed to annotate bacterial and archaeal genomes (chromosomes and plasmids).</p>
<p>Genome annotation is a multi-level process that includes prediction of protein-coding genes, as well as other functional genome units such as structural RNAs, tRNAs, small RNAs, pseudogenes, control regions, direct and inverted repeats, insertion sequences, transposons and other mobile elements.</p>
<p>NCBI has developed an automatic prokaryotic genome annotation pipeline that combines&nbsp;<em>ab initio</em>&nbsp;gene prediction algorithms with homology based methods. The first version of NCBI Prokaryotic Genome Automatic Annotation Pipeline (PGAAP;&nbsp;<a href="https://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Retrieve&amp;db=pubmed&amp;dopt=Abstract&amp;list_uids=18416670">see Pubmed Article</a>) developed in 2005 has been replaced with an upgraded version that is capable of processing a larger data volume. You can find a more detailed description of the new version of&nbsp;the pipeline in&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK174280/">NCBI Handbook chapter</a>. NCBI's annotation pipeline depends on several internal databases and is not currently available for download or use outside of the NCBI environment.</p>
<p>https://www.ncbi.nlm.nih.gov/genome/annotation_prok/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/genome/annotation_prok/" rel="nofollow">https://www.ncbi.nlm.nih.gov/genome/annotation_prok/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>