<?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/27461?offset=920</link>
	<atom:link href="https://bioinformaticsonline.com/related/27461?offset=920" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</guid>
	<pubDate>Sat, 02 Jun 2018 07:36:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36846/gblocks-eliminates-poorly-aligned-positions-and-divergent-regions-of-a-dna-or-protein-alignment</link>
	<title><![CDATA[Gblocks: eliminates poorly aligned positions and divergent regions of a DNA or protein alignment]]></title>
	<description><![CDATA[<p><a href="http://molevol.cmima.csic.es/castresana/Gblocks.html">Gblocks</a><span>&nbsp;eliminates poorly aligned positions and divergent regions of a DNA or protein alignment so that it becomes more suitable for phylogenetic analysis. This server implements the most important features of the Gblocks program to make its use as simple as possible without loosing the functionality that it is necessary in most of the cases. Other options can be changed in the stand-alone program. You can see here an&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks_server/nad3.pir-gb.htm">example output file</a><span>&nbsp;showing the blocks selected from a protein alignment. Further information can be found in the&nbsp;</span><a href="http://molevol.cmima.csic.es/castresana/Gblocks/Gblocks_documentation.html">online documentation</a><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://molevol.cmima.csic.es/castresana/Gblocks_server.html" rel="nofollow">http://molevol.cmima.csic.es/castresana/Gblocks_server.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</guid>
	<pubDate>Fri, 24 Aug 2018 09:50:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37584/mulan-multiple-sequence-local-alignment-and-visualization-for-studying-function-and-evolution</link>
	<title><![CDATA[Mulan: Multiple-sequence local alignment and visualization for studying function and evolution]]></title>
	<description><![CDATA[<p>Mulan: Multiple-sequence local alignment and visualization for studying function and evolution</p>
<p><span>Mulan (</span><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/#ref44">http://mulan.dcode.org/</a><span>), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC540288/</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/31552/multigenome-assembly</guid>
	<pubDate>Tue, 14 Mar 2017 04:41:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31552/multigenome-assembly</link>
	<title><![CDATA[Multigenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes</p>
<p>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p>
<p>See the associated&nbsp;<a href="http://madsalbertsen.github.io/multi-metagenome/">online guide</a>&nbsp;for detailed information.</p>
<p>https://github.com/MadsAlbertsen/multi-metagenome</p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</guid>
	<pubDate>Fri, 08 Mar 2024 23:36:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44481/unialigner-a-parameter-free-framework-for-fast-sequence-alignment</link>
	<title><![CDATA[UniAligner: a parameter-free framework for fast sequence alignment]]></title>
	<description><![CDATA[<p>UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches, such as the Smith-Waterman algorithm, that work well for most sequences, fail to construct biologically adequate alignments of extra-long tandem repeats (ETRs), such as human centromeres and immunoglobulin loci. This limitation was overlooked in the previous studies since the sequences of the centromeres and other ETRs across multiple genomes only became available recently.</p>
<p>More at https://www.nature.com/articles/s41592-023-01970-4</p><p>Address of the bookmark: <a href="https://github.com/seryrzu/unialigner" rel="nofollow">https://github.com/seryrzu/unialigner</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</guid>
	<pubDate>Sun, 02 Apr 2017 15:53:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32018/tmap-torrent-mapping-alignment-program-general-notes</link>
	<title><![CDATA[TMAP - torrent mapping alignment program General Notes]]></title>
	<description><![CDATA[<p>TMAP - torrent mapping alignment program <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP#general-notes"></a>General Notes</p>
<p>TMAP is a fast and accurate alignment software for short and long nucleotide sequences produced by next-generation sequencing technologies.</p>
<ul>
<li>
<p>The latest TMAP is unsupported. To use a supported version, please see the TMAP version associated with a Torrent Suite release below.</p>
</li>
<li>
<p>Get the latest source code:</p>
<div>
<pre>git clone git://github.com/iontorrent/TMAP.git
 <span>cd</span> TMAP
 git submodule init
 git submodule update</pre>
</div>
</li>
</ul>
<p>https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</p><p>Address of the bookmark: <a href="https://github.com/iontorrent/TS/tree/master/Analysis/TMAP" rel="nofollow">https://github.com/iontorrent/TS/tree/master/Analysis/TMAP</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</guid>
	<pubDate>Wed, 03 Jan 2018 05:05:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35041/seal-sequence-alignment-evaluation-suite</link>
	<title><![CDATA[Seal: SEquence ALignment evaluation suite]]></title>
	<description><![CDATA[<p><span>Seal</span>&nbsp;is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including:</p>
<ul>
<li>Reading a pre-existing reference genome from one or more FASTA files.</li>
<li>Alternatively, generating an artificial reference genome based on input parameters (length, repeat count, repeat length, repeat variability rate).</li>
<li>Simulating reads from random locations in the genome based on input parameters of read length, coverage, sequencing error rate, and indel rate.</li>
<li>Applying alignment tools to the genome and the reads through a standardized interface.</li>
<li>Parsing the output of the alignment tool and calculating the number of reads that were correctly or incorrectly mapped.</li>
<li>Computing run times and measures of accuracy.</li>
</ul>
<p><span>Seal</span>&nbsp;has interfaces to evaluate the following software packages:</p>
<ul>
<li>Bowtie</li>
<li>BWA</li>
<li>MAQ</li>
<li>mrFAST</li>
<li>mrsFAST</li>
<li>Novoalign</li>
<li>SHRiMP</li>
<li>SOAPv2</li>
</ul><p>Address of the bookmark: <a href="http://compbio.case.edu/seal/" rel="nofollow">http://compbio.case.edu/seal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>