<?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/36012?offset=530</link>
	<atom:link href="https://bioinformaticsonline.com/related/36012?offset=530" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</guid>
	<pubDate>Mon, 19 Dec 2016 06:07:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30207/gam-ngs-genomic-assemblies-merger-for-next-generation-sequencing</link>
	<title><![CDATA[GAM-NGS: genomic assemblies merger for next generation sequencing]]></title>
	<description><![CDATA[<p><span>GAM-NGS (Genomic Assemblies Merger for Next Generation Sequencing), whose primary goal is to merge two or more assemblies in order to enhance contiguity and correctness of both. GAM-NGS does not rely on global alignment: regions of the two assemblies representing the same genomic&nbsp;</span><em>locus</em><span>&nbsp;(called&nbsp;</span><em>blocks</em><span>) are identified through reads' alignments and stored in a&nbsp;</span><em>weighted</em><span>graph. The merging phase is carried out with the help of this weighted graph that allows an&nbsp;</span><em>optimal</em><span>&nbsp;resolution of&nbsp;</span><em>local</em><span>&nbsp;problematic regions.</span></p><p>Address of the bookmark: <a href="https://github.com/vice87/gam-ngs" rel="nofollow">https://github.com/vice87/gam-ngs</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30234/last</guid>
	<pubDate>Mon, 19 Dec 2016 14:07:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30234/last</link>
	<title><![CDATA[LAST]]></title>
	<description><![CDATA[<p>LAST can:</p>
<ul>
<li>Handle&nbsp;<strong>big</strong>&nbsp;sequence data, e.g:
<ul>
<li>Compare two vertebrate genomes</li>
<li>Align billions of DNA reads to a genome</li>
</ul>
</li>
<li>Indicate the&nbsp;<a href="http://lastweb.cbrc.jp/about.html">reliability</a>&nbsp;of each aligned column.</li>
<li>Use sequence quality data&nbsp;<a href="http://nar.oxfordjournals.org/content/38/7/e100.abstract">properly</a>.</li>
<li>Compare DNA to proteins, with frameshifts.</li>
<li>Compare PSSMs to sequences</li>
<li>Calculate the likelihood of chance similarities between random sequences.</li>
<li>Do split and spliced alignment.</li>
<li><a href="http://last.cbrc.jp/doc/last-train.html">Train</a>&nbsp;alignment parameters for unusual kinds of sequence (e.g. nanopore).</li>
</ul><p>Address of the bookmark: <a href="http://last.cbrc.jp/" rel="nofollow">http://last.cbrc.jp/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</guid>
	<pubDate>Thu, 22 Dec 2016 03:53:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30304/mcscan</link>
	<title><![CDATA[MCscan]]></title>
	<description><![CDATA[<p><span>MCscan is a computer program that can simultaneously scan multiple genomes to identify homologous chromosomal regions and subsequently align these regions using genes as anchors. This is the toolset for generating the synteny correspondences in&nbsp;</span><a href="http://chibba.agtec.uga.edu/duplication">Plant Genome Duplication Database</a><span>. It is intended as an easy-to-use and quick way to identify conserved gene arrays both within the same genome and across different genomes.</span></p>
<p><span>More at&nbsp;http://chibba.agtec.uga.edu/duplication/mcscan/</span></p><p>Address of the bookmark: <a href="http://chibba.agtec.uga.edu/duplication/mcscan/" rel="nofollow">http://chibba.agtec.uga.edu/duplication/mcscan/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</guid>
	<pubDate>Wed, 18 Jan 2017 10:24:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30550/genomering-alignment-visualization-based-on-supergenome-coordinates</link>
	<title><![CDATA[GenomeRing: alignment visualization based on SuperGenome coordinates]]></title>
	<description><![CDATA[<p>The number of completely sequenced genomes is continuously rising, allowing for comparative analyses of genomic variation. Such analyses are often based on whole-genome alignments to elucidate structural differences arising from insertions, deletions or from rearrangement events. Computational tools that can visualize genome alignments in a meaningful manner are needed to help researchers gain new insights into the underlying data. Such visualizations typically are either realized in a linear fashion as in genome browsers or by using a circular approach, where relationships between genomic regions are indicated by arcs. Both methods allow for the integration of additional information such as experimental data or annotations. However, providing a visualization that still allows for a quick and comprehensive interpretation of all important genomic variations together with various supplemental data, which may be highly heterogeneous, remains a challenge.</p>
<p>More at https://academic.oup.com/bioinformatics/article/28/12/i7/268598/GenomeRing-alignment-visualization-based-on</p><p>Address of the bookmark: <a href="http://it.informatik.uni-tuebingen.de/?page_id=185" rel="nofollow">http://it.informatik.uni-tuebingen.de/?page_id=185</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</guid>
	<pubDate>Fri, 17 Feb 2017 09:06:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</link>
	<title><![CDATA[J-Circos]]></title>
	<description><![CDATA[<p>Circos plot tool (J-Circos) that is an interactive visualization tool that can plot Circos figures, as well as being able to dynamically add data to the figure, and providing information for specific data points using mouse hover display and zoom in/out functions. J-Circos uses the Java computer language to enable it to be used on most operating systems (Windows, MacOS, Linux). Users can input data into J-Circos using flat data formats, as well as from the GUI. J-Circos will enable biologists to better study more complex chromosomal interactions and fusion transcripts that are otherwise difficult to visualize from next-generation sequencing data.</p><p>Address of the bookmark: <a href="http://www.australianprostatecentre.org/research/software/jcircos" rel="nofollow">http://www.australianprostatecentre.org/research/software/jcircos</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/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/32481/sspace</guid>
	<pubDate>Fri, 05 May 2017 05:42:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32481/sspace</link>
	<title><![CDATA[SSPACE]]></title>
	<description><![CDATA[<p>SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE" rel="nofollow">https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>