<?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/34922?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/34922?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</guid>
	<pubDate>Wed, 14 Dec 2016 09:59:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30140/cutadapt</link>
	<title><![CDATA[Cutadapt]]></title>
	<description><![CDATA[<p>Cutadapt finds and removes adapter sequences, primers, poly-A tails and other types of unwanted sequence from your high-throughput sequencing reads.</p>
<p>Cutadapt helps with these trimming tasks by finding the adapter or primer sequences in an error-tolerant way. It can also modify and filter reads in various ways. Adapter sequences can contain IUPAC wildcard characters. Also, paired-end reads and even colorspace data is supported. If you want, you can also just demultiplex your input data, without removing adapter sequences at all.</p>
<p>Cutadapt comes with an extensive suite of automated tests and is available under the terms of the MIT license.</p>
<p>If you use cutadapt, please cite&nbsp;<a href="http://dx.doi.org/10.14806/ej.17.1.200">DOI:10.14806/ej.17.1.200</a>&nbsp;.</p>
<p>More at&nbsp;https://github.com/marcelm/cutadapt</p><p>Address of the bookmark: <a href="http://cutadapt.readthedocs.io/en/stable/guide.html" rel="nofollow">http://cutadapt.readthedocs.io/en/stable/guide.html</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</guid>
	<pubDate>Fri, 16 Dec 2016 11:09:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30168/gene-synteny-database</link>
	<title><![CDATA[Gene Synteny Database]]></title>
	<description><![CDATA[<p>Comparative genomics remains a pivotal strategy to study the evolution of gene organization, and this primacy is reinforced by the growing number of full genome sequences available in public repositories. Despite this growth, bioinformatic tools available to visualize and compare genomes and to infer evolutionary events remain restricted to two or three genomes at a time, thus limiting the breadth and the nature of the question that can be investigated. Here we present Genomicus, a new synteny browser that can represent and compare unlimited numbers of genomes in a broad phylogenetic view. In addition, Genomicus includes reconstructed ancestral gene organization, thus greatly facilitating the interpretation of the data.</p>
<p><strong>Availability:</strong>&nbsp;Genomicus is freely available for online use at&nbsp;<a href="http://www.dyogen.ens.fr/genomicus" target="pmc_ext">http://www.dyogen.ens.fr/genomicus</a>&nbsp;while data can be downloaded at&nbsp;<a href="ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus" target="pmc_ext">ftp://ftp.biologie.ens.fr/pub/dyogen/genomicus</a></p>
<p><strong>Contact:</strong>&nbsp;<a href="mailto:dev@null">rf.sne.eigoloib@crh</a></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2853686/</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/30355/meme-suite</guid>
	<pubDate>Fri, 23 Dec 2016 08:49:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30355/meme-suite</link>
	<title><![CDATA[MEME suite]]></title>
	<description><![CDATA[<p>Motif based sequence analysis suits&nbsp;</p>
<p>The MEME Suite allows the biologist to discover novel motifs in collections of unaligned nucleotide or protein sequences, and to perform a wide variety of other motif-based analyses.</p>
<p>The MEME Suite supports motif-based analysis of DNA, RNA and protein sequences. It provides motif discovery algorithms using both probabilistic (MEME) and discrete models (MEME), which have complementary strengths. It also allows discovery of motifs with arbitrary insertions and deletions (GLAM2). In addition to motif discovery, the MEME Suite provides tools for scanning sequences for matches to motifs (FIMO, MAST and GLAM2Scan), scanning for clusters of motifs (MCAST), comparing motifs to known motifs (Tomtom), finding preferred spacings between motifs (SpaMo), predicting the biological roles of motifs (GOMo), measuring the positional enrichment of sequences for known motifs (CentriMo), and analyzing ChIP-seq and other large datasets (MEME-ChIP).</p>
<p>The MEME Suite is comprised of a collection of tools that work together, as shown below. Not all the tools are available as webservices, so to get the full power of the MEME Suite you will need to&nbsp;<a href="http://meme-suite.org/doc/download.html">download</a>&nbsp;and&nbsp;<a href="http://meme-suite.org/doc/install.html">install</a>&nbsp;a local copy of the software. To see what has changed recently you can peruse the&nbsp;<a href="http://meme-suite.org/doc/release-notes.html">release notes</a>.</p>
<p>http://meme-suite.org/</p><p>Address of the bookmark: <a href="http://meme-suite.org/" rel="nofollow">http://meme-suite.org/</a></p>]]></description>
	<dc:creator>Bulbul</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/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</guid>
	<pubDate>Mon, 06 Feb 2017 04:45:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</link>
	<title><![CDATA[DnaSP v5: a software for comprehensive analysis of DNA polymorphism data]]></title>
	<description><![CDATA[<p><span>DnaSP is a software package for a comprehensive analysis of DNA polymorphism data. Version 5 implements a number of new features and analytical methods allowing extensive DNA polymorphism analyses on large datasets. Among other features, the newly implemented methods allow for: (i) analyses on multiple data files; (ii) haplotype phasing; (iii) analyses on insertion/deletion polymorphism data; (iv) visualizing sliding window results integrated with available genome annotations in the UCSC browser.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</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/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>

</channel>
</rss>