<?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/34565?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/34565?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22793/sequencing-by-xpansion</guid>
	<pubDate>Wed, 17 Jun 2015 20:58:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22793/sequencing-by-xpansion</link>
	<title><![CDATA[Sequencing By Xpansion]]></title>
	<description><![CDATA[<p>Sequencing By Xpansion (SBX) is a DNA sequencing method that uses a simple biochemical reaction to encode the sequence of a DNA molecule into a highly measurable surrogate called an Xpandomer. This single molecule approach produces enough Xpandomer in a single drop reaction to sequence an entire human genome 1000X over. To achieve this, an Xpandomer replaces each DNA sequence with a sequence of large, high signal reporter molecules using the SBX molecular expansion technology. The DNA sequence is then read out as the Xpandomer reporters pass sequentially through a nanopore detector. SBX is a molecular engineering platform that benefits from core design principles that separate the multiple molecular functions. This systems approach enables efficient development and incorporation of improvements to SBX and is key to reconfiguring and optimizing Xpandomer measurement for different detection platforms.</p><p>http://www.stratosgenomics.com/stratos-genomics-technology</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</guid>
	<pubDate>Tue, 14 Jun 2016 10:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</link>
	<title><![CDATA[Blobsplorer]]></title>
	<description><![CDATA[<p>Blobsplorer is a tool for interactive visualization of assembled DNA sequence data ("contigs") derived from (often unintentionally) mixed-species pools. It allows the simultaneous display of GC content, coverage, and taxonomic annotation for collections of contigs with a view to separating out those belonging to different taxa.</p>
<p>Blobsplorer is unlikely to be of use on its own as it requires contig data to be supplied in a format that involves considerable preprocessing (see below for a description). The easiest way to use Blobsplorer is as part of a workflow using scripts from <a href="https://github.com/blaxterlab/blobology">here</a>.</p><p>Address of the bookmark: <a href="http://nematodes.org/martin/blobsplorer/blobsplorer.html" rel="nofollow">http://nematodes.org/martin/blobsplorer/blobsplorer.html</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/33789/i-pv-interactive-protein-sequence-visualization</guid>
	<pubDate>Mon, 03 Jul 2017 07:52:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33789/i-pv-interactive-protein-sequence-visualization</link>
	<title><![CDATA[I-PV: Interactive Protein Sequence Visualization]]></title>
	<description><![CDATA[<p><span>I-PV is a interactive data visualization software designed for inspection of protein sequences and mutation information. It is mainly used for Genetics and Bioinformatics. So what exactly makes it standout?</span></p>
<p><span>http://i-pv.org/ipv_rec</span></p><p>Address of the bookmark: <a href="http://i-pv.org/" rel="nofollow">http://i-pv.org/</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/41689/medaka-sequence-correction-provided-by-ont-research</guid>
	<pubDate>Mon, 18 May 2020 16:28:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41689/medaka-sequence-correction-provided-by-ont-research</link>
	<title><![CDATA[medaka: Sequence correction provided by ONT Research]]></title>
	<description><![CDATA[<p><code>medaka</code><span>&nbsp;is a tool to create a consensus sequence from nanopore sequencing data. This task is performed using neural networks applied from a pileup of individual sequencing reads against a draft assembly. It outperforms graph-based methods operating on basecalled data, and can be competitive with state-of-the-art signal-based methods, whilst being much faster.</span></p><p>Address of the bookmark: <a href="https://github.com/nanoporetech/medaka" rel="nofollow">https://github.com/nanoporetech/medaka</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</guid>
	<pubDate>Tue, 08 Nov 2022 03:37:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43995/tools-for-sequence-translation</link>
	<title><![CDATA[Tools for Sequence translation !]]></title>
	<description><![CDATA[<p><span>BOrf</span>&nbsp;-&nbsp;<a href="https://github.com/betsig/borf" target="_blank">https://github.com/betsig/borf</a></p><p><span>CodAn</span>&nbsp;-&nbsp;<a href="https://github.com/pedronachtigall/CodAn" target="_blank">https://github.com/pedronachtigall/CodAn</a></p><p><span>EMBOSS-Sixpack</span>&nbsp;-&nbsp;<a href="https://www.ebi.ac.uk/Tools/st/emboss_sixpack/" target="_blank">https://www.ebi.ac.uk/Tools/st/emboss_sixpack/</a></p><p><span>esl-translate</span>&nbsp;-&nbsp;<a href="http://hmmer.org/" target="_blank">http://hmmer.org/</a>,&nbsp;<a href="https://github.com/EddyRivasLab/easel" target="_blank">https://github.com/EddyRivasLab/easel</a></p><p><span>GeneMarkS-T</span>&nbsp;-&nbsp;<a href="http://exon.gatech.edu/GeneMark/license_download.cgi" target="_blank">http://exon.gatech.edu/GeneMark/license_download.cgi</a></p><p><span>ORFfinder</span>&nbsp;-&nbsp;<a href="https://www.ncbi.nlm.nih.gov/orffinder/" target="_blank">https://www.ncbi.nlm.nih.gov/orffinder/</a>&nbsp;(web server)</p><p><span>PLASS</span>&nbsp;-&nbsp;<a href="https://github.com/soedinglab/plass" target="_blank">https://github.com/soedinglab/plass</a></p><p><span>Prodigal</span>&nbsp;-&nbsp;<a href="https://github.com/hyattpd/Prodigal" target="_blank">https://github.com/hyattpd/Prodigal</a></p><p><span>TransDecoder</span>&nbsp;-&nbsp;<a href="https://github.com/TransDecoder/TransDecoder" target="_blank">https://github.com/TransDecoder/TransDecoder</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</guid>
	<pubDate>Tue, 03 Sep 2013 16:35:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/4196/chemical-elements-of-bioinformatics</link>
	<title><![CDATA[Chemical Elements of Bioinformatics]]></title>
	<description><![CDATA[<p>You must be familiar with periodic table and colour pattern, but this time you are going to amaze by new elements table by Eagle genomics. Just check it out and have fun :)</p><p><a href="http://elements.eaglegenomics.com/">http://elements.eaglegenomics.com/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</guid>
	<pubDate>Thu, 23 Nov 2017 08:37:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34391/taxoblast-taxoblast-is-a-pipeline-to-identify-contamination-in-genomic-sequence</link>
	<title><![CDATA[Taxoblast : Taxoblast is a pipeline to identify contamination in genomic sequence]]></title>
	<description><![CDATA[<p><span>Modern genome sequencing strategies are highly sensitive to contamination making the detection of foreign DNA sequences an important part of analysis pipelines. Here we use Taxoblast, a simple pipeline with a graphical user interface, for the post-assembly detection of contaminating sequences in the published genome of the kelp&nbsp;</span><em>Saccharina japonica</em><span>. Analyses were based on multiple blastn searches with short sequence fragments. They revealed a number of probable bacterial contaminations as well as hybrid scaffolds that contain both bacterial and algal sequences. This or similar types of analysis, in combination with manual curation, may thus constitute a useful complement to standard bioinformatics analyses prior to submission of genomic data to public repositories. Our analysis pipeline is open-source and freely available at&nbsp;</span><a href="http://sdittami.altervista.org/taxoblast" title="">http://sdittami.altervista.org/taxoblast</a><span>&nbsp;and via SourceForge (</span><a href="https://sourceforge.net/projects/taxoblast" title="">https://sourceforge.net/projects/taxoblast</a><span>).</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/taxoblast/files/" rel="nofollow">https://sourceforge.net/projects/taxoblast/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</guid>
	<pubDate>Tue, 19 Jun 2018 08:34:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36974/many-to-many-pairwise-alignments-of-two-sequence-sets</link>
	<title><![CDATA[Many-to-many pairwise alignments of two sequence sets]]></title>
	<description><![CDATA[needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.<p>Address of the bookmark: <a href="http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html" rel="nofollow">http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>