<?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/1897?offset=50</link>
	<atom:link href="https://bioinformaticsonline.com/related/1897?offset=50" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/32948/simba-a-web-tool-for-managing-bacterial-genome-assembly-generated-by-ion-pgm-sequencing-technology</guid>
	<pubDate>Tue, 23 May 2017 05:28:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32948/simba-a-web-tool-for-managing-bacterial-genome-assembly-generated-by-ion-pgm-sequencing-technology</link>
	<title><![CDATA[SIMBA: a web tool for managing bacterial genome assembly generated by Ion PGM sequencing technology]]></title>
	<description><![CDATA[<p><span>SIMBA</span><span>, SImple Manager for Bacterial Assemblies, is a Web interface for managing assembly projects of bacterial genomes. SIMBA was created to assist bioinformaticians to assemble bacterial genomes sequenced with NextGeneration Sequencing (NGS) platforms quickly, easily and effectively. SIMBA also is open source tool, i.e., can be freely downloaded, shared and modified.</span></p>
<p>https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1344-7</p><p>Address of the bookmark: <a href="http://ufmg-simba.sourceforge.net/" rel="nofollow">http://ufmg-simba.sourceforge.net/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</guid>
	<pubDate>Mon, 04 Dec 2017 07:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34515/metasim-a-sequencing-simulator-for-genomics-and-metagenomics</link>
	<title><![CDATA[MetaSim A Sequencing Simulator for Genomics and Metagenomics.]]></title>
	<description><![CDATA[<p><span>Our software can be used to&nbsp;</span><strong>generate collections of synthetic reads</strong><span>&nbsp;that reflect the diverse taxonomical composition of typical metagenome data sets. Based on a database of given genomes, the program allows the user to&nbsp;</span><strong>design a metagenome</strong><span>&nbsp;by specifying the number of genomes present at different levels of the NCBI taxonomy, and then to collect reads from the metagenome using a&nbsp;</span><strong>simulation of a number of different sequencing technologies</strong><span>. A population sampler optionally produces evolved sequences based on source genomes and a given evolutionary tree.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ab.inf.uni-tuebingen.de/software/metasim/" rel="nofollow">http://ab.inf.uni-tuebingen.de/software/metasim/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</guid>
	<pubDate>Tue, 28 Jan 2020 03:44:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40707/vt-a-variant-tool-set-that-discovers-short-variants-from-next-generation-sequencing-data</link>
	<title><![CDATA[vt: a variant tool set that discovers short variants from Next Generation Sequencing data.]]></title>
	<description><![CDATA[<p><span>vt is a variant tool set that discovers short variants from Next Generation Sequencing data.</span></p>
<p><span><a href="https://genome.sph.umich.edu/wiki/Vt">https://genome.sph.umich.edu/wiki/Vt</a></span></p>
<p><a href="https://github.com/atks/vt">https://github.com/atks/vt</a></p><p>Address of the bookmark: <a href="https://genome.sph.umich.edu/wiki/Vt" rel="nofollow">https://genome.sph.umich.edu/wiki/Vt</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</guid>
	<pubDate>Fri, 23 Aug 2013 06:29:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/2991/illumina-reveals-first-dataset-of-long-reads</link>
	<title><![CDATA[Illumina reveals first dataset of long reads]]></title>
	<description><![CDATA[<p>With the help of Moleculo technology , acquired by Illumina releases new service for long reads sequencing i.e., &nbsp;<a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">FastTrack Long Reads</a>.</p><p>Average read length is around<span>&nbsp;8,500 base pairs in release dataset.</span>&nbsp;Best thing about this, there is not much effect on cost and quality of data.</p><p>You can also check following pages for publications on long reads and more:</p><p><a href="http://www.illumina.com/services/long-read-sequencing-service.ilmn">http://www.illumina.com/services/long-read-sequencing-service.ilmn</a></p><p><a href="http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/">http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/</a></p><p>&nbsp;</p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</guid>
	<pubDate>Thu, 05 Sep 2013 07:24:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4288/new-born-babies-get-ready-to-know-their-whole-genome-soon</link>
	<title><![CDATA[New born babies get ready to know their whole genome soon!!!]]></title>
	<description><![CDATA[<p>USA launch a pilot projects to examine medical information of newborn baby, which are being funded by the Eunice Kennedy Shriver National Institute of Child Health and Human Development (NICHD) and the National Human Genome Research Institute (NHGRI), both parts of the National Institutes of Health.</p><p>Awards of $5 million to four grantees have been made in fiscal year 2013 under the Genomic Sequencing and Newborn Screening Disorders research program. The program will be funded at $25 million over five years, as funds are made available.</p><p>"Hundreds of US babies will be pioneers in genomic medicine through a&nbsp;US$25-million programme to sequence their genomes&nbsp;soon after they are born."</p><p><strong>Source</strong>:</p><p><a href="http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html">http://blogs.nature.com/news/2013/09/scientists-to-sequence-hundreds-of-newborns-genomes.html</a></p><p><a href="http://www.genome.gov/27554919">http://www.genome.gov/27554919</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5388/biggest-human-brain-project-hbp-launched</guid>
	<pubDate>Mon, 07 Oct 2013 19:50:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5388/biggest-human-brain-project-hbp-launched</link>
	<title><![CDATA[Biggest Human Brain Project (HBP) launched!!!]]></title>
	<description><![CDATA[<p><img src="http://s1.ibtimes.com/sites/www.ibtimes.com/files/styles/v2_article_large/public/2013/10/07/human-brain-project.jpg" width="500" height="500" alt="image" style="border: 0px;"></p><p>"In neuroscience, the project will use neuroinformatics and brain simulation to collect and integrate experimental data, identifying and filling gaps in our knowledge, and prioritising future experiments.</p><p>In medicine, the HBP will use medical informatics to identify biological signatures of brain disease, allowing diagnosis at an early stage, before the disease has done irreversible damage, and enabling personalized treatment, adapted to the needs of individual patients. Better diagnosis, combined with disease and drug simulation, will accelerate the discovery of new treatments, drastically lowering the cost of drug discovery.<br /><br />In computing, new techniques of interactive supercomputing, driven by the needs of brain simulation, will impact a vast range of industries. Devices and systems, modelled after the brain, will overcome fundamental limits on the energy-efficiency, reliability and programmability of current technologies, clearing the road for systems with brain-like intelligence."</p><p>Source:&nbsp;<a href="http://www.forbes.com/sites/jenniferhicks/2013/10/07/the-human-brain-project-begins/">http://www.forbes.com/sites/jenniferhicks/2013/10/07/the-human-brain-project-begins/</a>&nbsp;</p><p>(<a href="https://www.facebook.com/humanbrainproj/info">https://www.facebook.com/humanbrainproj/info</a>)</p><p>Home Page:</p><p><a href="https://www.humanbrainproject.eu/">https://www.humanbrainproject.eu/</a></p><p>Jobs:</p><p><a href="https://www.humanbrainproject.eu/participate/jobs">https://www.humanbrainproject.eu/participate/jobs</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>