<?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/30701?offset=1470</link>
	<atom:link href="https://bioinformaticsonline.com/related/30701?offset=1470" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30658/srf-bioinformatics-at-jnu</guid>
  <pubDate>Tue, 24 Jan 2017 07:34:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF Bioinformatics at JNU]]></title>
  <description><![CDATA[
<p>School of Life Sciences <br />Jawaharlal Nehru University <br />New Delhi 110067</p>

<p>Positions available</p>

<p>Applications were invited from for the following posts in an industry sponsored project. The project entitled "OsHK3b technology and Know How", valid for a period upto February, 2018.</p>

<p>Post 3: Senior Research Fellow (Computational Biologist / Metabolic engineering)</p>

<p>Salary: As per DBT rule.</p>

<p>Duration: All the above posts are purely temporary and liable to be terminated at any time without prior notice or ceased/withdrawn by the funding agency.</p>

<p>Age limit: The upper age limit for SRF shall be 32 years, which is relaxed upto 5 years in the case of candidates belonging to Schedule Castes/Schedule Tribes, Women, Physically Handicapped and OBC applicants.</p>

<p>Essential Qualifications: Masters/B Tech/Mtech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building &amp; maintenance, high throughput data handling and analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must. Selection preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.</p>

<p>Desired Skills: Will be expected to manage ongoing research activities in the project, interact with Experimental group, manage the project data analysis, prepare file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.</p>

<p>1. The post applied for must be clearly written on the Envelope containing the application <br />2. Applications received after last date shall not be entertained, School will not be responsible for any postal delay. <br />3. No application will be accepted via hand delivery or via e-mail. Please send printed &amp; signed applications with detailed CV on or before 31st January, 2017 by post to the following address:</p>

<p>Prof. Ashwani Pareek <br />(Project Investigator) <br />Stress Physiology and Molecular Biology Laboratory (Room No-413), <br />School of Life Sciences, <br />Jawaharlal Nehru University, <br />New Delhi, India – 110067 <br />Email: ashwanipareek@gmail.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/30744/binc-2017</guid>
	<pubDate>Wed, 01 Feb 2017 09:36:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/30744/binc-2017</link>
	<title><![CDATA[BINC 2017]]></title>
	<description><![CDATA[<p><span>Pondicherry University,Puducherry,on behalf of Department of Biotechnology, Government of India, conducted the BINC examination in&nbsp;</span><span style="color: blue;">2015 and 2016.&nbsp;</span><span>The objective of this examination is to certify bioinformatics professionals, trained formally as well as self-trained.</span><span style="color: blue;">Registration for BINC 2017 examination will open from January 29,2017 to February 28,2017.</span><span>&nbsp;</span></p><p><span>Pondicherry University, Puducherry has been identified as a nodal agency by the Department of Biotechnology, Govt. of India to coordinate this examination along with nine centres namely, </span></p><p><span>Pune University, Pune; </span></p><p><span>Anna University, Chennai; </span></p><p><span>Bose Institute, Kolkata; </span></p><p><span>Institute of Bioinformatics &amp; Applied Biotechnology, Bangalore; </span></p><p><span>North-Eastern Hill University, Shillong, University of Hyderabad, Hyderabad; </span></p><p><span>University of Kerala, Thiruvananthapuram; </span></p><p><span>Jawaharlal Nehru University, New Delhi and </span></p><p><span>Assam Agricultural University, Guwahati.</span><span style="color: blue;"><strong>&nbsp;</strong></span></p><p><span style="color: blue;"><strong>In the BINC 2015 and 2016 examination, 23 candidates and five candidates were certified respectively.</strong></span><span>&nbsp;DBT has agreed to fund Research fellowships for all the BINC qualified Indian nationals to pursue Ph.D. in Indian Institutes/Universities. </span></p><p><span>Note that the candidate must possess a postgraduate degree(or equivalent) &amp; meet the criteria of the institutes/universities in order to avail research fellowship. </span></p><p><span>In addition, cash prize of Rs. 10,000/- will be awarded to the top 10 BINC qualifiers.</span></p><p><span>More at&nbsp;http://www.pondiuni.edu.in/exams/binc/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30889/phd-program-in-computer-science-at-university-of-essex</guid>
  <pubDate>Sat, 11 Feb 2017 13:11:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD program in Computer Science at University of Essex]]></title>
  <description><![CDATA[
<p>As part of the PhD program in Computer Science at University of Essex, I am looking for a PhD student in computational and synthetic biology.<br />The ideal candidate is interested in designing new biological design automation methods for genome scale projects and/or network modelling of genomic, transcriptomic and proteomic data.<br />Candidates interested in developing optimization algorithms for biological problems are encouraged to apply as well.<br />A summary of the research work in the lab can be found on o this page.</p>

<p>Candidates interested in the position should contact me in advance by email to: g.stracquadanio@essex.ac.uk</p>

<p>The deadline for the application is 28/02/2017; info about the application can be found on the Essex CSEE website.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long reads]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p>
<p>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/31520/research-associate-openings-at-iasri-india</guid>
  <pubDate>Fri, 10 Mar 2017 03:53:03 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate openings at IASRI, India]]></title>
  <description><![CDATA[
<p>Research Associate (RA) Two (2) </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. </p>

<p>Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics <br />Knowledge in computer programming, LINUX OS. <br />Expertise in use of R/other Bioinformatics software </p>

<p>More at http://iasri.res.in/employment/2017/cabin_advertisement_RA_SRF_YP_Mar2017.pdf</p>

<p>Phenomics of Moisture Deficit Stress Tolerance and Nitrogen Use December 31, 2019 </p>

<p>Research Associate (RA) Two (2) </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or System Administrator/ Computer expert for database development, development of phenome data bank and virtual phenomics facility, data archiving and Efficiency in Rice and Wheat-Phase II (Funded by National Agricultural Science Fund, ICAR) Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. maintenance; Development of image analysis algorithms, APIs and IAPs. </p>

<p>Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics <br />Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software &amp; tools. <br />December 31, 2019 </p>

<p>Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science / Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. </p>

<p>Knowledge of Statistical and Computational Genomics/ Bioinformatics. <br />Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software &amp; tools. <br />March 31, 2020</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</guid>
	<pubDate>Tue, 05 Jun 2018 10:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36867/cerulean-a-hybrid-assembly-using-high-throughput-short-and-long-reads</link>
	<title><![CDATA[Cerulean: A hybrid assembly using high throughput short and long reads]]></title>
	<description><![CDATA[Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads.

Cerulean v0.1 has been implemented with bacterial genomes in mind.

The method is fully described in Deshpande, V., Fung, E. D., Pham, S., &amp; Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933.
http://arxiv.org/abs/1307.7933<p>Address of the bookmark: <a href="https://sourceforge.net/projects/ceruleanassembler/" rel="nofollow">https://sourceforge.net/projects/ceruleanassembler/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>