<?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/30304?offset=1580</link>
	<atom:link href="https://bioinformaticsonline.com/related/30304?offset=1580" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</guid>
	<pubDate>Mon, 27 Nov 2017 08:05:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</link>
	<title><![CDATA[SPAdes hybrid genome assembly]]></title>
	<description><![CDATA[<p>When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the&nbsp;<a href="https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0101-6">B fragilis assembly</a>&nbsp;by Mick Watson&rsquo;s group.</p><p>Again, running spades.py will show you the options:</p><div><pre><code>spades.py
</code></pre></div><p>This produces:</p><div><pre><code>SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o &lt;output_dir&gt;

Basic options:
-o      &lt;output_dir&gt;    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    &lt;filename&gt;      file with interlaced forward and reverse paired-end reads
-1      &lt;filename&gt;      file with forward paired-end reads
-2      &lt;filename&gt;      file with reverse paired-end reads
-s      &lt;filename&gt;      file with unpaired reads
--pe&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-&lt;or&gt;    orientation of reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--s&lt;#&gt;          &lt;filename&gt;      file with unpaired reads for single reads library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-&lt;or&gt;    orientation of reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--hqmp&lt;#&gt;-12    &lt;filename&gt;      file with interlaced reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-1     &lt;filename&gt;      file with forward reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-2     &lt;filename&gt;      file with reverse reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-s     &lt;filename&gt;      file with unpaired reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-&lt;or&gt;  orientation of reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--nxmate&lt;#&gt;-1   &lt;filename&gt;      file with forward reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--nxmate&lt;#&gt;-2   &lt;filename&gt;      file with reverse reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--sanger        &lt;filename&gt;      file with Sanger reads
--pacbio        &lt;filename&gt;      file with PacBio reads
--nanopore      &lt;filename&gt;      file with Nanopore reads
--tslr  &lt;filename&gt;      file with TSLR-contigs
--trusted-contigs       &lt;filename&gt;      file with trusted contigs
--untrusted-contigs     &lt;filename&gt;      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  &lt;cp&gt;    restart run with updated options and from the specified check-point ('ec', 'as', 'k&lt;int&gt;', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       &lt;filename&gt;      file with dataset description in YAML format
-t/--threads    &lt;int&gt;           number of threads
                                [default: 16]
-m/--memory     &lt;int&gt;           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       &lt;dirname&gt;       directory for temporary files
                                [default: &lt;output_dir&gt;/tmp]
-k              &lt;int,int,...&gt;   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    &lt;float&gt;         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  &lt;33 or 64&gt;      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]
</code></pre></div><p>As you can see this is also a &ldquo;pipeline&rdquo; of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:</p><div><pre><code>spades.py -t 4 <span>\</span>
          -m 32 <span>\</span>
          -k 31,51,71 <span>\</span>
          --only-assembler <span>\</span>
          -1 miseq.1.fastq -2 miseq.2.fastq <span>\</span>
          --nanopore minion.fastq <span>\</span>
          -o hybrid_assembly
</code></pre></div><p>In turn, these parameters mean</p><ul>
<li>use 4 threads</li>
<li>max memory is 32Gb</li>
<li>use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71</li>
<li>only run the assembler, not the correction algorithm (for speed)</li>
<li>read 1 and read 2 of the MiSeq data</li>
<li>the nanopore data</li>
<li>put the output in folder &ldquo;hybrid_assembly&rdquo;</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7217/contract-faculty-bioinformatics-at-maulana-azad-national-institute-of-technology</guid>
  <pubDate>Thu, 12 Dec 2013 20:46:52 -0600</pubDate>
  <link></link>
  <title><![CDATA[Contract Faculty-Bioinformatics at Maulana Azad National Institute of Technology]]></title>
  <description><![CDATA[
<p>Contract Faculty-Bioinformatics at Maulana Azad National Institute of Technology</p>

<p>Job Description:F.No.11/10(1)/929 Qualifications: Candidates should have Ph.D. degree. If Ph.D. candidates are not available at least Post Graduate degree with GATE/NET qualification is a must. Walk-in-Interview on 19.12.2013 at 2.30 P.M. to 5.30 P.M .. at Maulana Azad National Institute of Technology: Bhopal For more details,please visit website:http://www.manit.ac.in/manitbhopal/Year2013/Recruitment/Contract_faculty/contract%20faculty%202013-2014.pdf</p>

<p>For more @ http://www.manit.ac.in/manitbhopal/Year2013/Recruitment/Contract_faculty/contract%20faculty%202013-2014.pdf</p>

<p>Web address @ :http://www.manit.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5623/yau-group</guid>
  <pubDate>Tue, 15 Oct 2013 13:05:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yau Group]]></title>
  <description><![CDATA[
<p>Yau Group are a new research group based at the Wellcome Trust Centre for Human Genetics and the Department of Statistics at the University of Oxford.</p>

<p>Yau Group develops statistical and computational methods for the analysis of genomic datasets with a particular interest in cancer sequencing applications and the use of Bayesian Statistics.</p>

<p>Yau Group are currently have projects in somatic mutation analysis of heterogeneous cancers, data fusion or integration techniques and single cell genomics.</p>

<p>More @ http://www.well.ox.ac.uk/~cyau/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7218/associate-professor-centre-for-bioinformatics-at-maharshi-dayanand-university-rohtak</guid>
  <pubDate>Thu, 12 Dec 2013 20:49:59 -0600</pubDate>
  <link></link>
  <title><![CDATA[Associate Professor - Centre for Bioinformatics at Maharshi Dayanand University, Rohtak]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT No. PR-54/2013</p>

<p>No. of Posts and Specialization: 1(UR)</p>

<p>Educational Qualification:</p>

<p>(i) Good academic record with a Ph.D. Degree in the concerned /allied /relevant disciplines.</p>

<p>(ii) The Ph.D. Degree shall be a mandatory qualification for all candidates to be appointed as Associate Professor through direct recruitment.</p>

<p>(iii) A Master‟s Degree with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed).</p>

<p>(iv) A minimum of eight years of experience of teaching and /or research in an academic /research position equivalent to that of Assistant Professor in a University, College or Accredited Research Institution/Industry excluding the period of Ph.D research with evidence of published work and a minimum of 5 publications as books and /or research papers in refereed journals only/policy papers.</p>

<p>(v) Contribution to educations innovation, design of new curricula and courses and technology-mediated teaching learning process with evidence of having guided doctoral candidates and research students.</p>

<p>(vi) A minimum score as stipulated in the Academic Performance Indicator (API) based performance Based Appraisal System (PBAS), set out in this notification in as mentioned in the advertisement.</p>

<p>Send your application to the A.R (Estt.Teaching), M.D.University, Rohtak on or before December 23, 2013.</p>

<p>For more details: http://www.mdurohtak.ac.in/pdf/Notices_Pdf/new_notice/Teaching%20Vacancy%20%28ADVT.%20No.%20PR-54%20of%202013%29.pdf</p>

<p>Last Apply Date: 23 Dec 2013</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/opportunity/view/5888/nit-calicut-faculty-jobs-2013-in-bioinformatics</guid>
  <pubDate>Thu, 24 Oct 2013 13:00:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[NIT Calicut Faculty Jobs 2013 in Bioinformatics]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY CALICUT, KERALA</p>

<p>NOTIFICATION FOR FACULTY RECRUITMENT – 2013</p>

<p>(Faculty openings in Technology, Science, Architecture and Management at NIT Calicut, Kerala)</p>

<p>National Institute of Technology Calicut, Kerala, established under Act XXIX/ 2007of the Parliament is one of the leading technological institutions in the Country with nearly 6000 students enrolled for various UG, PG and Ph.D. programmes in Technology, Science, Architecture and Management. The Institute invites applications from Indian nationals, possessing consistent excellent academic record, commitment to quality teaching and potential for carrying out outstanding research, for the post of Assistant Professors in various departments against the backlog reserved vacancies for Scheduled Caste (SC), Scheduled Tribe (ST), Other Backward Communities (OBC) and Persons with Disabilities (PWDs) and also under open merit quota as detailed below. Candidates belonging to SC, ST and OBC desirous of considering for selection under UR category also shall specifically indicate so in column 4.</p>

<p>Reservation quota for PWDs will be counted against the respective community. Young, meritorious, dynamic and student friendly academicians are welcome to join hands with the existing team in their effort to transform this Institute to a world class educational institution.</p>

<p>Candidates possessing Ph.D. degree will be considered for appointment on contract basis initially.</p>

<p>They will be considered for movement to AGP `7000 after one year of satisfactory performance.</p>

<p>Meritorious candidates possessing M.Tech./M.Phil. (*) with remarkably good potential to carry out outstanding research and already pursuing Ph.D. or aspiring to pursue Ph.D. will also be considered for appointment on contract, initially for a period of 3 years, extendable for a further period of 2 years on a year to year basis or till the candidate acquires Ph.D. degree whichever is earlier. Renewal of contract<br />will be done on an annual basis, subject to satisfactory progress of Ph.D. work, good conduct and good performance in teaching. Faculty appointed on contract basis will not be treated as regular staff till they are regularized, subject to the conditions stated earlier. The Institute has adopted 4-tier flexible faculty structure recommended by MHRD. </p>

<p>More Info : http://www.nitc.ac.in/index.php/?url=content/submenu/2345/5</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/5958/srfjrf-national-institute-of-immunology</guid>
  <pubDate>Wed, 30 Oct 2013 06:45:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF/JRF @ National Institute of Immunology]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT OF WALK-IN-INTERVIEW</p>

<p>NAME OF THE POST : SRF/JRF (Four Posts only)</p>

<p>DURATION : Indicated with the respective project mentioned below:</p>

<p>NAME OF THE PROJECT : As Mentioned below:</p>

<p>1. Serological diversity and molecular characterization of Dichelobector nodusus and development of vaccine against virulent footroot funded by NAIP. (Tenable upto 31.03.2014)</p>

<p>2. Development of oral vaccine against Clostridium perfringenes employing translational fusion of immunodominant epitopes of beta toxin with heat labile entertoxin B funded by DBT. (Tenable upto 25.02.2014)</p>

<p>3. Indo-Norwegian project, “Evaluation of major porins, ompC and ompR of Areomonas hydrophila as potential vaccine candidates and identification and characterization of immune genes of Indian major carp, Labeo rohita” (Tenable upto 31.03.2014)</p>

<p>EDUCATIONAL QUALIFICATIONS: For JRF- M.Sc/M.Tech in any subject of Biological  Sciences/Life Sciences</p>

<p>For SRF- M.Sc/M.Tech in any subject of Biological Sciences/Life Sciences with 2 years of Research Experience.</p>

<p>JOB DESCRIPTION : The Candidate should have experience in gene Expression, protein purification, molecular biology techniques and bioinformatics<br />EMOLUMENTS : SRF: Rs. 18,000/- per month consolidated plus 30% HRA if /NET/GATE qualified otherwise Rs. 14,000/- per month consolidated + 30% HRA.</p>

<p>JRF: Rs. 16,000/- per month consolidated + 30% HRA if NET/GATE qualified otherwise Rs. 12,000/- per month consolidated + 30% HRA</p>

<p>SCIENTIST NAME : Dr. Lalit C. Garg, SS-VII (Gene Regulation Lab)</p>

<p>SCIENTIST’S EMAIL : lalit@nii.ac.in</p>

<p>WALK IN INTERVIEW ON : October 31st, 2013</p>

<p>REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM </p>

<p>Advertisement: http://www1.nii.res.in/sites/default/files/project-Dr.Lalit-31oct2013.pdf</p>
]]></description>
</item>

</channel>
</rss>