<?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/13267?offset=1070</link>
	<atom:link href="https://bioinformaticsonline.com/related/13267?offset=1070" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/45225/assistant-professor-genetics-genomics-evolution-and-development-molecular-cell-biology</guid>
  <pubDate>Fri, 14 Aug 2026 09:54:00 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor - Genetics, Genomics, Evolution, and Development - Molecular &amp; Cell Biology]]></title>
  <description><![CDATA[
<p>Salary range: The current salary range for this position is $84,100 - $132,900 (9-month academic year salary), however, off-scale salary and other components of pay, which would yield compensation that is higher than this range, are offered to meet competitive conditions.<br />Anticipated start: July 1, 2027<br />Application Window<br />Open date: July 27, 2026<br />Next review date: Monday, Oct 19, 2026 at 11:59pm (Pacific Time)<br />Apply by this date to ensure full consideration by the committee.<br />Final date: Monday, Oct 19, 2026 at 11:59pm (Pacific Time)<br />Applications will continue to be accepted until this date.<br />The Department of Molecular and Cell Biology (MCB) at the University of California, Berkeley invites applications for a tenure-track faculty position in the Genetics, Genomics, Evolution, and Development (GGED) Division, at the Assistant Professor level.</p>

<p>More at https://evoldir.net/brian/evoldir/Jobs//UC-Berkeley.Tenure_track_faculty_in_genetics_genomics_evolution_and_development</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9695/learn-genetics-online</guid>
	<pubDate>Wed, 09 Apr 2014 19:12:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9695/learn-genetics-online</link>
	<title><![CDATA[Learn Genetics Online]]></title>
	<description><![CDATA[<p>Great source to learn genetics and other relevant stuffs online.</p><p>Address of the bookmark: <a href="http://learn.genetics.utah.edu/" rel="nofollow">http://learn.genetics.utah.edu/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/982</guid>
	<pubDate>Wed, 17 Jul 2013 15:25:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/982</link>
	<title><![CDATA[Is reference genome necessary for gene expression study in transcriptome sequencing or for variant discovery in genome sequencing?]]></title>
	<description><![CDATA[<p><span>Like in case of plant genomes where nature of genome is too complex and huge in size to accomplish complete<em> de novo</em> assembly by current sequencing technology. What would be alternate solution? Can we live in reference free world?</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/2044</guid>
	<pubDate>Mon, 12 Aug 2013 12:19:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/2044</link>
	<title><![CDATA[Does anyone have Nanopore latest updates?]]></title>
	<description><![CDATA[<p>There was a lot of buzz about&nbsp;<span>Oxford Nanopore Technologies&reg; is developing the GridION&trade; system and miniaturised MinION&trade; device. These are a new generation of electronic molecular analysis system for use in scientific research, personalised medicine, crop science, security/defence and more. The platform technology uses nanopores to analyse single molecules including DNA/RNA and proteins. With a broad patent portfolio, the Oxford Nanopore pipeline includes biological nanopores and solid-state nanopores.</span></p><p>Is this available, or still under trial mode?&nbsp;</p><p><a href="https://www.nanoporetech.com/">https://www.nanoporetech.com/</a></p><p><a href="https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system">https://www.nanoporetech.com/technology/the-minion-device-a-miniaturised-sensing-system/the-minion-device-a-miniaturised-sensing-system</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4164/two-major-breakthrough</guid>
	<pubDate>Mon, 02 Sep 2013 10:18:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4164/two-major-breakthrough</link>
	<title><![CDATA[Two major breakthrough!!]]></title>
	<description><![CDATA[<p>"Scientists in Uruguay in colloboration with European partners sequenced the genome of the high-value Tannat grape, from which "the most healthy of red wines" are fermented.</p><p>A quick, $1 syphilis&nbsp;test in development by researchers from UNU-BIOLAC."</p><p><strong>Source</strong>:</p><p><a href="http://www.sciencedaily.com/releases/2013/09/130902101846.htm">http://www.sciencedaily.com/releases/2013/09/130902101846.htm</a></p><p><a href="http://www.eurekalert.org/pub_releases/2013-09/tca-ssg082613.php">http://www.eurekalert.org/pub_releases/2013-09/tca-ssg082613.php</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</guid>
	<pubDate>Fri, 21 Mar 2014 13:57:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/9400/largest-genome-sequenced</link>
	<title><![CDATA[Largest Genome Sequenced]]></title>
	<description><![CDATA[<p>The enormous size of the <strong>loblolly pine genome</strong> having <strong>22 billion base pairs</strong> compared to only 3 billion in the human genome. In other words, it is&nbsp;<strong>seven times</strong> larger than a human&rsquo;s and also the largest and the most complete&nbsp;<strong>conifer<a href="http://en.wikipedia.org/wiki/Pinophyta" target="_blank"></a></strong>&nbsp;genome ever sequenced.</p>
<p><strong>Related Paper:</strong></p>
<p>http://genomebiology.com/2014/15/3/R59/abstract</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859" rel="nofollow">http://www.news.ucdavis.edu/search/news_detail.lasso?id=10859</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10243/new-rna-seq-tool</guid>
	<pubDate>Fri, 25 Apr 2014 10:59:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10243/new-rna-seq-tool</link>
	<title><![CDATA[New RNA Seq tool]]></title>
	<description><![CDATA[<p>"<span>By removing the time-consuming step of read mapping, the authors reported, Sailfish able to provide quantification estimates 20&ndash;30 times faster than current methods without loss of accuracy."</span></p>
<p><span>Tool link:</span></p>
<p><span>http://www.cs.cmu.edu/~ckingsf/software/sailfish/</span></p>
<p><span></span></p><p>Address of the bookmark: <a href="http://www.genengnews.com/gen-news-highlights/lightweight-algorithms-sail-through-rna-sequencing-data/81249765/" rel="nofollow">http://www.genengnews.com/gen-news-highlights/lightweight-algorithms-sail-through-rna-sequencing-data/81249765/</a></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>

</channel>
</rss>