<?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/37650?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/37650?offset=380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</guid>
	<pubDate>Thu, 14 May 2020 15:13:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41675/gapfinisher-a-reliable-gap-filling-pipeline-for-sspace-longread-scaffolder-output</link>
	<title><![CDATA[gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output]]></title>
	<description><![CDATA[<p>gapFinisher to process SSPACE-LongRead output to fill gaps after the scaffolding. gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines.</p>
<p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6733440/</p><p>Address of the bookmark: <a href="https://github.com/kammoji/gapFinisher" rel="nofollow">https://github.com/kammoji/gapFinisher</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</guid>
	<pubDate>Thu, 29 Aug 2013 15:10:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4100/should-you-get-sequenced-not-all-bad-genes-predict-disease</link>
	<title><![CDATA[Should you get sequenced? Not all bad genes predict disease]]></title>
	<description><![CDATA[<p><span>&ldquo;What we really don&rsquo;t know yet is whether the predictive aspects of the genome are going to turn out to be beneficial or potentially harmful&rdquo;</span></p>
<p><span><span>&ldquo;As we roll out genomic medicine we are fighting against this society-wide misconception that having the bad gene means you&rsquo;re going to get the disease. That&rsquo;s only true in a very few cases.&rdquo;</span></span></p>
<p><span><span><strong>Source</strong>:Today Health</span></span></p><p>Address of the bookmark: <a href="http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154" rel="nofollow">http://www.today.com/health/should-you-get-sequenced-not-all-bad-genes-predict-disease-8C11017154</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6130/rna-bioinformatics-and-high-throughput-analysis-jena</guid>
  <pubDate>Sat, 09 Nov 2013 20:03:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[RNA Bioinformatics and High Throughput Analysis Jena]]></title>
  <description><![CDATA[
<p>Research Topics:</p>

<p>High Throughput Sequencing Analysis<br />Comparative Genomics<br />Identification and Annotation of Non-coding RNAs<br />Bioinformatic Analysis and System Biology of Viruses<br />Coevolution of Proteins and RNAs<br />Algorithmic Bioinformatics<br />Phylogenetic Analysis</p>

<p>http://www.rna.uni-jena.de/index.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10093/bio-rad-acquires-gnubio</guid>
	<pubDate>Sat, 19 Apr 2014 10:36:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10093/bio-rad-acquires-gnubio</link>
	<title><![CDATA[Bio-Rad Acquires GnuBIO]]></title>
	<description><![CDATA[<p>http://www.businesswire.com/news/home/20140411005331/en/Bio-Rad-Acquires-GnuBIO-Developer-Droplet-Based-DNA-Sequencing#.U1KXnPm1b8o</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10246/deadly-human-pathogen-cryptococcus-sequenced</guid>
	<pubDate>Fri, 25 Apr 2014 11:02:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10246/deadly-human-pathogen-cryptococcus-sequenced</link>
	<title><![CDATA[Deadly Human Pathogen Cryptococcus  Sequenced]]></title>
	<description><![CDATA[<p><span>"Now, researchers have sequenced the entire genome and all the RNA products of the most important pathogenic lineage of Cryptococcus neoformans, a strain called H99. The results, which appear in&nbsp;</span><em>PLOS Genetics</em><span>, also describe a number of genetic changes that can occur after laboratory handling of H99 that make it more susceptible to stress, hamper its ability to sexually reproduce and render it less virulent."</span></p><p><span><strong>Source</strong>:</span></p><p><span>http://www.biosciencetechnology.com/news/2014/04/deadly-human-pathogen-cryptococcus-fully-sequenced</span></p><p><span><strong>Paper</strong>:</span></p><p><span>http://www.plosgenetics.org/article/info%3Adoi%2F10.1371%2Fjournal.pgen.1004292</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11365/drawback-of-exome-sequencing</guid>
	<pubDate>Mon, 02 Jun 2014 05:46:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11365/drawback-of-exome-sequencing</link>
	<title><![CDATA[Drawback of Exome Sequencing]]></title>
	<description><![CDATA[<p><span><span>Dr Eric Londin, Assistant Professor, Thomas Jefferson University, USA, stated that analysis of 44 exome datasets from four different testing kits showed that they missed a high proportion of clinically relevant regions in the 56 ACMG genes. "At least one gene in each exome method was missing more than 40 percent of disease-causing genetic variants, and we found that the worst-performing method missed more than 90 percent of such variants in four of the 56 genes," he says.</span><br /></span></p><p><span><strong>Source</strong>:&nbsp;http://www.eurekalert.org/pub_releases/2014-05/esoh-pco052914.php</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23167/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Mon, 06 Jul 2015 08:46:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23167/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap is a novel mapper targeted at aligning long, error-prone third-generation sequencing data.<br>It is&nbsp;<strong>designed to handle Oxford Nanopore MinION 1d and 2d reads</strong>&nbsp;with very high sensitivity and accuracy, and also presents a significant improvement over the state-of-the-art for PacBio read mappers.</p>
<p>GraphMap was also designed for ease-of-use: the&nbsp;<strong>default parameters</strong>&nbsp;can handle a wide range of read lengths and error profiles, including:&nbsp;<em>Illumina</em>,&nbsp;<em>PacBio</em>&nbsp;and&nbsp;<em>Oxford Nanopore</em>.<br>This is an especially important feature for technologies where the error rates and error profiles can vary widely across, or even within, sequencing runs.</p>
<p><a href="http://biorxiv.org/content/early/2015/06/10/020719">http://biorxiv.org/content/early/2015/06/10/020719</a></p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</guid>
	<pubDate>Mon, 26 Aug 2019 18:07:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39875/lrsday-long-read-sequencing-data-analysis-for-yeasts</link>
	<title><![CDATA[LRSDAY: Long-read Sequencing Data Analysis for Yeasts]]></title>
	<description><![CDATA[<p><span>Long-read sequencing technologies have become increasingly popular in genome projects due to their strengths in resolving complex genomic regions. As a leading model organism with small genome size and great biotechnological importance, the budding yeast,&nbsp;</span><em>Saccharomyces cerevisiae</em><span>, has many isolates currently being sequenced with long reads.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/yjx1217/LRSDAY" rel="nofollow">https://github.com/yjx1217/LRSDAY</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>