<?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/27973?offset=1310</link>
	<atom:link href="https://bioinformaticsonline.com/related/27973?offset=1310" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</guid>
	<pubDate>Tue, 11 Sep 2018 04:44:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37674/qualimap2-evaluating-next-generation-sequencing-alignment-data</link>
	<title><![CDATA[Qualimap2: Evaluating next generation sequencing alignment data]]></title>
	<description><![CDATA[<p><strong>Qualimap 2</strong><span>&nbsp;is a platform-independent application written in Java and R that provides both a Graphical User Inteface (GUI) and a command-line interface to facilitate the quality control of alignment sequencing data and its derivatives like feature counts.&nbsp;</span><br><br><span>Supported types of experiments include:</span></p>
<ul>
<li>Whole-genome sequencing</li>
<li>Whole-exome sequencing</li>
<li>RNA-seq (speical mode available)</li>
<li>ChIP-seq</li>
</ul><p>Address of the bookmark: <a href="http://qualimap.bioinfo.cipf.es/" rel="nofollow">http://qualimap.bioinfo.cipf.es/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14800/a-comprehensive-atlas-of-human-gene-activity-released</guid>
	<pubDate>Tue, 02 Sep 2014 14:20:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14800/a-comprehensive-atlas-of-human-gene-activity-released</link>
	<title><![CDATA[A comprehensive atlas of human gene activity released !!!]]></title>
	<description><![CDATA[<div><div id="postDescription_4018558404"><p>A large international consortium of researchers has produced the first comprehensive, detailed map of the way&nbsp;<a href="http://www.hsph.harvard.edu/news/topic/genetics/" target="_blank">genes</a>&nbsp;work across the major cells and tissues of the human body. The findings describe the complex networks that govern gene activity, and the new information could play a crucial role in identifying the genes involved with disease.</p><p><img src="http://www.kurzweilai.net/images/Coexpression-clustering.jpg" alt="image" width="640" height="460" style="border: 0px; border: 0px;"></p><p>We are able to pinpoint the regions of the genome that can be active in a disease and in normal activity, whether it&rsquo;s in a brain cell, the skin, in blood stem cells or in hair follicles. This is a major advance that will greatly increase our ability to understand the causes of disease across the body.</p><p>The research is outlined in a series of papers published March 27, 2014, two in the journal&nbsp;<em>Nature</em>&nbsp;and 16 in other scholarly journals. The work is the result of years of concerted effort among 250 experts from more than 20 countries as part of&nbsp;<a href="http://fantom.gsc.riken.jp/" target="_blank">FANTOM 5 (Functional Annotation of the Mammalian Genome)</a>. The FANTOM project, led by the Japanese institution RIKEN, is aimed at building a complete library of human genes.</p><p>Researchers studied human and mouse cells using a new technology called Cap Analysis of Gene Expression (CAGE), developed at RIKEN, to discover how 95% of all human genes are switched on and off. These &ldquo;switches&rdquo; &mdash; called &ldquo;promoters&rdquo; and &ldquo;enhancers&rdquo; &mdash; are the regions of DNA that manage gene activity. The researchers mapped the activity of 180,000 promoters and 44,000 enhancers across a wide range of human cell types and tissues and, in most cases, found they were linked with specific cell types.</p><p>Referene : www.kurzweilai.net/first-comprehensive-atlas-of-human-gene-activity-released</p></div></div>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</guid>
	<pubDate>Thu, 04 Sep 2014 07:51:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/14927/which-of-the-following-programming-language-is-best-for-a-bioinformatics-beginner</link>
	<title><![CDATA[Which of the following programming language is best for a bioinformatics beginner?]]></title>
	<description><![CDATA[<p>I will be doing NGS in the course of my research work and I will like to learn a programming language which is compatible with most bioinformatics tools or software. I basically want to do de-novo assembly, map reads, align reads, and expression analysis. Recommendations welcomed. Which languages would you recommend to a student wishing to enter the world of bioinformatics?</p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</guid>
	<pubDate>Tue, 14 Jan 2020 06:47:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40531/shasta-long-read-assembler</link>
	<title><![CDATA[Shasta long read assembler]]></title>
	<description><![CDATA[<p>The goal of the Shasta long read assembler is to rapidly produce accurate assembled sequence using as input DNA reads generated by&nbsp;<a href="https://nanoporetech.com/">Oxford Nanopore</a>&nbsp;flow cells.</p>
<p>Computational methods used by the Shasta assembler include:</p>
<ul>
<li>Using a&nbsp;<a href="https://en.wikipedia.org/wiki/Run-length_encoding">run-length</a>&nbsp;representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.</li>
<li>Using in some phases of the computation a representation of the read sequence based on&nbsp;<em>markers</em>, a fixed subset of short k-mers (k &asymp; 10).</li>
</ul>
<p>More at&nbsp;<a href="https://chanzuckerberg.github.io/shasta/index.html">https://chanzuckerberg.github.io/shasta/index.html</a></p><p>Address of the bookmark: <a href="https://github.com/chanzuckerberg/shasta" rel="nofollow">https://github.com/chanzuckerberg/shasta</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16160/research-scientist-%E2%80%93-bioinformatics-at-sidra-medical-and-research-center</guid>
  <pubDate>Wed, 10 Sep 2014 14:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – Bioinformatics at Sidra Medical and Research Center]]></title>
  <description><![CDATA[
<p>Sidra Medical and Research Center(Doha, Qatar) is looking for talented Research Scientists (Bioinformatics / NGS Data Analysis).</p>

<p>Research Scientists within the Bioinformatics Program are involved in research related to cutting edge genomics and analysis of omics data. The research will utilize concepts, theories and best practices obtained from bioinformatics discipline and applied to biological and other biomedical data for analysis. The role may also involve designing databases, algorithm and/or computation methods for analyzing genomics and other omics data.  The scientist will be working closely with the Translational Medicine Program within a state-of-the art research setting.</p>

<p>Please check the details of the opening and apply here: http://careers.sidra.org/sidra/Vacan...acancyID=60181</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 04:06:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40715/mutatrix-a-population-genome-simulator-which-generates-simulated-genomes</link>
	<title><![CDATA[mutatrix: a population genome simulator which generates simulated genomes.]]></title>
	<description><![CDATA[<p><span>genome simulation across a population with zeta-distributed allele frequency, snps, insertions, deletions, and multi-nucleotide polymorphisms</span></p>
<p><span>More at&nbsp;<a href="https://github.com/ekg/mutatrix">https://github.com/ekg/mutatrix</a></span></p>
<pre>./mutatrix -S sample -P test/ -p 2 -n 10 reference.fasta</pre><p>Address of the bookmark: <a href="https://github.com/ekg/mutatrix" rel="nofollow">https://github.com/ekg/mutatrix</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/16472/internship-nipgr</guid>
  <pubDate>Sat, 13 Sep 2014 16:02:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[INTERNSHIP @ NIPGR]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for six months ‘Training Fellowship' at National Institute of Plant Genome Research (NIPGR).</p>

<p>About National Institute Of Plant Genome Research (NIPGR) http://www.nipgr.res.in/</p>

<p>The National Institute of Plant Genome Research is an autonomous institution supported by the Department of Biotechnology, Government of India. It is committed to make the institute a premier Institution for plant genomic research in the country. It was established to contribute in the achievement of such hopes as a part of national effort for meeting the challenges in the midst of fast pace of international genomic research and grasping of opportunities on long-term basis.</p>

<p>About the Internship:</p>

<p>The selected intern(s) will work in the area of in Bioinformatics under the BTISNET program of DBT in the Distributed Information Sub center (DISC) facility at NIPGR, New Delhi, under the supervision of Dr. Gitanjali Yadav, Scientist, NIPGR.</p>

<p>Who can apply:</p>

<p>Students currently pursuing the final year of Masters Degree (or equivalent) in Bioinformatics/Biotechnology with strong interest in Computational Biology and First class/division throughout academic career may apply.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Wed, 07 Jun 2017 04:18:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33461/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 - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html<br><br><strong>Features</strong><br><br>&nbsp;&nbsp;&nbsp; Mapping position agnostic to alignment parameters.<br>&nbsp;&nbsp;&nbsp; Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.<br>&nbsp;&nbsp;&nbsp; Circular genome handling to resolve coverage drops near ends of the genome.<br>&nbsp;&nbsp;&nbsp; E-value.<br>&nbsp;&nbsp;&nbsp; Meaningful mapping quality.<br>&nbsp;&nbsp;&nbsp; Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).<br>&nbsp;&nbsp;&nbsp; Overlapping of reads for de novo assembly.<br>&nbsp;&nbsp;&nbsp; Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.<br>&nbsp;&nbsp;&nbsp; ...and much more.<br><br>GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).<br>Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.<br><br>Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.<br>Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.</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>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/16682/java-utilities-for-next-generation-sequencing-by-pierre-lindenbaum</guid>
	<pubDate>Mon, 15 Sep 2014 17:24:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/16682/java-utilities-for-next-generation-sequencing-by-pierre-lindenbaum</link>
	<title><![CDATA[Java utilities for Next Generation Sequencing  by Pierre Lindenbaum]]></title>
	<description><![CDATA[<div>
<div>
<p>Java utilities for Bioinformatics</p>
</div>
<div>
<p><a href="https://github.com/lindenb/jvarkit">https://github.com/lindenb/jvarkit</a></p>
</div>
</div><p>Address of the bookmark: <a href="https://github.com/lindenb/jvarkit" rel="nofollow">https://github.com/lindenb/jvarkit</a></p>]]></description>
	<dc:creator>Robert M Willioms</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>