<?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/34445?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/34445?offset=70" 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/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/34475/oxford-nanopore-sequencing-hybrid-error-correction-and-de-novo-assembly-of-a-eukaryotic-genome</guid>
	<pubDate>Wed, 29 Nov 2017 05:08:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34475/oxford-nanopore-sequencing-hybrid-error-correction-and-de-novo-assembly-of-a-eukaryotic-genome</link>
	<title><![CDATA[Oxford Nanopore Sequencing, Hybrid Error Correction, and de novo Assembly of a Eukaryotic Genome]]></title>
	<description><![CDATA[<p><span>Monitoring the progress of DNA molecules through a membrane pore has been postulated as a method for sequencing DNA for several decades. Recently, a nanopore-based sequencing instrument, the Oxford Nanopore MinION, has become available that we used for sequencing the S. cerevisiae genome. To make use of these data, we developed a novel open-source hybrid error correction algorithm Nanocorr (</span><a href="https://github.com/jgurtowski/nanocorr">https://github.com/jgurtowski/nanocorr</a><span>) specifically for Oxford Nanopore reads, as existing packages were incapable of assembling the long read lengths (5-50kbp) at such high error rate (between ~5 and 40% error). With this new method we were able to perform a hybrid error correction of the nanopore reads using complementary MiSeq data and produce a de novo assembly that is highly contiguous and accurate: the contig N50 length is more than ten-times greater than an Illumina-only assembly (678kb versus 59.9kbp), and has greater than 99.88% consensus identity when compared to the reference. Furthermore, the assembly with the long nanopore reads presents a much more complete representation of the features of the genome and correctly assembles gene cassettes, rRNAs, transposable elements, and other genomic features that were almost entirely absent in the Illumina-only assembly.</span></p><p>Address of the bookmark: <a href="http://schatzlab.cshl.edu/data/nanocorr/" rel="nofollow">http://schatzlab.cshl.edu/data/nanocorr/</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/42917/fings-filters-for-next-generation-sequencing</guid>
	<pubDate>Sat, 27 Feb 2021 01:18:35 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42917/fings-filters-for-next-generation-sequencing</link>
	<title><![CDATA[FiNGS: Filters for Next Generation Sequencing]]></title>
	<description><![CDATA[<h2>Key features</h2>
<ul>
<li><strong>Filters SNVs from any variant caller to remove false positives</strong></li>
<li><strong>Calculates metrics based on BAM files and provides filtering not possible with other tools</strong></li>
<li><strong>Fully user-configurable filtering (including which filters to use and their thresholds)</strong></li>
<li><strong>Option to use filters identical to ICGC recommendations</strong></li>
</ul>
<p>FiNGS provides researchers with a tool to reproducibly filter somatic variants that is simple to both deploy and use, with filters and thresholds that are fully configurable by the user. It ingests and emits standard variant call format (VCF) files and will slot into existing sequencing pipelines. It allows users to develop and implement their own filtering strategies and simple sharing of these with others.</p>
<p>FiNGS reliably improves upon the precision of default variant caller outputs and performs better than other tools designed for the same task.</p><p>Address of the bookmark: <a href="https://github.com/cpwardell/FiNGS" rel="nofollow">https://github.com/cpwardell/FiNGS</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/bookmarks/view/3885/precision-medicine</guid>
	<pubDate>Sat, 24 Aug 2013 15:47:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3885/precision-medicine</link>
	<title><![CDATA[Precision Medicine]]></title>
	<description><![CDATA[<p>Coupling established clinical&ndash;pathological indexes with state-of-the-art molecular profiling to create diagnostic, prognostic, and therapeutic strategies precisely tailored to each patient's requirements &mdash; hence the term &ldquo;Precision medicine&rdquo;&nbsp;</p>
<p>Source:<a href="http://www.nejm.org/doi/full/10.1056/NEJMp1114866">http://www.nejm.org/doi/full/10.1056/NEJMp1114866</a></p>
<p><strong>Another video on precision medicine</strong>:</p>
<p><a href="http://www.youtube.com/watch?v=Pi8W0yOXnzE">http://www.youtube.com/watch?v=Pi8W0yOXnzE</a></p>
<p>Precision Medicine basically intergrates bioinformatics, genomics , genetics, molecular biology and nanotechnology to deliver precise cure/diagnotics to a specific patient.</p>
<p>Examples:</p>
<ul>
<li><span>The drug imatinib (Gleevec) designed to inhibit an altered enzyme produced by a fused version of two genes found in chronic myelogenous leukemia.</span></li>
<li><span>The breast cancer drug trastuzumab (Herceptin) works only for women whose tumors have a particular genetic profile called HER-2 positive.</span></li>
</ul>
<p><span>E.g. source :</span></p>
<p><span><a href="http://www.bionews-tx.com/news/2013/08/15/how-the-impact-of-cancer-genomics-on-precision-medicine-is-revolutionizing-cancer-treatment/">http://www.bionews-tx.com/news/2013/08/15/how-the-impact-of-cancer-genomics-on-precision-medicine-is-revolutionizing-cancer-treatment/</a></span></p><p>Address of the bookmark: <a href="http://www.cbsnews.com/video/watch/?id=50149783n" rel="nofollow">http://www.cbsnews.com/video/watch/?id=50149783n</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3029/bioinformatics-market-in-india</guid>
	<pubDate>Fri, 23 Aug 2013 07:08:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3029/bioinformatics-market-in-india</link>
	<title><![CDATA[Bioinformatics market in India]]></title>
	<description><![CDATA[<div><strong>Key Topics Covered in the Report:</strong></div>
<ul>
<li>The market size of the Indian Bioinformatics Industry , FY&rsquo;2007-FY&rsquo;2013</li>
<li>Market segmentation of India bioinformatics industry by application by sectors, FY&rsquo;2007-FY&rsquo;2013</li>
<li>Market Segmentation of India bioinformatics industry by products and services,FY&rsquo;2007-FY&rsquo;2013</li>
<li>Market Segmentation of India bioinformatics industry by applications of bioinformatics ,FY&rsquo;2007-FY&rsquo;2013</li>
<li>India bioinformatics industry trends and developments</li>
<li>Government regulations and initiatives of India bioinformatics industry</li>
<li>Major bioinformatics research institutes in India</li>
<li>Market Share of leading players in bioinformatics industry in India,FY&rsquo;2013</li>
<li>Company profiles of major players in India bioinformatics industry</li>
<li>Future outlook and projections on the basis of revenue in India bioinformatics market, FY&rsquo;2014-FY&rsquo;2018</li>
</ul>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;(Source: Ken Research)</p><p>Address of the bookmark: <a href="http://www.kenresearch.com/healthcare/biotechnology/india-bioinformatics-industry-research-report/392-91.html" rel="nofollow">http://www.kenresearch.com/healthcare/biotechnology/india-bioinformatics-industry-research-report/392-91.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4184/zombies-like-bacteria</guid>
	<pubDate>Tue, 03 Sep 2013 08:44:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4184/zombies-like-bacteria</link>
	<title><![CDATA[Zombies like bacteria!!!]]></title>
	<description><![CDATA[<p>Do you believe in Zombies stories &hellip; Hmm confused? Don&rsquo;t worry there is a news for you. Scientists from the Integrated Ocean Drilling Program have announced the findings &nbsp;of the long-lived bacteria, reproducing only once every 10,000 years, which have been found in rocks 2.5km (1.5 miles) below the ocean floor that are as much as 100 million years old.</p><p><span>" the microbes exist in very low concentrations, of around 1,000 microbes in every tea spoon full of rock, compared with billions or trillions of bacteria that would typically be found in the same amount of soil at Earth's surface."</span></p><p><span>Reference:</span></p><p><span><a href="http://www.bbc.co.uk/news/science-environment-23855436">http://www.bbc.co.uk/news/science-environment-23855436</a></span></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5350/introduction-of-epigenomics</guid>
	<pubDate>Sun, 06 Oct 2013 04:59:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5350/introduction-of-epigenomics</link>
	<title><![CDATA[Introduction of Epigenomics]]></title>
	<description><![CDATA[<ul>
<li><a href="http://www.genome.gov/27532724#al-1">What is the epigenome?</a></li>
<li><a href="http://www.genome.gov/27532724#al-2">What does the epigenome do?</a></li>
<li><a href="http://www.genome.gov/27532724#al-3">What makes up the epigenome?</a></li>
<li><a href="http://www.genome.gov/27532724#al-4">Is the epigenome inherited?</a></li>
<li><a href="http://www.genome.gov/27532724#al-5">What is imprinting?</a></li>
<li><a href="http://www.genome.gov/27532724#al-6">Can the epigenome change?</a></li>
<li><a href="http://www.genome.gov/27532724#al-7">What makes the epigenome change?</a></li>
<li><a href="http://www.genome.gov/27532724#al-8">How do changes in the epigenome contribute to cancer?</a></li>
<li><a href="http://www.genome.gov/27532724#al-9">How are researchers exploring the epigenome?</a></li>
</ul><p>Address of the bookmark: <a href="http://www.genome.gov/27532724" rel="nofollow">http://www.genome.gov/27532724</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>