<?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/42148?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/42148?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</guid>
	<pubDate>Sun, 31 May 2020 01:59:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41734/supernova-generates-phased-whole-genome-de-novo-assemblies-from-a-chromium-prepared-library</link>
	<title><![CDATA[Supernova: generates phased, whole-genome de novo assemblies from a Chromium-prepared library.]]></title>
	<description><![CDATA[<p>Supernova generates phased, whole-genome&nbsp;<em>de novo</em>&nbsp;assemblies from a Chromium-prepared library.</p>
<p>Please see&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/guidance/doc/achieving-success-with-de-novo-assembly">Achieving Success with De Novo Assembly</a>&nbsp;and&nbsp;<a href="https://support.10xgenomics.com/de-novo-assembly/software/overview/system-requirements">System Requirements</a>&nbsp;<em>before</em>&nbsp;creating your Chromium libraries for assembly.</p>
<p>Supernova should be run using 38-56x coverage of the genome.<br>&bull; Somewhat higher coverage is&nbsp;<em>sometimes</em>&nbsp;advantageous.<br>&bull; Supernova will exit if it finds that coverage is far from the recommended range.<br>&bull; Note that at most 2.14 billion reads are allowed.<br>&bull; Please note that we have not extensively tested genomes larger than human, and any genome above approximately 4 GB should be considered experimental and is not supported.</p><p>Address of the bookmark: <a href="https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running" rel="nofollow">https://support.10xgenomics.com/de-novo-assembly/software/pipelines/latest/using/running</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</guid>
	<pubDate>Thu, 15 Dec 2016 05:47:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30149/mypro-a-seamless-pipeline-for-automated-prokaryotic-genome-assembly-and-annotation</link>
	<title><![CDATA[MyPro: A seamless pipeline for automated prokaryotic genome assembly and annotation]]></title>
	<description><![CDATA[<p>MyPro is an improved genomics software pipeline for prokaryotic genomes. MyPro is user-friendly and requires minimal programming skills. High-quality prokaryotic genome assembly and annotation can be obtained with ease. It performed better than de novo assemblers and contig integration software. Produces more contiguous assemblies, higher N50 values and lower number of contigs.</p>
<p>More at https://sourceforge.net/projects/sb2nhri/files/MyPro/</p><p>Address of the bookmark: <a href="http://www.sciencedirect.com/science/article/pii/S0167701215001207" rel="nofollow">http://www.sciencedirect.com/science/article/pii/S0167701215001207</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</guid>
	<pubDate>Tue, 14 Jul 2020 06:42:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</link>
	<title><![CDATA[ShadowCaster: a hybrid approach for the detection of horizontal gene transfer events in prokaryotes]]></title>
	<description><![CDATA[<p><span>ShadowCaster implements an evolutionary model to calculate Bayesian likelihoods for each &lsquo;alien genes&rsquo; with an unusual sequence composition according to the host genome background to detect HGT events in prokaryotes.</span></p>
<p><a href="https://www.mdpi.com/2073-4425/11/7/756/htm">https://www.mdpi.com/2073-4425/11/7/756/htm</a></p>
<p><a href="https://shadowcaster.readthedocs.io/en/latest/">https://shadowcaster.readthedocs.io/en/latest/</a></p>
<p><a href="https://github.com/dani2s/ShadowCaster_testData">https://github.com/dani2s/ShadowCaster_testData</a></p><p>Address of the bookmark: <a href="https://github.com/dani2s/ShadowCaster" rel="nofollow">https://github.com/dani2s/ShadowCaster</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</guid>
	<pubDate>Tue, 03 Jul 2018 04:09:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</link>
	<title><![CDATA[ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly]]></title>
	<description><![CDATA[With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries.

Texas A&amp;M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory.

Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice.

Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.<p>Address of the bookmark: <a href="http://faculty.cse.tamu.edu/shsze/asplice/" rel="nofollow">http://faculty.cse.tamu.edu/shsze/asplice/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37498/nextsv-a-meta-caller-for-structural-variants-from-low-coverage-long-read-sequencing-data</guid>
	<pubDate>Mon, 06 Aug 2018 17:24:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37498/nextsv-a-meta-caller-for-structural-variants-from-low-coverage-long-read-sequencing-data</link>
	<title><![CDATA[NextSV: a meta-caller for structural variants from low-coverage long-read sequencing data]]></title>
	<description><![CDATA[<p>NextSV, a meta SV caller and a computational pipeline to perform SV calling from low coverage long-read sequencing data. NextSV integrates three aligners and three SV callers and generates two integrated call sets (sensitive/stringent) for different analysis purpose. The output of NextSV is in ANNOVAR-compatible bed format. Users can easily perform downstream annotation using ANNOVAR and disease gene discovery using Phenolyzer.</p>
<p>&nbsp;</p>
<h2>&nbsp;</h2><p>Address of the bookmark: <a href="https://github.com/Nextomics/NextSV" rel="nofollow">https://github.com/Nextomics/NextSV</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</guid>
	<pubDate>Sun, 14 Apr 2019 20:35:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39253/gmass-a-novel-measure-for-genomeassembly-structural-similarity</link>
	<title><![CDATA[GMASS: a novel measure for genomeassembly structural similarity]]></title>
	<description><![CDATA[<div id="Abstract">
<div id="ASec3">
<p id="Par3">The GMASS score is a novel measure for representing structural similarity between two assemblies. It will contribute to the understanding of assembly output and developing de novo assemblers.</p>
<p><a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z">https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2710-z</a></p>
</div>
</div><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php" rel="nofollow">http://bioinfo.konkuk.ac.kr/GMASS/htdocs/syncircos.php</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</guid>
	<pubDate>Sun, 31 Mar 2024 02:43:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44501/minda-a-tool-for-evaluating-structural-variant-sv-callers</link>
	<title><![CDATA[Minda: a tool for evaluating structural variant (SV) callers]]></title>
	<description><![CDATA[<p dir="auto">Minda is a tool for evaluating structural variant (SV) callers that</p>
<ul dir="auto">
<li>standardizes VCF records for compatibility with both germline and somatic SV callers,</li>
<li>benchmarks against a single VCF input file, or</li>
<li>benchmarks against an ensemble call set created from multiple VCF input files.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/KolmogorovLab/minda" rel="nofollow">https://github.com/KolmogorovLab/minda</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</guid>
	<pubDate>Tue, 30 Jun 2020 21:30:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41916/truvari-structural-variant-comparison-tool-for-vcfs</link>
	<title><![CDATA[truvari: Structural variant comparison tool for VCFs]]></title>
	<description><![CDATA[<p>Structural variant comparison tool for VCFs</p>
<p>Given benchmark and comparsion sets of SVs, calculate the recall, precision, and f-measure.</p>
<p><a href="https://github.com/spiralgenetics/www.spiralgenetics.com">Spiral Genetics</a></p>
<p><a href="https://docs.google.com/presentation/d/17mvC1XOpOm7khAbZwF3SgtG2Rl4M9Mro37yF2nN7GhE/edit">Motivation</a></p><p>Address of the bookmark: <a href="https://github.com/spiralgenetics/truvari" rel="nofollow">https://github.com/spiralgenetics/truvari</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>