<?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/27438?offset=320</link>
	<atom:link href="https://bioinformaticsonline.com/related/27438?offset=320" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</guid>
	<pubDate>Wed, 28 Feb 2018 03:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</link>
	<title><![CDATA[Genome assembly stats plotting]]></title>
	<description><![CDATA[<p>A&nbsp;<em>de novo</em>&nbsp;genome assembly can be summarised b</p>
<p>y a number of metrics, including:</p>
<ul>
<li>Overall assembly length</li>
<li>Number of scaffolds/contigs</li>
<li>Length of longest scaffold/contig</li>
<li>Scaffold/contig N50 and N90Assembly base composition, in particular percentage GC and percentage Ns</li>
<li>CEGMA completeness</li>
<li>Scaffold/contig length/count distribution</li>
</ul>
<p>assembly-stats supports two widely used presentations of these values, tabular and cumulative length plots, and introduces an additional circular plot that summarises most commonly used assembly metrics in a single visualisation. Each of these presentations is generated using javascript from a common (JSON) data structure, allowing toggling between alternative views, and each can be applied to a single or multiple assemblies to allow direct comparison of alternate assemblies.</p>
<p>Tabular presentation allows direct comparison of exact values between assemblies, the limitations of this approach lie in the necessary omission of distributions and the challenge of interpreting ratios of values that may vary by several orders of magnitude.</p><p>Address of the bookmark: <a href="https://github.com/rjchallis/assembly-stats" rel="nofollow">https://github.com/rjchallis/assembly-stats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</guid>
	<pubDate>Thu, 27 Sep 2018 07:08:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37785/haplomerger2-rebuilding-both-haploid-sub-assemblies-from-high-heterozygosity-diploid-genome-assembly</link>
	<title><![CDATA[HaploMerger2: rebuilding both haploid sub-assemblies from high-heterozygosity diploid genome assembly]]></title>
	<description><![CDATA[<p><span><span>HM2 can process any diploid assemblies, but it is especially suitable for diploid assemblies with high heterozygosity (&ge;3%), which can be difficult for other tools. This pipeline also implements flexible and sensitive assembly error detection, a hierarchical scaffolding procedure and a reliable gap-closing method for haploid sub-assemblies.</span></span></p>
<p><span>Source code, executables and the testing dataset are freely available at&nbsp;</span><a href="https://github.com/mapleforest/HaploMerger2/releases/" target="">https://github.com/mapleforest/HaploMerger2/releases/</a><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/mapleforest/HaploMerger2/releases/" rel="nofollow">https://github.com/mapleforest/HaploMerger2/releases/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</guid>
	<pubDate>Fri, 30 Sep 2016 10:22:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29276/murasaki</link>
	<title><![CDATA[Murasaki]]></title>
	<description><![CDATA[<p>Murasaki is an anchor alignment program that is</p>
<ul style="margin-left: 16px;">
<li>exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))</li>
<li>scalable (Arbitrarily parallelizable across multiple nodes using MPI)</li>
<li>memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)</li>
<li>unlimited by pattern length or selection</li>
<li>repeat tolerant</li>
</ul>
<p><img src="http://murasaki.dna.bio.keio.ac.jp/9mammals-small.png" width="500" height="375" alt="image" style="border: 0px;"></p><p>Address of the bookmark: <a href="http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki" rel="nofollow">http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</guid>
	<pubDate>Fri, 01 Feb 2019 11:55:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/38886/evaluation-of-genome-assembly-software-based-on-long-reads</link>
	<title><![CDATA[Evaluation of genome assembly software based on long reads]]></title>
	<description><![CDATA[<p>TGS technologies have been used to produce highly accurate de novo assemblies of hundreds of microbial genomes and highly contiguous reconstructions of many dozens of plant and animal genomes, enabling new insights into evolution and sequence diversity. They have also been applied to resequencing analyses, to create detailed maps of structural variations in many species. Also, these new technologies have been used to fill in many of the gaps in the human reference genome.</p><p>In this report, we compare and evaluate several genome assembly software based on TSG technology. The experimentation has been performed on 4 reference genomes and the results evaluated with the QUAST software. The 11 software that have been evaluated are: Celera Assembler , Falcon , Miniasm, Newbler , SGA Assembler, Smartdenovo, Abruijn, Ra, DBG2OLC, Spades and Cerulean. The first 8 software use only long reads, while the 3 last software can merge long and short reads</p>]]></description>
	<dc:creator>BioStar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/38886" length="382699" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</guid>
	<pubDate>Tue, 04 Oct 2016 14:50:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29305/miro-mirna-omics</link>
	<title><![CDATA[MIRO : miRNA omics]]></title>
	<description><![CDATA[<p><span>The MIRO (the miRNA omics) pipeline is a flexible and powerful tool for the analysis of miRNA (or more generall short RNA) expression using short-read deep sequencing data. In its present implementation MIRO is especially adapted for the analysis of reads generated with the Illumina sequencing platform. MIRO allows to preprocess the Solexa-reads, map them flexibly to several reference genomes using one of four different mappers, create differential gene (miRNA) expression profiles and cluster reads using one of several algorithm. MIRO output is furthermore compatible with software such as genome browsers and miRDeep.</span></p><p>Address of the bookmark: <a href="http://seq.crg.es/download/software/Miro/" rel="nofollow">http://seq.crg.es/download/software/Miro/</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/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</guid>
	<pubDate>Tue, 10 Mar 2020 07:52:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41397/svaba-structural-variation-and-indel-detection-by-local-assembly</link>
	<title><![CDATA[SvABA: Structural variation and indel detection by local assembly]]></title>
	<description><![CDATA[<p><span>SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of&nbsp;</span><a href="https://github.com/jts/sga">SGA</a><span>&nbsp;(String Graph Assembler) by Jared Simpson, and&nbsp;</span><a href="https://github.com/lh3/bwa">BWA-MEM</a><span>&nbsp;by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using&nbsp;</span><a href="https://github.com/walaj/VariantBam">VariantBam</a><span>&nbsp;rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.</span></p><p>Address of the bookmark: <a href="https://github.com/walaj/svaba" rel="nofollow">https://github.com/walaj/svaba</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</guid>
	<pubDate>Thu, 03 Nov 2016 04:55:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29601/statistics-using-r-with-biological-examples</link>
	<title><![CDATA[Statistics Using R   with Biological Examples]]></title>
	<description><![CDATA[<p>This book is a manifestation of my desire to teach researchers in biology a bit more about statistics than an ordinary introductory course covers and to introduce the utilization of R as a tool for analyzing their data. My goal is to reach those with little or no training in higher level statistics so that they can do more of their own data analysis, communicate more with statisticians, and appreciate the great potential statistics has to offer as a tool to answer biological questions. </p><p>This is necessary in light of the increasing use of higher level statistics in biomedical research. I hope it accomplishes this mission and encourage its free distribution and use as a course text or supplement.</p><p>K Seefeld, May 2007</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29601" length="4581031" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</guid>
	<pubDate>Fri, 01 May 2020 03:00:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41592/refka-a-fast-and-efficient-long-read-genome-assembly-approach-for-large-and-complex-genomes</link>
	<title><![CDATA[RefKA: A fast and efficient long-read genome assembly approach for large and complex genomes]]></title>
	<description><![CDATA[<p><span>RefKA, a reference-based approach for long read genome assembly. This approach relies on breaking up a closely related reference genome into bins, aligning k-mers unique to each bin with PacBio reads, and then assembling each bin in parallel followed by a final bin-stitching step.</span></p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/AppliedBioinformatics/RefKA" rel="nofollow">https://github.com/AppliedBioinformatics/RefKA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>