<?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/40598?offset=750</link>
	<atom:link href="https://bioinformaticsonline.com/related/40598?offset=750" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/researchlabs/view/4591/the-breitbart-lab</guid>
  <pubDate>Tue, 17 Sep 2013 18:19:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Breitbart lab]]></title>
  <description><![CDATA[
<p>Breitbart’s lab has created a new branch of biology called metagenomics in which one can sample and sequence genetic material collected from the environment.</p>

<p>Breitbart lab is located in the College of Marine Science at the University of South Florida. She is chosen as top "10 Brilliant" scientist by Popular Science magazine.<br />http://www.popsci.com/science/article/2013-09/mya-breitbart</p>

<p>Lab Link:<br />https://sites.google.com/site/breitbartgenomicslab/<br />http://www.marine.usf.edu/faculty/mya-breitbart.shtml</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</guid>
	<pubDate>Wed, 09 Oct 2013 13:37:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5402/key-bioinformatics-scientists</link>
	<title><![CDATA[Key Bioinformatics Scientists]]></title>
	<description><![CDATA[<p>Address of the bookmark: <a href="http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors" rel="nofollow">http://www.iscb.org/iscb-leadership-a-staff-/officers-and-board-directors</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9675/application-scientist-in-strand-lifesciences-bangalore</guid>
  <pubDate>Mon, 07 Apr 2014 08:17:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[Application Scientist in Strand LifeSciences Bangalore]]></title>
  <description><![CDATA[
<p>Job Description<br />We are looking for a motivated application scientist to help evaluate, compare, and develop next generation sequencing (NGS) data analysis methods. The successful candidate should be able to quickly understand the state-of-art computational biology techniques, prototype them and perform benchmarking studies. The candidate must also be comfortable working with people from different disciplines and be able to present data analysis results in a clear and effective manner. The candidate is also expected to interact with customers as needed, write technical reports and publish new methods and/or data analysis findings in public forums.</p>

<p>Candidate Requirements:<br />A PhD in computer science, computational biology, Bioinformatics, or a related field, along with sufficient programming skills for prototyping. Experience with next generation sequencing data analysis is required. Candidates with MS degree but with relevant work experience can also be considered. </p>

<p>To Apply<br />To apply, please send your updated CV and cover letter to Dr. Rohit Gupta (rohit@strandls.com). </p>

<p>Source: http://www.strandls.com/application-scientist</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</guid>
	<pubDate>Mon, 02 Jun 2014 08:04:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11368/metagenomics-role-in-antibiotic-resistance</link>
	<title><![CDATA[Metagenomics role in antibiotic resistance]]></title>
	<description><![CDATA[<p>Related latest article:</p>
<p><a href="http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf">http://www.nature.com/nature/journal/v509/n7502/pdf/nature13377.pdf</a></p><p>Address of the bookmark: <a href="https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf" rel="nofollow">https://www.landesbioscience.com/journals/virulence/2013VIRULENCE0033R2.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</guid>
	<pubDate>Thu, 19 Apr 2018 08:06:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36271/heap-a-highly-sensitive-and-accurate-snp-detection-tool-for-low-coverage-high-throughput-sequencing-data</link>
	<title><![CDATA[Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data]]></title>
	<description><![CDATA[<p><span>Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from&nbsp;</span><a href="https://github.com/meiji-bioinf/heap">https://github.com/meiji-bioinf/heap</a><span>&nbsp;and our web site (</span><a href="http://bioinf.mind.meiji.ac.jp/lab/en/tools.html">http://bioinf.mind.meiji.ac.jp/lab/en/tools.html</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/meiji-bioinf/heap" rel="nofollow">https://github.com/meiji-bioinf/heap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</guid>
	<pubDate>Thu, 09 Aug 2018 04:09:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37512/purecn-copy-number-calling-and-snv-classification-using-targeted-short-read-sequencing</link>
	<title><![CDATA[PureCN: copy number calling and SNV classification using targeted short read sequencing]]></title>
	<description><![CDATA[<p>This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.</p>
<p>Author: Markus Riester [aut, cre], Angad P. Singh [aut]</p>
<p>Maintainer: Markus Riester &lt;markus.riester at novartis.com&gt;</p>
<div id="bioc_citation_outer">
<p>Citation (from within R, enter&nbsp;<code>citation("PureCN")</code>):</p>
<div id="bioc_citation">
<p>Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). &ldquo;PureCN: Copy number calling and SNV classification using targeted short read sequencing.&rdquo;&nbsp;<em>Source Code for Biology and Medicine</em>,&nbsp;<strong>11</strong>, 13. doi:&nbsp;<a href="http://doi.org/10.1186/s13029-016-0060-z">10.1186/s13029-016-0060-z</a>.</p>
</div>
</div><p>Address of the bookmark: <a href="http://bioconductor.org/packages/release/bioc/html/PureCN.html" rel="nofollow">http://bioconductor.org/packages/release/bioc/html/PureCN.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>