<?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/34488?offset=460</link>
	<atom:link href="https://bioinformaticsonline.com/related/34488?offset=460" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</guid>
	<pubDate>Wed, 20 Aug 2014 21:57:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14215/the-8000-years-old-tibetian-gene-mutation</link>
	<title><![CDATA[The 8000 years old Tibetian gene mutation !!!]]></title>
	<description><![CDATA[<p>A new study has provided insight into how gene mutation around 8,000 years ago helped Tibetans' to survive in the thin air on the Tibetan Plateau, where an average elevation is of 14,800 feet.<br /><br />A study led by University of Utah scientists is the first to find a genetic cause for the adaptation, a single DNA base pair change that dates back 8,000 years and demonstrate how it contributes to the Tibetans' ability to live in low oxygen conditions.</p><p>About 8,000 years ago, the gene EGLN1 changed by a single DNA base pair. Today, a relatively short time later on the scale of human history, 88 percent of Tibetans have the genetic variation, and it was virtually absent from closely related lowland Asians. The findings indicate the genetic variation endows its carriers with an advantage.<br /><br />In those without the adaptation, low oxygen caused their blood to become thick with oxygen-carrying red blood cells, an attempt to feed starved tissues, which could cause long-term complications such as heart failure. The researchers found that the newly identified genetic variation protected Tibetans by decreasing the over-response to low oxygen.</p><p>Reference: http://www.nature.com/nature/journal/v512/n7513/abs/nature13408.html</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/18653/genetic-code-amino-acid</guid>
	<pubDate>Sun, 26 Oct 2014 07:45:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/18653/genetic-code-amino-acid</link>
	<title><![CDATA[Genetic code - Amino Acid]]></title>
	<description><![CDATA[<p>The genetic code consists of 64 triplets of nucleotides. These triplets are called codons.With three exceptions, each codon encodes for one of the 20 amino acids used in the synthesis of proteins. That produces some redundancy in the code: most of the amino acids being encoded by more than one codon.</p><p>The image summarise all in one.</p><p>More at http://users.rcn.com/jkimball.ma.ultranet/BiologyPages/C/Codons.html</p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/18653" length="226605" type="image/jpeg" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19631/rosalind-bioinformatics-problems</guid>
	<pubDate>Thu, 18 Dec 2014 10:32:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19631/rosalind-bioinformatics-problems</link>
	<title><![CDATA[Rosalind Bioinformatics problems !!!]]></title>
	<description><![CDATA[<p>Rosalind is a platform for learning bioinformatics and programming through problem solving. <a href="http://rosalind.info/problems/list-view/">Take a tour</a> to get the hang of how Rosalind works.</p>
<p>http://rosalind.info/problems/list-view/</p><p>Address of the bookmark: <a href="http://rosalind.info/problems/list-view/" rel="nofollow">http://rosalind.info/problems/list-view/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/23838/scripted-dna</guid>
	<pubDate>Mon, 17 Aug 2015 17:44:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/23838/scripted-dna</link>
	<title><![CDATA[Scripted DNA !!!]]></title>
	<description><![CDATA[<p>As per bioinformatician DNA is partially scripted ;) You dont believe in it. Please have a look at image carefully:)</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/23838" length="13498" type="image/gif" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26525/ensembl-comparative-genomics-resources</guid>
	<pubDate>Sun, 28 Feb 2016 17:10:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26525/ensembl-comparative-genomics-resources</link>
	<title><![CDATA[Ensembl comparative genomics resources]]></title>
	<description><![CDATA[<div>
<p>The Ensembl comparative genomics resources are one such reference set that facilitates comprehensive and reproducible analysis of chordate genome data. Ensembl computes pairwise and multiple whole-genome alignments from which large-scale synteny, per-base conservation scores and constrained elements are obtained. Gene alignments are used to define Ensembl Protein Families, GeneTrees and homologies for both protein-coding and non-coding RNA genes. These resources are updated frequently and have a consistent informatics infrastructure and data presentation across all supported species. Specialized web-based visualizations are also available including synteny displays, collapsible gene tree plots, a gene family locator and different alignment views. The Ensembl comparative genomics infrastructure is extensively reused for the analysis of non-vertebrate species by other projects including Ensembl Genomes and Gramene and much of the information here is relevant to these projects. The consistency of the annotation across species and the focus on vertebrates makes Ensembl an ideal system to perform and support vertebrate comparative genomic analyses. We use robust software and pipelines to produce reference comparative data and make it freely available.</p>
<p><strong>Database URL:</strong> <a href="http://www.ensembl.org" target="pmc_ext">http://www.ensembl.org</a>.</p>
</div><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4761110/" rel="nofollow">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4761110/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26309/ratt</guid>
	<pubDate>Sun, 07 Feb 2016 16:09:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26309/ratt</link>
	<title><![CDATA[RATT]]></title>
	<description><![CDATA[<p><strong>RATT</strong> is software to transfer annotation from a reference (annotated) genome to an unannotated query genome.</p>
<p>It was first developed to transfer annotations between different genome assembly versions. However, it can also transfer annotations between strains and even different species, like <em>Plasmodium chabaudi</em> onto <em> P. berghei</em>, between different Leishmania species or <em>Salmonella enterica</em> onto other Salmonella serotypes. <strong>RATT</strong> is able to transfer any entries present on a reference sequence, such as the systematic id or an annotator's notes; such information would be lost in a <em>de novo</em> annotation.</p>
<p>More at http://ratt.sourceforge.net/</p><p>Address of the bookmark: <a href="http://ratt.sourceforge.net/" rel="nofollow">http://ratt.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</guid>
	<pubDate>Mon, 07 Mar 2016 05:18:06 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26573/efficient-genome-searching-with-biostrings-and-the-bsgenome-data-package</link>
	<title><![CDATA[Efficient genome searching with Biostrings and the BSgenome data package]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf" rel="nofollow">https://www.bioconductor.org/packages/3.3/bioc/vignettes/BSgenome/inst/doc/GenomeSearching.pdf</a></p>]]></description>
	<dc:creator>Aasha</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</guid>
	<pubDate>Fri, 20 May 2016 19:08:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</link>
	<title><![CDATA[Hagfish - assess an assembly through creative use of coverage plots]]></title>
	<description><![CDATA[<p>Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of&nbsp;<em style="font-size: 12.8px;">de novo</em>&nbsp;genome assembly or identification of structural variation in a genome re-sequencing experiment.</p>
<p>Hagfish requires a reference sequence and a&nbsp;<span>paired end</span>&nbsp;re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.</p>
<p>Quick links:&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Install">Installation</a>,<a href="https://github.com/mfiers/hagfish/wiki/Operation">Operation</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/ReadMappers">Read mappers</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Scripts">Hagfish scripts</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Plots">Hagfish plots</a></p><p>Address of the bookmark: <a href="https://github.com/mfiers/hagfish" rel="nofollow">https://github.com/mfiers/hagfish</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</guid>
	<pubDate>Mon, 19 Sep 2016 07:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29210/cgview-circular-genome-viewer</link>
	<title><![CDATA[CGView - Circular Genome Viewer]]></title>
	<description><![CDATA[<p>GView is a Java package used to display and navigate bacterial genomes. GView is useful for producing high-quality genome maps for use in publications and websites, or as a visualization tool in a sequence annotation pipeline. Users can interact with the genome using a powerful pan-and-zoom interface, or GView can write static images of a genome to a file. GView can draw a genome using either circular or linear layouts. For examples of some of the images GView can produce, see the <a href="https://www.gview.ca/bin/view/GView/ImageGallery">Image Gallery</a>. GView is a re-write of <a href="http://wishart.biology.ualberta.ca/cgview/" target="_top">CGView</a>, a circular genome viewer written by Paul Stothard. The goal of GView is to provide greater user interaction, and more flexibility in how the genome map is rendered. To aid with easily configuring the display of a genome, a style editor has been included to provide an intuitive, user-friendly graphical user interface for customizing genome maps. Styling attributes such as colours or fonts for the various map elements can be adjusted in real time. Customized styles can be saved for later use or for application to other genome maps using GView's <a href="https://www.gview.ca/bin/view/GViewDocumentation/GViewGSS">custom file format</a>.</p><p>Address of the bookmark: <a href="http://wishart.biology.ualberta.ca/cgview/" rel="nofollow">http://wishart.biology.ualberta.ca/cgview/</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>

</channel>
</rss>