<?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/31345?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/31345?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4081/csir-institute-of-genomics-integrative-biology</guid>
  <pubDate>Thu, 29 Aug 2013 05:22:03 -0500</pubDate>
  <link></link>
  <title><![CDATA[CSIR-INSTITUTE OF GENOMICS &amp; INTEGRATIVE BIOLOGY]]></title>
  <description><![CDATA[
<p>CSIR-INSTITUTE OF GENOMICS &amp; INTEGRATIVE BIOLOGY, Mall Road, Delhi 110007</p>

<p>POSITIONS OPEN FOR TEMPORARY RESEARCH PROJECT POSTS</p>

<p>(Date of interview 23rd September 2013 at 10:30 AM)</p>

<p>CSIR-Institute of Genomics &amp; Integrative Biology (IGIB), desires to engage qualified incumbents on purely temporary basis as detailed below:</p>

<p>Project Code/Title (Project Code BSC0123)</p>

<p>Genome dynamics in Cellular Organization, Differentiation and Enantiostasis (GENCODE)</p>

<p>Project Fellow<br />	<br />First Class M.Sc./M.Tech in bioinformatics/Human Genetics/Genomics</p>

<p>Rs. 16,000/- + 30 % HRA per month</p>

<p>Sr. Project Fellow	</p>

<p>First Class M.Sc./M.Tech in bioinformatics/Human Genetics/Genomics</p>

<p>With two years of experience in NGS data analysis.</p>

<p>Rs. 18,000/- + 30 % HRA per month</p>

<p>Age relaxation as per Govt. of India instructions.</p>

<p>Engagement is for the project and on behalf of the funding agency and the tenure shall be as mentioned above. The duration of the post is initially for One year or till the closing date of the project, whichever is earlier. Tenure may be extendable up to project duration. Contract may be terminated at any time by giving one-month notice by either side. The applicants will have no claim implicit or explicit for consideration against any CSIR/IGIB post.</p>

<p>How to Apply:</p>

<p>It is mandatory for eligible applicants to apply by both the processes as given below:</p>

<p>1.    Sending the resume in MS Word format directly to hrd@igib.res.in (Mentioning the Project Code-Post Code in the Subject Line of the email example:GAP0059-1)</p>

<p>2.    They also need to fill up proforma by clicking on the following link HR Online Form.</p>

<p>3.    Candidate cannot apply for more than two posts.</p>

<p>Last date of receiving application is 02-09-2013.</p>

<p>No application would be entertained with result awaited status or after due date.</p>

<p>The email will be sent to the short listed candidates.</p>

<p>No TA/DA will be paid to the candidates to attend the interview. The engagement shall be as per guidelines of CSIR/Funding agency. Candidates will have an option to give reply in Hindi.</p>

<p>Note: The shortlisted candidates, who will receive the email for interview, have to report at 09:00 AM on the day of interview along with any Photo ID card and original certificates for entry purpose. Entry will be closed by 10:00 AM.</p>

<p>More @ http://www.igib.res.in/sites/default/files/23092013.htm</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</guid>
	<pubDate>Wed, 29 Nov 2017 07:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34482/ribbon-visualizing-complex-genome-alignments-and-structural-variation</link>
	<title><![CDATA[Ribbon: Visualizing complex genome alignments and structural variation:]]></title>
	<description><![CDATA[<p>Ribbon can be used for long reads, short reads, paired-end reads, and assembly/genome alignments. Instructions for each data format are available by clicking on "instructions" in each tab on the right.</p>
<p>Local installation:</p>
<p>You can install Ribbon locally from Github by following the instructions here:&nbsp;<a href="https://github.com/MariaNattestad/ribbon" target="_blank">https://github.com/MariaNattestad/Ribbon</a></p><p>Address of the bookmark: <a href="http://genomeribbon.com/" rel="nofollow">http://genomeribbon.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</guid>
	<pubDate>Fri, 23 Aug 2013 06:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</link>
	<title><![CDATA[Python and BioPython Tutorial]]></title>
	<description><![CDATA[<p>A quickstart tutorial that allows to become familiar with the Python language. The exercises expect knowledge of basic concepts of programming. A group of 2nd year computer science students with no previous Python knowledge required 60'-90' to complete the exercises. With about 3 hours time, the exercise is suitable for non-programmers as well.</p><p>Address of the bookmark: <a href="http://www.biotnet.org/training-materials/python-programmers" rel="nofollow">http://www.biotnet.org/training-materials/python-programmers</a></p>]]></description>
	<dc:creator>Manshi Raghubanshi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</guid>
	<pubDate>Tue, 12 Dec 2017 17:30:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34620/mash-fast-genome-and-metagenome-distance-estimation-using-minhash</link>
	<title><![CDATA[Mash: fast genome and metagenome distance estimation using MinHash]]></title>
	<description><![CDATA[<p>Mash is normally distributed as a dependency-free binary for Linux or OSX (see&nbsp;<a href="https://github.com/marbl/Mash/releases">https://github.com/marbl/Mash/releases</a>). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC &gt;= 4.8 and OSX &gt;= 10.7.</p>
<p>See&nbsp;<a href="http://mash.readthedocs.org/">http://mash.readthedocs.org</a>&nbsp;for more information.</p><p>Address of the bookmark: <a href="https://github.com/marbl/Mash/releases" rel="nofollow">https://github.com/marbl/Mash/releases</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/3967/research-project-posts-for-csir-project-delhi</guid>
  <pubDate>Tue, 27 Aug 2013 04:31:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Project Posts for CSIR Project, Delhi]]></title>
  <description><![CDATA[
<p>Positions Open For Temporary Research Project Posts for CSIR Project, Delhi<br />CSIR is looking for bright young candidates to get involved in building algorithms and platforms for large biological data analyses in the areas of comparative genomics, computational workflows, disease association studies, simulating virtual organelles, etc. Anyone who fulfills the eligibility criteria mentioned below may appear for a walk-in interview on 3rd September 2013 at CSIR Headquarters, Anusandhan Bhawan, 2 Rafi Marg, Delhi – 110001.<br />you can go to link for details or download PDF</p>

<p>http://www.csir.res.in/External/Heads/aboutcsir/announcements/ProjectPost_130813.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</guid>
	<pubDate>Sat, 03 Feb 2018 04:59:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</link>
	<title><![CDATA[MUMmer4: A fast and versatile genome alignment system]]></title>
	<description><![CDATA[<p><span>MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the&nbsp;</span><span>nucmer</span><span>&nbsp;program in MUMmer4 is easily able to handle alignments of large genomes;&nbsp;</span></p><p>Address of the bookmark: <a href="https://mummer4.github.io/" rel="nofollow">https://mummer4.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</guid>
	<pubDate>Thu, 29 Aug 2013 09:23:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4098/bioinformatics-algorithm-demonstrations-and-tutorials</link>
	<title><![CDATA[Bioinformatics Algorithm Demonstrations and Tutorials]]></title>
	<description><![CDATA[<p>Abstract</p>
<p>This project presents demonstrations of selected computer science algorithms important in&nbsp;bioinformatics, implemented in the spreadsheet program Microsoft Excel. Spreadsheets provide an&nbsp;interesting platform for demonstration of algorithms, since various steps of the calculations can be&nbsp;exposed in a manner that is easily comprehensible to users with little programming experience. The&nbsp;algorithms demonstrated include two approaches to approximate string matching (dynamic programming&nbsp;and Shift-AND numeric approximate matching), Hierarchical Clustering (used in phylogenetic studies&nbsp;and microarray analysis of gene expression), a Naive Bayes Classifier for simulated microarray gene&nbsp;expression data, and a simple Neural Network. These demonstrations are designed to serve as&nbsp;instructional aids in bioinformatics courses.</p>
<p>Tutorial @&nbsp;http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsInExcel.zip</p>
<p>One of the best resource for online bioinformatics learning is https://stepic.org/Bioinformatics-Algorithms-2 Enjoy the online learning.</p>
<p>Reference :&nbsp;cybertory</p>
<blockquote>
<p><span>" Please add your favourite bioinformatics algorithms and tutorial links below in the comment section, for the benefit of bioinformatics and computational biology community ".&nbsp;</span></p>
</blockquote><p>Address of the bookmark: <a href="http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf" rel="nofollow">http://www.cybertory.org/downloads/bae/BioinformaticsAlgorithmsExcelDoc.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</guid>
	<pubDate>Tue, 08 May 2018 04:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36516/metassembler-merging-and-optimizing-de-novo-genome-assemblies</link>
	<title><![CDATA[Metassembler: merging and optimizing de novo genome assemblies]]></title>
	<description><![CDATA[<p><span>Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies.</span></p>
<p><span><span>Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence.&nbsp;</span></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/metassembler/?source=directory" rel="nofollow">https://sourceforge.net/projects/metassembler/?source=directory</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</guid>
	<pubDate>Mon, 02 Sep 2013 07:02:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</link>
	<title><![CDATA[4273π: Bioinformatics education on low cost ARM hardware]]></title>
	<description><![CDATA[<p>Are you teaching bioinformatics at universities and found it complicated by typical computer classroom settings. As well as running software locally and online, students should gain experience of systems administration. Hmm don't worry there is one new OS for the rescue. 4273<em>&pi;</em>, an operating system image for Raspberry Pi based on Raspbian Linux. It provides an attractive, general-purpose computing environment, within which the course 4273&pi; Bioinformatics for Biologists is embedded.<br /><br />Though far slower than current desktop and laptop computers, the Raspberry Pi is notably faster than the Cray 1 supercomputer, a marvel of computer speed in its day. The Raspberry Pi approach includes all the benefits of the laptop approach, above, but at lower cost. In addition, the Raspberry Pi is a new and exciting computer system, which in itself can add interest to the course.<br /><br />As the Raspbian operating system, Raspberry Pi firmware and hardware and 4273&pi; Bioinformatics for Biologists teaching material develop, further releases of 4273&pi; will be made available. It is anticipated that there will be a minimum of two releases per year during the next four years.</p><p>4273<em>&pi;</em> is a means to teach bioinformatics, including systems administration tasks, to undergraduates at low cost.</p><p>Descriptive paper @ http://www.biomedcentral.com/1471-2105/14/243</p><p>Image source: BMC Bioinformatics</p><p><img src="http://www.biomedcentral.com/content/download/figures/1471-2105-14-243-1.png" alt="image" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</guid>
	<pubDate>Mon, 11 Jun 2018 03:08:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36890/price-paired-read-iterative-contig-extension-a-de-novo-genome-assembler-implemented-in-c</link>
	<title><![CDATA[PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.]]></title>
	<description><![CDATA[We are pleased to release PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other assembler.

http://derisilab.ucsf.edu/software/price/<p>Address of the bookmark: <a href="http://derisilab.ucsf.edu/software/price/" rel="nofollow">http://derisilab.ucsf.edu/software/price/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

</channel>
</rss>