<?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/42166?offset=240</link>
	<atom:link href="https://bioinformaticsonline.com/related/42166?offset=240" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</guid>
	<pubDate>Thu, 01 Sep 2016 11:47:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29004/r-chie</link>
	<title><![CDATA[R-chie]]></title>
	<description><![CDATA[<p><strong>R-chie</strong><span>&nbsp;allows you to make arc diagrams of RNA secondary structures, allowing for easy comparison and overlap of two structures, rank and display basepairs in colour and to also visualize corresponding multiple sequence alignments and co-variation information.</span><br><strong>R4RNA</strong><span>&nbsp;is the R package powering R-chie, available for&nbsp;</span><a href="http://www.e-rna.org/r-chie/download.cgi">download</a><span>&nbsp;and local use for more customized figures and scripting.</span></p>
<p>http://www.e-rna.org/r-chie/plot.cgi?eg=single</p><p>Address of the bookmark: <a href="http://www.e-rna.org/r-chie/plot.cgi?eg=single" rel="nofollow">http://www.e-rna.org/r-chie/plot.cgi?eg=single</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/file/view/29108/assembly-tutorial-ppt</guid>
	<pubDate>Wed, 07 Sep 2016 03:12:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29108/assembly-tutorial-ppt</link>
	<title><![CDATA[Assembly tutorial PPT]]></title>
	<description><![CDATA[<p>Saved Cornell University assembly workshop PPT.</p><p>Reference:&nbsp;</p><p>http://cbsu.tc.cornell.edu/lab/doc/assembly_workshop_20150420_lecture1.pdf</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29108" length="1617402" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</guid>
	<pubDate>Sun, 04 Nov 2018 16:44:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38063/referee-genome-assembly-quality-scores</link>
	<title><![CDATA[Referee: Genome assembly quality scores]]></title>
	<description><![CDATA[<p>Modern genome sequencing technologies provide a succint measure of quality at each position in every read, however all of this information is lost in the assembly process. Referee summarizes the quality information from the reads that map to a site in an assembled genome to calculate a quality score for each position in the genome assembly.</p>
<p>We accomplish this by first calculating genotype likelihoods for every site. For a given site in a diploid genome, there are 10 possible genotypes (AA, AC, AG, AT, CC, CG, CT, GG, GT, TT). Referee takes as input the genotype likelihoods calculated for all 10 genotypes given the called reference base at each position.</p>
<h3>Referee is a program to calculate a quality score for every position in a genome assembly. This allows for easy filtering of low quality sites for any downstream analysis.</h3>
<p>https://github.com/gwct/referee</p><p>Address of the bookmark: <a href="https://gwct.github.io/referee/#" rel="nofollow">https://gwct.github.io/referee/#</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29144/fermi</guid>
	<pubDate>Fri, 09 Sep 2016 05:37:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29144/fermi</link>
	<title><![CDATA[FERMI]]></title>
	<description><![CDATA[<p><span>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;</span><span>short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;</span><span>typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;</span><span>collapsed by other assemblers. Its ultimate goal is to find a minimal set of</span><br><span>unitigs to represent all the information in raw reads.</span><br><br><span>Fermi follows the overlap-layout-consensus paradigm and uses the FM-DNA-index&nbsp;</span><span>(FMD-index) as the key data structure. It is inspired by the string graph&nbsp;</span><span>assembler (Simpson and Durbin, 2010 and 2012) and has a similar workflow.</span><br><br><span>As a typical de novo assembler, fermi tends to produce contigs with slightly&nbsp;</span><span>longer N50. However, the major weakness of fermi is the high misassembly rate.&nbsp;</span><span>Although fermi provides a tool to fix misassemblies by using paired-end reads&nbsp;</span><span>to achieve an accuracy comparable to other assemblers, this is not a favorable&nbsp;</span><span>solution.</span><br><br><span>Fermi is designed to be used on a multi-core Linux machine with large shared&nbsp;</span><span>memory. The easiest way to run fermi is to use the run-fermi.pl script. It&nbsp;</span><span>generates a Makefile. The actual assembly is done by invoking make. Premature&nbsp;</span><span>assembly processes can be resumed. Here is an example:</span><br><br><span>run-fermi.pl -dAPe ./fermi -p NA12878 -t16 -f18 reads*.fq.gz &gt; NA12878.mak</span><br><span>make -f NA12878.mak -j16</span></p><p>Address of the bookmark: <a href="https://github.com/lh3/fermi" rel="nofollow">https://github.com/lh3/fermi</a></p>]]></description>
	<dc:creator>Jit</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/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/29500/genomescope-open-source-web-tool-to-rapidly-estimate-the-overall-characteristics-of-a-genome-including-genome-size-heterozygosity-rate-and-repeat-content-from-unprocessed-short-reads</guid>
	<pubDate>Fri, 21 Oct 2016 05:46:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29500/genomescope-open-source-web-tool-to-rapidly-estimate-the-overall-characteristics-of-a-genome-including-genome-size-heterozygosity-rate-and-repeat-content-from-unprocessed-short-reads</link>
	<title><![CDATA[GenomeScope: open-source web tool to rapidly estimate the overall characteristics of a genome, including genome size, heterozygosity rate, and repeat content from unprocessed short reads]]></title>
	<description><![CDATA[<div>
<div>
<div>
<div id="content-block-markup">
<div>
<div id="abstract-1">
<p id="p-2">Summary: GenomeScope is an open-source web tool to rapidly estimate the overall characteristics of a genome, including genome size, heterozygosity rate, and repeat content from unprocessed short reads. These features are essential for studying genome evolution, and help to choose parameters for downstream analysis. We demonstrate its accuracy on 324 simulated and 16 real datasets with a wide range in genome sizes, heterozygosity levels, and error rates. Availability and Implementation: http://qb.cshl.edu/genomescope/, https://github.com/schatzlab/genomescope.git</p>
</div>
<span></span></div>
<span></span></div>
</div>
</div>
</div><p>Address of the bookmark: <a href="http://qb.cshl.edu/genomescope/" rel="nofollow">http://qb.cshl.edu/genomescope/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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>