<?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/26852?offset=980</link>
	<atom:link href="https://bioinformaticsonline.com/related/26852?offset=980" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26426/genome-browser-gbrowse</guid>
	<pubDate>Fri, 19 Feb 2016 09:22:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26426/genome-browser-gbrowse</link>
	<title><![CDATA[Genome Browser : GBrowse]]></title>
	<description><![CDATA[<p>Generic Genome Browser Version 2: A Tutorial for Administrators</p>
<p>This is an extensive tutorial to take you through the main features and gotchas of configuring GBrowse as a server. This tutorial assumes that you have successfully set up Perl, GD, BioPerl and the other GBrowse dependencies. If you haven't, please see the <a href="http://gmod.org/wiki/GBrowse_2.0_HOWTO">GBrowse HOWTO</a> During most of the tutorial, we will be using the "in-memory" GBrowse database (no relational database required!) Later we will show how to set up a genome size database using the berkeleydb and MySQL adaptors.</p>
<p>More at http://elp.ucdavis.edu/tutorial/tutorial.html</p><p>Address of the bookmark: <a href="http://elp.ucdavis.edu/tutorial/tutorial.html" rel="nofollow">http://elp.ucdavis.edu/tutorial/tutorial.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26554/ra-at-north-eastern-hill-university</guid>
  <pubDate>Wed, 02 Mar 2016 08:27:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[RA at North-Eastern Hill University]]></title>
  <description><![CDATA[
<p>North-Eastern Hill University</p>

<p>Umshing, Shillong- 793 022</p>

<p>Applications are invited for the following positions (purely temporary posts) in an UGC-ISF funded Indo-Israel Joint Research Project entitled “Interactions of mRNA export factors and nuclear pores characterized and quantified by biochemistry, biophysics and high-resolution imaging” sanctioned to Dr. Timir Tripathi, Molecular and Structural Biophysics Laboratory, Department of Biochemistry, NEHU, Shillong for 3 years (2016-19).</p>

<p>Details of positions:</p>

<p>1. Research Associate (two): bioinformatics/computational biology (One) and wet-lab biophysics (one).</p>

<p>2. Junior Research Fellow, JRF (One).</p>

<p>3. Project Assistant (One).</p>

<p>Fellowship: As per GOI rules.</p>

<p>Essential Qualifications:</p>

<p>1. Research Associate: Ph.D. in the above-mentioned fields, should be evident through quality publications. Those who have submitted Ph.D. thesis can also apply.</p>

<p>2. Junior Research Fellow: M.Sc. or equivalent in any branch of life sciences with a good academic record. Prior research experience is desirable.</p>

<p>3. Project Assistant: Graduation in any subject.</p>

<p>Must be familiar with working on computer and MS-Office.</p>

<p>Interested students can apply for the positions online using the following link http://goo.gl/forms/FEa802lNGc , latest by 16.03.16. The hard copy of the application is not required. The date of interview will be informed after primary scrutiny of the applications.</p>

<p>No TA/DA will be paid if called for interview. For any other enquiry email at msb.biochem@gmail.com .</p>

<p>For details of the research work of the PI’s group please visit www.ttripathi.webs.com</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26627/scientist-computational-genomics-two-positions</guid>
  <pubDate>Sat, 12 Mar 2016 18:07:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist - Computational Genomics (Two Positions)]]></title>
  <description><![CDATA[
<p>ICRISAT is a non-profit, non-political organization that conducts agricultural research for development in Asia and sub-Saharan Africa with a wide array of partners throughout the world. Covering 6.5 million square kilometers of land in 55 countries, the semi-arid tropics is home to over 2 billion people, with 650 million of these being the poorest of the poor. ICRISAT and its partners help empower those living in the semi-arid tropics, especially smallholder farmers, to overcome poverty, hunger, malnutrition and a degraded environment through more efficient and profitable agriculture.</p>

<p>ICRISAT is headquartered in Patancheru near Hyderabad, India, with two regional hubs and five country offices in sub-Saharan Africa. ICRISAT, established in 1972, is a member of the CGIAR Consortium. For more details, see www.icrisat.org.</p>

<p>Responsibilities:Design efficient SQL queries for pulling large sequencing projects.<br />Serve as a technical adviser to the project leadership and provide computational perspective on product design and deliverability.<br />Develop and oversee a rapid and incremental software development and release schedule.<br />Design the software architecture, oversee the implementation and evolution of the design on appropriate hardware platforms.<br />Working collaboratively in a team environment to design, code, test, debug, and document programs for an integrated genomic analysis pipeline in a rapid and incremental software development and release schedule.<br />Supervise and review code development and ensure that software products meet project objectives in terms of functionality, scalability, robustness and user experience.<br />Implement and oversee the QA/QC practices to ensure the development team is adhering to quality standards.<br />Work closely with the application specialist to integrate feedbacks from teams in each CGIAR center into software customization and improvement.<br />Assist in training of breeders in the CGIAR centers to use software developed.<br /> Personal Profile:</p>

<p>The applicant should have:</p>

<p>Understanding of genomics data and advanced knowledge of Java, and C/C++ as the programming languages and any of the scripting language like perl and/or Python, SQL<br />High Performance Computing, data architecture, database platforms and QA/QC practices in software engineering.<br />She/he should have solid experience in software development projects, preferably as a senior programmer or in the software project management role, and in projects involving big data.<br />Excellent communication skills are needed to work in this multi-disciplinary, multi-location and multi-cultural team.<br />Ability to mentor colleagues in quality software development practices is desired.<br />Educational Qualification : Ph. D or Masters Degree in Computational Biology / Computational Genomics or Equivalent with Research Experience in Mentioned Areas.</p>

<p>More at http://www.icrisat.org/careers/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</guid>
	<pubDate>Wed, 23 Mar 2016 05:53:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26752/rna-seq-de-novo-assembly-using-trinity</link>
	<title><![CDATA[RNA-Seq De novo Assembly Using Trinity]]></title>
	<description><![CDATA[<p>Trinity, developed at the <a href="http://www.broadinstitute.org">Broad Institute</a> and the <a href="http://www.cs.huji.ac.il">Hebrew University of Jerusalem</a>, represents a novel method for the efficient and robust de novo reconstruction of transcriptomes from RNA-seq data. Trinity combines three independent software modules: Inchworm, Chrysalis, and Butterfly, applied sequentially to process large volumes of RNA-seq reads. Trinity partitions the sequence data into many individual de Bruijn graphs, each representing the transcriptional complexity at at a given gene or locus, and then processes each graph independently to extract full-length splicing isoforms and to tease apart transcripts derived from paralogous genes. Briefly, the process works like so:</p>
<ul>
<li>
<p><em>Inchworm</em> assembles the RNA-seq data into the unique sequences of transcripts, often generating full-length transcripts for a dominant isoform, but then reports just the unique portions of alternatively spliced transcripts.</p>
</li>
<li>
<p><em>Chrysalis</em> clusters the Inchworm contigs into clusters and constructs complete de Bruijn graphs for each cluster. Each cluster represents the full transcriptonal complexity for a given gene (or sets of genes that share sequences in common). Chrysalis then partitions the full read set among these disjoint graphs.</p>
</li>
<li>
<p><em>Butterfly</em> then processes the individual graphs in parallel, tracing the paths that reads and pairs of reads take within the graph, ultimately reporting full-length transcripts for alternatively spliced isoforms, and teasing apart transcripts that corresponds to paralogous genes.</p>
</li>
</ul>
<p>More at https://github.com/trinityrnaseq/trinityrnaseq/wiki</p>
<p>......................................................................................................................................</p>
<p>Download Trinity <a href="https://github.com/trinityrnaseq/trinityrnaseq/releases">here</a>.</p>
<p>Build Trinity by typing 'make' in the base installation directory.</p>
<p>Assemble RNA-Seq data like so:</p>
<pre><code> Trinity --seqType fq --left reads_1.fq --right reads_2.fq --CPU 6 --max_memory 20G 
</code></pre>
<p>Find assembled transcripts as: 'trinity_out_dir/Trinity.fasta'</p><p>Address of the bookmark: <a href="https://github.com/trinityrnaseq/trinityrnaseq/wiki" rel="nofollow">https://github.com/trinityrnaseq/trinityrnaseq/wiki</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/26850/wellcome-trustdbt-india-alliance-margdarshi-fellowships-2016</guid>
  <pubDate>Tue, 29 Mar 2016 17:47:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Wellcome Trust/DBT India Alliance Margdarshi Fellowships 2016]]></title>
  <description><![CDATA[
<p>The Wellcome Trust/DBT India Alliance invites application for the Margdarshi Fellowship scheme. The scheme provides a unique opportunity for visionary biomedical scientists to lead and nucleate a cutting edge research program in India in collaboration with Indian Host Institution(s). The potential candidates and the Host Institution are encouraged to make a synergistic effort towards establishing a centre of excellence that aims to improve the existing scientific breadth and utilizes the experience of the lead applicant for developing new research platforms. In addition to this, under this programme two eligible Indian institutions may also come together towards creating a new program under the leadership of a visionary scientist.</p>

<p>Eligibility</p>

<p>Interested applicants must</p>

<p>Have around 10 years of experience as independent investigator, and can be of any age or nationality<br />Have Sponsor(s) at not-for-profit Host Institution(s) in India, who is willing to extend the desired commitment and resources for program implementation<br />Provisions</p>

<p>The 5 year Fellowship provides</p>

<p>Generous personal support for the Fellow<br />Salary support for personnel, which may include Assistant Professors<br />Large quantum of funds for equipment, animals and consumables<br />Funds to attend scientific gatherings, for collaborative visits and to organize meetings<br />Overheads for the Host Institution<br />Process</p>

<p>A joint online application is invited from the Applicant and the Sponsor(s). The details of the scheme and the funding mechanism are available on the website at http://wellcomedbt.org/fellowshiptype/margdarshi-fellowships.</p>

<p>Application form can be accessed at https://fellowships.wellcomedbt.org/Login.aspx</p>

<p>Sponsored applications due by 2 May 2016</p>

<p>Send your inquiries to margdarshi@wellcomedbt.org</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26906/paired-end-assembler-for-dna-sequences</guid>
	<pubDate>Wed, 06 Apr 2016 05:25:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26906/paired-end-assembler-for-dna-sequences</link>
	<title><![CDATA[PAired-eND Assembler for DNA sequences]]></title>
	<description><![CDATA[<p>PANDASEQ is a program to align Illumina reads, optionally with PCR primers embedded in the sequence, and reconstruct an overlapping sequence.</p>
<p>&nbsp;</p>
<p>More at https://github.com/neufeld/pandaseq</p><p>Address of the bookmark: <a href="https://github.com/neufeld/pandaseq" rel="nofollow">https://github.com/neufeld/pandaseq</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</guid>
	<pubDate>Wed, 06 Apr 2016 13:27:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26919/pear-a-fast-and-accurate-illumina-paired-end-read-merger</link>
	<title><![CDATA[PEAR: a fast and accurate Illumina Paired-End reAd mergeR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p>
<p>More at&nbsp;http://www.exelixis-lab.org/web/software/pear</p>
<p>Paper:&nbsp;http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3933873/</p><p>Address of the bookmark: <a href="http://www.exelixis-lab.org/web/software/pear" rel="nofollow">http://www.exelixis-lab.org/web/software/pear</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26968/scalce</guid>
	<pubDate>Fri, 15 Apr 2016 05:09:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26968/scalce</link>
	<title><![CDATA[SCALCE]]></title>
	<description><![CDATA[<p><span>SCALCE (</span><code>/skeɪlz/</code><span>, a.k.a. boosting&nbsp;</span><span style="text-decoration: underline;">S</span><span>equence&nbsp;</span><span style="text-decoration: underline;">C</span><span>ompression&nbsp;</span><span style="text-decoration: underline;">A</span><span>lgorithms using&nbsp;</span><span style="text-decoration: underline;">L</span><span>ocally&nbsp;</span><span style="text-decoration: underline;">C</span><span>onsistent</span><span style="text-decoration: underline;">E</span><span>ncoding) is a tool for compressing FASTQ files. It is designed specifically for the Illumina-generated FASTQ files, but supports any valid FASTQ with consistent read lengths.&nbsp;</span></p>
<p><span>More at&nbsp;http://sfu-compbio.github.io/scalce/</span></p><p>Address of the bookmark: <a href="http://sfu-compbio.github.io/scalce/" rel="nofollow">http://sfu-compbio.github.io/scalce/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27035/spades</guid>
	<pubDate>Tue, 19 Apr 2016 08:37:08 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27035/spades</link>
	<title><![CDATA[SPAdes]]></title>
	<description><![CDATA[<p>SPAdes &ndash; St. Petersburg genome assembler &ndash; is intended for both standard isolates and single-cell MDA bacteria assemblies. This manual will help you to install and run SPAdes. SPAdes version 3.7.1 was released under GPLv2 on March 8, 2016 and can be downloaded from <a href="http://bioinf.spbau.ru/en/spades" target="_blank">http://bioinf.spbau.ru/en/spades</a>.</p>
<p>Manual at http://spades.bioinf.spbau.ru/release3.7.1/manual.html</p><p>Address of the bookmark: <a href="http://bioinf.spbau.ru/spades" rel="nofollow">http://bioinf.spbau.ru/spades</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</guid>
	<pubDate>Tue, 10 May 2016 07:46:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</link>
	<title><![CDATA[BUSCO: Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs]]></title>
	<description><![CDATA[<ul>
<li><span>High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures like N50.&nbsp;</span></li>
<li></li>
<li><span>BUSCO provides measures for quantitative assessment of genome assembly, gene set, and transcriptome completeness based on evolutionarily informed expectations of gene content from near-universal single-copy orthologs selected from&nbsp;</span><a href="http://orthodb.org/">OrthoDB</a><span>.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments are implemented in open-source software, with comprehensive lineage-specific sets of Benchmarking Universal Single-Copy Orthologs for arthropods, vertebrates, metazoans, fungi, eukaryotes, and bacteria.&nbsp;</span></li>
<li></li>
<li><span>These conserved orthologs are ideal candidates for large-scale phylogenomics studies, and the annotated BUSCO gene models built during genome assessments provide a comprehensive gene predictor training set for use as part of genome annotation pipelines.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments offer intuitive metrics, based on evolutionarily informed expectations of gene content from hundreds of species, to gauge completeness of rapidly accumulating genomic data and satisfy an Iberian's quest for quality - "Busco calidad/qualidade".</span></li>
</ul><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>

</channel>
</rss>