<?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/30625?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/30625?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</guid>
	<pubDate>Wed, 13 Jul 2016 07:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</link>
	<title><![CDATA[Scarpa]]></title>
	<description><![CDATA[<p><strong>Scarpa</strong>&nbsp;is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate insert size distributions from data. Scarpa is available free of charge for academic and commercial use under the GNU General Public License (GPL).</p>
<p>See the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/hapsembler-2.21_manual.pdf">user manual</a>&nbsp;or the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/scarpa_paper.pdf">paper</a>&nbsp;for more information about Scarpa. Click&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/ScarpaSupplementary.pdf">here</a>&nbsp;for the supplementary material.</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/scarpa.html" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/scarpa.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</guid>
	<pubDate>Sat, 25 Nov 2017 08:57:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34413/coursera-genome-assembly-tutorial</link>
	<title><![CDATA[coursera genome assembly tutorial]]></title>
	<description><![CDATA[<p><span>Solutions to Coursera Genome Sequencing (Bioinformatics II)</span></p><p>Address of the bookmark: <a href="https://github.com/iansealy/coursera-assembly" rel="nofollow">https://github.com/iansealy/coursera-assembly</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</guid>
	<pubDate>Wed, 06 Dec 2017 02:08:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34528/cope-an-accurate-k-mer-based-pair-end-reads-connection-tool-to-facilitate-genome-assembly</link>
	<title><![CDATA[COPE: an accurate k-mer-based pair-end reads connection tool to facilitate genome assembly]]></title>
	<description><![CDATA[<p><span>An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30&times; simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE connected over 99% of reads with 98.8% accuracy, which is, respectively, 10 and 2% higher than the recently published tool FLASH. When COPE is applied to real reads for genome assembly, the resulting contigs are found to have fewer errors and give a 14-fold improvement in the N50 measurement when compared with the contigs produced using unconnected reads.</span></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/cope" rel="nofollow">ftp://ftp.genomics.org.cn/pub/cope</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</guid>
	<pubDate>Thu, 25 Oct 2018 10:46:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38008/quast-lg-versatile-genome-assembly-evaluation</link>
	<title><![CDATA[QUAST-LG: Versatile genome assembly evaluation]]></title>
	<description><![CDATA[<p>QUAST-LG-a tool that compares large genomic de novo assemblies against reference sequences and computes relevant quality metrics. Since genomes generally cannot be reconstructed completely due to complex repeat patterns and low coverage regions, we introduce a concept of upper bound assembly for a given genome and set of reads, and compute theoretical limits on assembly correctness and completeness. Using QUAST-LG, we show how close the assemblies are to the theoretical optimum, and how far this optimum is from the finished reference.</p>
<h4>AVAILABILITY AND IMPLEMENTATION:</h4>
<p>http://cab.spbu.ru/software/quast-lg</p><p>Address of the bookmark: <a href="http://cab.spbu.ru/software/quast-lg/" rel="nofollow">http://cab.spbu.ru/software/quast-lg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29272/decipher</guid>
	<pubDate>Fri, 30 Sep 2016 09:33:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29272/decipher</link>
	<title><![CDATA[DECIPHER]]></title>
	<description><![CDATA[<p>DECIPHER is a software toolset that can be used to maintain, analyze, and decipher large amounts of DNA sequence data. To install DECIPHER, see the <a href="http://DECIPHER.cee.wisc.edu/Download.html">Downloads</a> page.<br><br> To begin using DECIPHER read the "Getting Started DECIPHERing" tutorial. Refer to the PDF documents below for instructions on how to use DECIPHER for various tasks.</p><p>Address of the bookmark: <a href="http://decipher.cee.wisc.edu/Documentation.html" rel="nofollow">http://decipher.cee.wisc.edu/Documentation.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</guid>
	<pubDate>Fri, 31 Jan 2020 05:50:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40792/haslr-a-tool-for-rapid-genome-assembly-of-long-sequencing-reads</link>
	<title><![CDATA[HASLR: a tool for rapid genome assembly of long sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR is a tool for rapid genome assembly of long sequencing reads. HASLR is a hybrid tool which means it requires long reads generated by Third Generation Sequencing technologies (such as PacBio or Oxford Nanopore) together with Next Generation Sequencing reads (such as Illumina) from the same sample.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29574/beagle</guid>
	<pubDate>Thu, 27 Oct 2016 11:19:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29574/beagle</link>
	<title><![CDATA[Beagle]]></title>
	<description><![CDATA[<p>Beagle is a software package that performs genotype calling, genotype phasing, imputation of ungenotyped markers, and identity-by-descent segment detection.</p>
<p>Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the&nbsp;<a href="http://faculty.washington.edu/browning/beagle/release_notes" target="_blank">release notes</a>. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use&nbsp;<a href="https://faculty.washington.edu/browning/beagle/b4_0.html">version 4.0</a>.</p>
<p>If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.</p>
<p>The citation for Beagle's phasing algorithm is:</p>
<p>S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.<a href="http://dx.doi.org/doi:10.1086/521987" target="_blank">doi:10.1086/521987</a></p>
<p>The citation for Beagle's genotype imputation algorithm is:</p>
<p>B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.<a href="http://dx.doi.org/doi:10.1016/j.ajhg.2015.11.020" target="_blank">doi:10.1016/j.ajhg.2015.11.020</a></p>
<p>The citation for Beagle's IBD detection algorithm is:</p>
<p>B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.<a href="http://dx.doi.org/doi:10.1534/genetics.113.150029" target="_blank">doi:10.1534/genetics.113.150029</a></p><p>Address of the bookmark: <a href="http://faculty.washington.edu/browning/beagle/beagle.html" rel="nofollow">http://faculty.washington.edu/browning/beagle/beagle.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</guid>
	<pubDate>Wed, 25 Mar 2020 17:11:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41493/coronavirus-resources</link>
	<title><![CDATA[Coronavirus Resources !]]></title>
	<description><![CDATA[<p><span>2019nCoVR features comprehensive integration of genomic and proteomic sequences as well as their metadata information from the GISAID, NCBI, NMDC and CNCB/NGDC. It also incorporates a wide range of relevant information including scientific literatures, news, and popular articles for science dissemination, and provides visualization functionalities for genome variation analysis results based on all collected 2019-nCoV strains.</span></p>
<p><span>Annotation</span></p>
<p><span><a href="https://bigd.big.ac.cn/ncov/variation/annotation">https://bigd.big.ac.cn/ncov/variation/annotation</a></span></p>
<p><span>Genome wharehouse&nbsp;</span></p>
<p><span><a href="https://bigd.big.ac.cn/gwh/browse/index">https://bigd.big.ac.cn/gwh/browse/index</a></span></p>
<p>Released Genome</p>
<p><a href="https://bigd.big.ac.cn/ncov/release_genome">https://bigd.big.ac.cn/ncov/release_genome</a></p>
<p>Download data&nbsp;</p>
<p><a href="ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/">ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/</a></p>
<p>Raw data</p>
<p><a href="https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae">https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae</a></p><p>Address of the bookmark: <a href="https://bigd.big.ac.cn/ncov/about" rel="nofollow">https://bigd.big.ac.cn/ncov/about</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</guid>
	<pubDate>Thu, 03 Nov 2016 08:28:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29614/art-set-of-simulation-tools</link>
	<title><![CDATA[ART: Set of Simulation Tools]]></title>
	<description><![CDATA[<p>ART is a set of simulation tools to generate synthetic next-generation sequencing reads. ART simulates sequencing reads by mimicking real sequencing process with empirical error models or quality profiles summarized from large recalibrated sequencing data. ART can also simulate reads using user own read error model or quality profiles. ART supports simulation of single-end, paired-end/mate-pair reads of three major commercial next-generation sequencing platforms: Illumina's Solexa, Roche's 454 and Applied Biosystems' SOLiD. ART can be used to test or benchmark a variety of method or tools for next-generation sequencing data analysis, including read alignment, de novo assembly, SNP and structure variation discovery. ART was used as a primary tool for the simulation study of the <span><a href="http://www.1000genomes.org/" target="_blank">1000 Genomes Project<span></span></a></span> . ART is implemented in C++ with optimized algorithms and is highly efficient in read simulation. ART outputs reads in the FASTQ format, and alignments in the ALN format. ART can also generate alignments in the SAM alignment or UCSC BED file format. ART can be used together with genome variants simulators (e.g. <span><a href="http://bioinform.github.io/varsim/" target="_blank">VarSim<span></span></a></span>) for evaluating variant calling tools or methods.</p><p>Address of the bookmark: <a href="http://www.niehs.nih.gov/research/resources/software/biostatistics/art/" rel="nofollow">http://www.niehs.nih.gov/research/resources/software/biostatistics/art/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>