<?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/39329?offset=30</link>
	<atom:link href="https://bioinformaticsonline.com/related/39329?offset=30" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Wed, 08 Nov 2017 11:40:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34235/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span><span>Illumina Sequencing data can provide high coverage of a genome by relatively short (most often 100 bp to 150 bp) reads at a low cost. Even with low (advertised 1%) error rate, 100 &times; coverage Illumina data on average has an error in some read at every base in the genome. These errors make handling the data more complicated because they result in a large number of low-count erroneous&nbsp;</span><em>k</em><span>-mers in the reads. However, there is enough information in the reads to correct most of the sequencing errors, thus making subsequent use of the data (e.g. for mapping or assembly) easier. Here we use the term &ldquo;error correction&rdquo; to denote the reduction in errors due to both changes in individual bases and trimming of unusable sequence. We developed an error correction software called QuorUM. QuorUM is mainly aimed at error correcting Illumina reads for subsequent assembly. It is designed around the novel idea of minimizing the number of distinct erroneous&nbsp;</span><em>k</em><span>-mers in the output reads and preserving the most true&nbsp;</span><em>k</em><span>-mers, and we introduce a composite statistic &pi; that measures how successful we are at achieving this dual goal. We evaluate the performance of QuorUM by correcting actual Illumina reads from genomes for which a reference assembly is available.</span></span></p>
<p><span>QuorUM is distributed as an independent software package and as a module of the MaSuRCA assembly software. Both are available under the GPL open source license at&nbsp;</span><a href="http://www.genome.umd.edu/">http://www.genome.umd.edu</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0130821</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</guid>
	<pubDate>Tue, 01 Jan 2019 12:01:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38563/hecil-a-hybrid-error-correction-algorithm-for-long-reads-with-iterative-learning</link>
	<title><![CDATA[HECIL: A Hybrid Error Correction Algorithm for Long Reads with Iterative Learning]]></title>
	<description><![CDATA[<p><span>HECIL&mdash;Hybrid Error Correction with Iterative Learning&mdash;a hybrid error correction framework that determines a correction policy for erroneous long reads, based on optimal combinations of decision weights obtained from short read alignments.&nbsp;</span></p>
<p><span><span>HECIL&rsquo;s core algorithm by introducing an iterative learning paradigm that enhances the correction policy at each iteration by incorporating knowledge gathered from previous iterations via data-driven confidence metrics assigned to prior corrections.</span></span></p><p>Address of the bookmark: <a href="https://github.com/NDBL/HECIL" rel="nofollow">https://github.com/NDBL/HECIL</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/36952/getoptspl-file</guid>
	<pubDate>Fri, 15 Jun 2018 04:43:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/36952/getoptspl-file</link>
	<title><![CDATA[getopts.pl file]]></title>
	<description><![CDATA[
<p>SSPACE_longread complain for getopts.pl file. </p>

<p>To resolve this, download and have in SSPACED-Longreads folder. </p>

<p>Cheers :)</p>
]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/36952" length="942" type="text/plain" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/2383/golden-rules-of-bioinformatics</guid>
	<pubDate>Wed, 14 Aug 2013 21:11:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/2383/golden-rules-of-bioinformatics</link>
	<title><![CDATA[Golden Rules of Bioinformatics]]></title>
	<description><![CDATA[<ol>
<li>All constant are variable.</li>
<li>Copy and paste is a genetic error.</li>
<li>First solve the problem, then write the code.</li>
<li>No matter what goes wrong, it will probably look right.</li>
<li>Any simple problem can be insoluble if enough metting are held to discuss it. :P</li>
<li>Stastics is a systematic method of comming to the wrong conclusion with confidence.</li>
<li>Bug is a undocumented feature in programming languages.</li>
<li>Good biological programmer goes on summer holiday with raincoat. [because see 1]</li>
<li>Thanks god Google know python is not a python and multiplication and division are the same thing.</li>
<li>Don' be clever, complex biology will trick you.</li>
</ol>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/4194/what-a-bioinformatician-always-dream-for</guid>
	<pubDate>Tue, 03 Sep 2013 15:31:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/4194/what-a-bioinformatician-always-dream-for</link>
	<title><![CDATA[What a bioinformatician always dream for ???]]></title>
	<description><![CDATA[<ol style="color: #000000; background-color: #ffffff;">
<li>Well established bioinformatics labs with SGI(silicon graphics interface)</li>
<li>License of all commercial softwares.</li>
<li>Complete, and&nbsp;fully assembled genome of the girl :P</li>
<li>A girl/boy with lesser E-values and higher compatibility score.</li>
<li>Horoscope Match should be significant (not less that 18).</li>
<li>Laptops with broadband connections.</li>
<li>Licence to almost all genomics and proteomics servers.</li>
<li>All eBooks of bioinformatics.</li>
<li>Ready passport and Study visa.</li>
</ol>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/5964/alien-spy</guid>
	<pubDate>Wed, 30 Oct 2013 19:12:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/5964/alien-spy</link>
	<title><![CDATA[Alien Spy !!!]]></title>
	<description><![CDATA[<p>Alien spy are looking for human genome sequences ..&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/5964" length="15626" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/fun/view/8509/the-best-bioinformatics-computational-biology-quotes</guid>
	<pubDate>Wed, 26 Feb 2014 17:50:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/fun/view/8509/the-best-bioinformatics-computational-biology-quotes</link>
	<title><![CDATA[The Best Bioinformatics / Computational Biology Quotes]]></title>
	<description><![CDATA[<p><img src="http://bioinformaticsonline.com/mod//photo/hahaha.png" style="border: 0; border: 0px;" alt="image"></p><p>Bioinformatician are not anti-social; We are just genome friendly.</p><p>Bioinformatician would love to change the biological world, but they won't give us the genetic code :P</p><p>If at first you don't succeed; call it version 1.0</p><p>The glass is neither half-full nor half-empty: it's actually have several genomes.</p><p>I'm BioGeek.</p><p>Fedup with LIPS, try God script.</p><p>Idiot, Go ahead, make my data!</p><p>Thank god, my genome just compiled.</p><p>Error message: "Out of space on genome drive:"</p><p>Shut up mobile elements, or i'll flush you out.</p><p>Never underestimate the internet bandwidth, u gotta incomplete.</p><p>Applied fuzzy logic to understand God's logic?</p><p>Warning! Overflow, delete chromosome !</p><p>Be nice to the BioGeek, for all you know they might be the next curator!</p><p>Beware of computational biologist they screw genes and protein.</p><p>Warning! Your genome is full of garbage, delete it !</p><p>Bad or missing mouse genome. Spank the cat? (Y/N)</p><p>Genome make very fast, very accurate mistakes.</p><p>Let's BLAST it.</p><p>Some genome never has transposons. It just develops random features.</p><p>Go watch CINEMA and have BLAST.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/14221/bioinformatician-at-work</guid>
	<pubDate>Wed, 20 Aug 2014 22:20:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/14221/bioinformatician-at-work</link>
	<title><![CDATA[Bioinformatician at work !!!]]></title>
	<description><![CDATA[<p>The busy life of a bioinformatician. Need many more hands to deal with additional job :)</p>]]></description>
	<dc:creator>Neel</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/14221" length="1439785" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/19560/alien-genome</guid>
	<pubDate>Sat, 13 Dec 2014 00:24:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/19560/alien-genome</link>
	<title><![CDATA[Alien Genome !!!]]></title>
	<description><![CDATA[<p>Genome sequencing, analysis and expression of Alien genome.</p><p>Note: This image/cartoon is create only for fun. It has nothing to do with any scientific findings.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/19560" length="40389" type="image/jpeg" />
</item>

</channel>
</rss>