<?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/11249?offset=1300</link>
	<atom:link href="https://bioinformaticsonline.com/related/11249?offset=1300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/25866/jrf-bioinformatics-at-national-chemical-laboratory</guid>
  <pubDate>Sun, 03 Jan 2016 05:59:05 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF Bioinformatics at National Chemical Laboratory]]></title>
  <description><![CDATA[
<p>Junior Project Fellow Bioinformatics<br />Eligibility : ME/M.Tech, MSc(Bio-Informatics)<br />Location : Pune<br />Last Date : 08 Jan 2016<br />Hiring Process : Written-test, Face to Face Interview<br />National Chemical Laboratory </p>

<p>Junior Project Fellow Jobs opportunity in National Chemical Laboratory on contract basis<br />Project Code : BSC0117  <br />Title of the Project : Plant?Microbe and Soil Interactions (PMSI)  <br />No. of Post : 01<br />Qualification : M.Tech. / M.Sc. in Bioinformatics from a recognized university with minimum of 55% marks (aggregate) and sound Bioinformatics knowledge / experience<br />Desirable : Good knowledge of Linux (command line and GUI) and SQL; Java / Perl / Python / R / Bash programing / scripting; Analysis of NGS data; Protein modeling / docking; Development and maintenance of web &amp; database servers, etc<br />Emoluments : Rs. 16,000/?<br />Age Limit : 28 Years<br />Selection Procedure : Written Test / Interview<br />How to apply<br />Applications neatly typed in the prescribed proforma (enclosed herewith) duly completed and signed together with photo?copies of relevant certificates/ testimonials and photograph should be addressed to : The Head, Biochemical Sciences Division, Attn : Dr. Narendra Kadoo, CSIR?National Chemical Laboratory, Dr. Homi Bhabha Road, Pashan, Pune 411 008, so as to reach on or before 08/01/2016. Please superscribe the envelop “Application for Junior Project Fellow (Project: BSC0117)”.</p>

<p>More at http://www.ncl-india.org/files/JoinUs/JobVacancies/TemporaryJobs.aspx?</p>
]]></description>
</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10379/your-stressdepression-came-from-ancestor</guid>
	<pubDate>Sun, 04 May 2014 18:46:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10379/your-stressdepression-came-from-ancestor</link>
	<title><![CDATA[Your stress/depression came from ancestor]]></title>
	<description><![CDATA[<p>"A study published in&nbsp;<em>Nature Neuroscience</em>&nbsp;finds that stress in early life alters the production of small RNAs, called microRNAs, in the sperm of mice. The mice show depressive behaviours that persist in their progeny."</p><p>Source:</p><p>http://www.nature.com/news/sperm-rna-carries-marks-of-trauma-1.15049</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</guid>
	<pubDate>Thu, 23 Nov 2017 09:55:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34396/pore-an-r-package-for-the-visualization-and-analysis-of-nanopore-sequencing-data</link>
	<title><![CDATA[poRe: an R package for the visualization and analysis of nanopore sequencing data]]></title>
	<description><![CDATA[<p><strong>Motivation:</strong>&nbsp;The Oxford Nanopore MinION device represents a unique sequencing technology. As a mobile sequencing device powered by the USB port of a laptop, the MinION has huge potential applications. To enable these applications, the bioinformatics community will need to design and build a suite of tools specifically for MinION data.</p>
<p><strong>Results:</strong>&nbsp;Here we present poRe, a package for R that enables users to manipulate, organize, summarize and visualize MinION nanopore sequencing data. As a package for R, poRe has been tested on Windows, Linux and MacOSX. Crucially, the Windows version allows users to analyse MinION data on the Windows laptop attached to the device.</p>
<p><strong>Availability and implementation:</strong>&nbsp;poRe is released as a package for R at&nbsp;<a href="http://sourceforge.net/projects/rpore/" target="">http://sourceforge.net/projects/rpore/</a>&nbsp;. A tutorial and further information are available at&nbsp;<a href="https://sourceforge.net/p/rpore/wiki/Home/" target="">https://sourceforge.net/p/rpore/wiki/Home/</a></p>
<p><strong>Contact:</strong><a href="mailto:mick.watson@roslin.ed.ac.uk" target="">mick.watson@roslin.ed.ac.uk</a></p><p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/1/114/2365693" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/1/114/2365693</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35420/telomerehunter</guid>
	<pubDate>Fri, 02 Feb 2018 04:23:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35420/telomerehunter</link>
	<title><![CDATA[TelomereHunter]]></title>
	<description><![CDATA[<p><span>TelomereHunter is a tool for estimating telomere content from human whole-genome sequencing data. It is designed to take BAM files from a tumor and a matching control sample as input. However, it is also possible to run TelomereHunter with one input file. TelomereHunter extracts and sorts telomeric reads from the input sample(s). For the estimation of telomere content, GC biases are taken into account. Finally, the results of TelomereHunter are visualized in several diagrams.</span><br><br><span>TelomereHunter is available for download at the following address:&nbsp;</span><a href="https://pypi.python.org/pypi/telomerehunter/" target="_blank">https://pypi.python.org/pypi/telomerehunter/</a></p><p>Address of the bookmark: <a href="http://www.dkfz.de/en/applied-bioinformatics/telomerehunter/telomerehunter.html" rel="nofollow">http://www.dkfz.de/en/applied-bioinformatics/telomerehunter/telomerehunter.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/25993/hoffman-lab</guid>
  <pubDate>Tue, 12 Jan 2016 02:47:41 -0600</pubDate>
  <link></link>
  <title><![CDATA[Hoffman Lab]]></title>
  <description><![CDATA[
<p>They develop machine learning techniques to better understand chromatin biology. These models and algorithms transform high-dimensional functional genomics data into interpretable patterns and lead to new biological insight.</p>

<p>https://www.pmgenomics.ca/hoffmanlab/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</guid>
	<pubDate>Tue, 15 May 2018 07:35:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36621/hapcut2-robust-and-accurate-haplotype-assembly-for-diverse-sequencing-technologies</link>
	<title><![CDATA[HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies]]></title>
	<description><![CDATA[HapCUT2 is a maximum-likelihood-based tool for assembling haplotypes from DNA sequence reads, designed to "just work" with excellent speed and accuracy. We found that previously described haplotype assembly methods are specialized for specific read technologies or protocols, with slow or inaccurate performance on others. With this in mind, HapCUT2 is designed for speed and accuracy across diverse sequencing technologies, including but not limited to:

NGS short reads (Illumina HiSeq)
clone-based sequencing (Fosmid or BAC clones)
SMRT reads (PacBio)
Oxford Nanopore reads
10X Genomics Linked-Reads
proximity-ligation (Hi-C) reads
high-coverage sequencing (&gt;40x coverage-per-SNP) using above technologies
combinations of the above technologies (e.g. scaffold long reads with Hi-C reads)
See below for specific examples of command line options and best practices for some of these technologies.

NOTE: At this time HapCUT2 is for diploid organisms only. VCF input should contain diploid variants.

If you use HapCUT2 in your research, please cite:

Edge, P., Bafna, V. &amp; Bansal, V. HapCUT2: robust and accurate haplotype assembly for diverse sequencing technologies. Genome Res. gr.213462.116 (2016). doi:10.1101/gr.213462.116<p>Address of the bookmark: <a href="https://github.com/vibansal/HapCUT2" rel="nofollow">https://github.com/vibansal/HapCUT2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</guid>
	<pubDate>Wed, 22 Aug 2018 10:40:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37574/simlord-a-read-simulator-for-third-generation-sequencing-reads</link>
	<title><![CDATA[SimLoRD: A read simulator for third generation sequencing reads]]></title>
	<description><![CDATA[<p>SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.</p>
<p>Reads are simulated from both strands of a provided or randomly generated reference sequence.</p>
<div id="rst-header-features">
<ul>
<li>The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)</li>
<li>The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length</li>
<li>Quality values and number of passes depend on fragment length.</li>
<li>Provided subread error probabilities are modified according to number of passes</li>
<li>Outputs reads in FASTQ format and alignments in SAM format</li>
</ul>
</div><p>Address of the bookmark: <a href="https://bitbucket.org/genomeinformatics/simlord/" rel="nofollow">https://bitbucket.org/genomeinformatics/simlord/</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>

</channel>
</rss>