<?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/44503?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/44503?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/6896/dna-tale-of-3-to-4-years-old-serbia-boy</guid>
	<pubDate>Tue, 26 Nov 2013 17:34:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/6896/dna-tale-of-3-to-4-years-old-serbia-boy</link>
	<title><![CDATA[DNA tale of 3 to 4 years old Serbia boy]]></title>
	<description><![CDATA[<p><span>The genome of a young boy found underground at Mal&rsquo;ta near Lake Baikal of eastern Siberia around 24,000 years ago came out as close relative of Europeans and Native Indians.</span></p><p><span>Link:</span></p><p><span><a href="http://www.nytimes.com/2013/11/21/science/two-surprises-in-dna-of-boy-found-buried-in-siberia.html?_r=0">http://www.nytimes.com/2013/11/21/science/two-surprises-in-dna-of-boy-found-buried-in-siberia.html?_r=0</a></span></p><p>&nbsp;</p><p><a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature12736.html">http://www.nature.com/nature/journal/vaop/ncurrent/full/nature12736.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10237/genome-of-rainbow-trout-sequenced</guid>
	<pubDate>Fri, 25 Apr 2014 10:36:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10237/genome-of-rainbow-trout-sequenced</link>
	<title><![CDATA[Genome of Rainbow Trout Sequenced]]></title>
	<description><![CDATA[<p>Major finding:</p><p><span>&ldquo;In humans and most vertebrates the duplication events were older so there are fewer duplicated genes still present. Most of the duplicated genes get lost or modified so much that they are no longer recognizable as duplicates over time. In the trout and salmon we can see an earlier stage in the process and many duplicated genes are still present,&rdquo; said Dr Gary Thorgaard of Washington State University, a co-author of the paper published in the journal Nature Communications.</span></p><p><span>Source:</span></p><p><span>http://www.sci-news.com/genetics/science-genome-rainbow-trout-01877.html</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10378/real-time-sequencing</guid>
	<pubDate>Sun, 04 May 2014 18:16:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10378/real-time-sequencing</link>
	<title><![CDATA[Real time Sequencing]]></title>
	<description><![CDATA[<p><span>&ldquo;... we now know we can do high-throughput sequencing at any location on Earth,&rdquo; Moroz said.</span></p><p><span>Source:</span></p><p><span>http://news.ufl.edu/2014/04/28/real-time-genome-sequencing-at-sea/</span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11644/mirna-database-and-tools</guid>
	<pubDate>Mon, 09 Jun 2014 07:58:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11644/mirna-database-and-tools</link>
	<title><![CDATA[miRNA database and tools]]></title>
	<description><![CDATA[<p>Since few years miRNA has shown to play important role in therapeutic related research and also known to play vital role in controlling gene expression specifically at transcriptional and post-transcription levels. Here are some important DBs and tools related with miRNA:</p><p><strong>miRNA Sequencing data analysis</strong> :&nbsp;http://tools.genxpro.net/omiras/</p><p><strong>miRNApath( R based tool)&nbsp;</strong>: &nbsp;<a href="http://www.bioconductor.org/packages/release/bioc/html/miRNApath.html">http://www.bioconductor.org/packages/release/bioc/html/miRNApath.html</a></p><p><strong>miRWalk DB</strong> :&nbsp;http://www.umm.uni-heidelberg.de/apps/zmf/mirwalk/</p><p><strong>TargetScanHuman</strong> :&nbsp;http://www.targetscan.org/</p><p><strong>RNAhybrid</strong> :&nbsp;http://bibiserv.techfak.uni-bielefeld.de/rnahybrid/welcome.html</p><p><strong>RNA22 predictor</strong> :&nbsp;http://cbcsrv.watson.ibm.com/rna22.html</p><p><strong>miRNA predictor</strong> :&nbsp;http://www.microrna.org/microrna/home.do</p><p><strong>Plant miRNA DB</strong> :http://bioinformatics.cau.edu.cn/PMRD/</p><p><strong>miRBASE DB</strong>:&nbsp;http://www.mirbase.org/</p><p><strong>Plant RNA predictor</strong> : http://plantgrn.noble.org/psRNATarget/</p><p><strong>miRNA Interaction DB</strong> :&nbsp;http://starbase.sysu.edu.cn/</p><p><strong>Sequencing based miRNA DB</strong> :&nbsp;http://mirgator.kobic.re.kr/</p><p><strong>predicted A-to-I edited miRNA DB </strong>:&nbsp;http://microrna.osumc.edu/mireditar/</p><p><strong>Animal, plant and virus miRNA DB</strong> :&nbsp;http://lemur.amu.edu.pl/share/php/mirnest/</p><p><strong>Atlantic Salmon&nbsp;miRNAs DB </strong>:<strong>&nbsp;</strong>http://www.molgenv.com/ssa_mirnas_db_home.php</p><p><strong>miRNA prediction on UTRs</strong> :&nbsp;http://genie.weizmann.ac.il/pubs/mir07/mir07_prediction.html</p><p><span style="text-decoration: underline;"><strong>Idea of analysing miRNA Sequencing data</strong></span> :</p><p>http://www.illumina.com/applications/epigenetics/small_rna_analysis.ilmn</p><p><strong>More:</strong></p><p><a href="http://www.bioconductor.org/help/search/index.html?q=miRNA+target">http://www.bioconductor.org/help/search/index.html?q=miRNA+target</a></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/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33011/grinder-biogrinder-a-versatile-omics-shotgun-and-amplicon-sequencing-read-simulator</guid>
	<pubDate>Wed, 24 May 2017 08:41:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33011/grinder-biogrinder-a-versatile-omics-shotgun-and-amplicon-sequencing-read-simulator</link>
	<title><![CDATA[Grinder / Biogrinder - A versatile omics shotgun and amplicon sequencing read simulator]]></title>
	<description><![CDATA[<p><span>Grinder is a versatile program to create random shotgun and amplicon sequence libraries based on DNA, RNA or proteic reference sequences provided in a FASTA file. </span></p>
<p><span>Grinder can produce genomic, metagenomic, transcriptomic, metatranscriptomic, proteomic, metaproteomic shotgun and amplicon datasets from current sequencing technologies such as Sanger, 454, Illumina. These simulated datasets can be used to test the accuracy of bioinformatic tools under specific hypothesis, e.g. with or without sequencing errors, or with low or high community diversity. Grinder may also be used to help decide between alternative sequencing methods for a sequence-based project, e.g. should the library be paired-end or not, how many reads should be sequenced.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/biogrinder/files/biogrinder/" rel="nofollow">https://sourceforge.net/projects/biogrinder/files/biogrinder/</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</guid>
	<pubDate>Wed, 15 Jun 2022 00:37:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43892/choosing-the-right-ngs-sequencing-instrument-for-your-study</link>
	<title><![CDATA[Choosing the Right NGS Sequencing Instrument for Your Study]]></title>
	<description><![CDATA[<p>The right sequencing instrument for your study depends on your project goal. Setting aside turnaround time and price, it essentially comes down to the numbers of reads and read length you need for your experiment. Below, we've described and compared metrics for each of the instruments available. If you&rsquo;re new to high-throughput sequencing and have questions about how you should design your sequencing run, fill out our&nbsp;<a href="https://genohub.com/ngs-consultation/"><span>free consultation form</span></a>&nbsp;and we'll get in touch with you to help.</p>
<p>More at&nbsp;https://genohub.com/ngs-instrument-guide/</p><p>Address of the bookmark: <a href="https://genohub.com/ngs-instrument-guide/" rel="nofollow">https://genohub.com/ngs-instrument-guide/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1906</guid>
	<pubDate>Sun, 11 Aug 2013 11:13:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1906</link>
	<title><![CDATA[Compressive Genomics]]></title>
	<description><![CDATA[<p>The key to finding a solution is to notice that most&nbsp;<a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">genomic</a>sequences differ by very little. It may well be that the number of complete genome sequences being stored is increasing rapidly, but the actual amount of new data is very small. In other words, a single DNA sequence isn't particularly compressible but a set of sequences shares so much in common that the redundancy can be used to store them in a much smaller storage space. (Source:e-article from&nbsp;Alex Armstrong)</p><p><a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html</a></p><p><a href="http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data">http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data</a></p><p><a href="http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html">http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html</a></p><p><a href="http://bioinformatics.oxfordjournals.org/content/29/13/i283.full">http://bioinformatics.oxfordjournals.org/content/29/13/i283.full</a></p><p><a href="http://groups.csail.mit.edu/cb/cast/">http://groups.csail.mit.edu/cb/cast/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>