<?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/36755?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/36755?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/44515/cleaner-blast-databases-for-more-accurate-results</guid>
	<pubDate>Tue, 23 Apr 2024 01:23:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/44515/cleaner-blast-databases-for-more-accurate-results</link>
	<title><![CDATA[Cleaner BLAST Databases for More Accurate Results]]></title>
	<description><![CDATA[<p>Do you use&nbsp;<a href="https://blast.ncbi.nlm.nih.gov/Blast.cgi?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=blast-cleaner-20240422">BLAST</a><span style="font-size: 12.8px; font-weight: normal;">&nbsp;to identify a sequence or the evolutionary scope of a gene? That can be challenging if contaminated and misclassified sequences are in the BLAST databases and show up in your search results. To address</span><span style="font-size: 12.8px; font-weight: normal;">&nbsp;this problem</span><span style="font-size: 12.8px; font-weight: normal;">, we now use the NCBI quality assurance tools listed below to systematically remove these misleading sequences from the default nucleotide (nt) and protein (nr) BLAST databases.</span><span style="font-size: 12.8px; font-weight: normal;">&nbsp;</span></p><div><ul>
<li><a href="https://github.com/ncbi/fcs">Foreign Contamination Screen tool for genome cross-species screening (FCS-GX)</a>&nbsp;detects contamination from foreign organisms in genomes and other sequences using the genome cross-species aligner (GX)&nbsp;</li>
<li><a href="https://ncbiinsights.ncbi.nlm.nih.gov/2022/05/27/ani-for-assembly-validation?utm_source=ncbi_insights&amp;utm_medium=referral&amp;utm_campaign=blast-cleaner-20240422">Average Nucleotide Identity (ANI)</a>&nbsp;evaluates the taxonomic classification of prokaryotic genome assemblies. Sequences from genomes marked up as &lsquo;unverified source organism&rsquo; are considered suspect and removed.&nbsp;</li>
</ul><p>Ref&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2024/04/22/cleaner-blast-databases-more-accurate-results/</p></div>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</guid>
	<pubDate>Tue, 26 Apr 2016 12:18:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27094/smash-an-alignment-free-method-to-find-and-visualise-rearrangements-between-pairs-of-dna-sequences</link>
	<title><![CDATA[Smash: An alignment-free method to find and visualise rearrangements between pairs of DNA sequences]]></title>
	<description><![CDATA[<p><strong>Smash is a completely alignment-free method/tool to find and visualise genomic rearrangements</strong><span>. The detection is based on&nbsp;</span><strong>conditional exclusive compression</strong><span>, namely using a FCM (Markov model), of high context order (typically 20). For visualisation, Smash outputs a&nbsp;</span><strong>SVG image</strong><span>, with an&nbsp;</span><strong>ideogram</strong><span>output architecture, where the patterns are represented with several&nbsp;</span><strong>HSV values</strong><span>&nbsp;(only value varies). The method can perform both in small- and large-scale. Nevertheless is more directed to large-scale since that the main aim of the research is to&nbsp;</span><strong>know where the large-scale [chromosomal by chromosome] of several primates was equal/different, having at a glance a map of the entire genomes</strong><span>.</span></p><p>Address of the bookmark: <a href="http://bioinformatics.ua.pt/software/smash/" rel="nofollow">http://bioinformatics.ua.pt/software/smash/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29992/spines</guid>
	<pubDate>Mon, 28 Nov 2016 05:33:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29992/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<p><a href="https://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a>&nbsp;is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages:&nbsp;<em>Satsuma,</em>&nbsp;a highly parallelized program for high-sensitivity, genome-wide synteny;&nbsp;<em>Papaya,</em>&nbsp;an all-purpose alignment tool for less diverged sequences; and&nbsp;<em>SLAP,</em>&nbsp;a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access&nbsp;<em>Spines</em>&nbsp;<a href="https://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/genome-sequencing-and-analysis/spines" rel="nofollow">https://www.broadinstitute.org/genome-sequencing-and-analysis/spines</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30701/harvest</guid>
	<pubDate>Tue, 31 Jan 2017 10:57:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30701/harvest</link>
	<title><![CDATA[Harvest]]></title>
	<description><![CDATA[<p>Harvest is a suite of core-genome alignment and visualization tools for quickly analyzing thousands of intraspecific microbial genomes, including variant calls, recombination detection, and phylogenetic trees.</p>
<p><a href="http://harvest.readthedocs.io/en/latest/_images/screen.png"><img src="http://harvest.readthedocs.io/en/latest/_images/screen.png" alt="_images/screen.png" style="border: 0px;"></a><span></span></p>
<p><strong>Tools</strong></p>
<ul>
<li><a href="http://harvest.readthedocs.io/en/latest/content/parsnp.html">Parsnp</a>&nbsp;- Core-genome alignment and analysis</li>
<li><a href="http://harvest.readthedocs.io/en/latest/content/gingr.html">Gingr</a>&nbsp;- Interactive visualization of alignments, trees and variants</li>
<li><a href="http://harvest.readthedocs.io/en/latest/content/harvest-tools.html">HarvestTools</a>&nbsp;- Archiving and postprocessing</li>
</ul>
<p><strong>Citation</strong></p>
<blockquote>
<div>Treangen TJ, Ondov BD, Koren S, Phillippy AM. The Harvest suite for rapid core-genome alignment and visualization of thousands of intraspecific microbial genomes. Genome Biology, 15 (11), 1-15 [<a href="http://www.biomedcentral.com/content/pdf/s13059-014-0524-x.pdf">PDF</a>]</div>
</blockquote><p>Address of the bookmark: <a href="http://harvest.readthedocs.io/en/latest/index.html" rel="nofollow">http://harvest.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</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/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32853/progressivecactus</guid>
	<pubDate>Thu, 18 May 2017 05:29:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32853/progressivecactus</link>
	<title><![CDATA[progressiveCactus]]></title>
	<description><![CDATA[<p><span>Progressive Cactus is a whole-genome alignment package.</span></p>
<p><span><span>Distribution package for the Prgressive Cactus multiple genome aligner. Dependencies are linked as submodules</span></span></p>
<p>https://github.com/glennhickey/progressiveCactus</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>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</guid>
	<pubDate>Thu, 23 Nov 2017 17:15:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34404/sima-c-implementation-simultaneous-multiple-alignment-of-lcms-peak-lists</link>
	<title><![CDATA[SIMA C++ Implementation: Simultaneous Multiple Alignment of LC/MS Peak Lists]]></title>
	<description><![CDATA[<p style="text-align: justify;">This is the c++ implementation for SIMA - Simultaneous Multiple Alignment of LC/MS Peak Lists. The package contains C++ source code as well as two binary files. The latter were tested under various operating systems, including Windows XP SP3 32bit, Windows Vista 32bit, Windows 2008 Server, Windows 7 32bit and 64bit, Ubuntu 10.04 64bit, Ubuntu 10.10 64bit, and gentoo AMD64.</p>
<p style="text-align: justify;">The corresponding publication can be found here:</p>
<p style="text-align: justify;">B. Voss*, M. Hanselmann*, B.Y. Renard, M.S. Lindner, U. K&ouml;the, M. Kirchner, F.A. Hamprecht (2011). SIMA: Simultaneous Muliple Alignment of LC/MS Peak Lists, Bioinformatics 27(7):987-993.&nbsp;<a href="http://dx.doi.org/10.1093/bioinformatics/btr051">[doi]</a>&nbsp;<a href="https://hciweb.iwr.uni-heidelberg.de/sites/default/files/node/files/517307327/hanselmann_11_sima.pdf">[techreport]</a></p><p>Address of the bookmark: <a href="https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima" rel="nofollow">https://hciweb.iwr.uni-heidelberg.de/hci/softwares/sima</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</guid>
	<pubDate>Mon, 31 Jul 2017 04:11:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</link>
	<title><![CDATA[Quota synteny alignment]]></title>
	<description><![CDATA[<p><span>Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use&nbsp;</span><em>ad-hoc</em><span>&nbsp;rules to screen these blocks. So the question is:&nbsp;</span><span>given the expected depth (quota) along both x- and y-axis, select a subset of the anchors with maximized total score</span><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/quota-alignment" rel="nofollow">https://github.com/tanghaibao/quota-alignment</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>