<?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/36239?offset=1500</link>
	<atom:link href="https://bioinformaticsonline.com/related/36239?offset=1500" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22432/walk-ins-for-jrf-ans-srf-post-in-assam-agricultural-university</guid>
  <pubDate>Thu, 28 May 2015 19:16:47 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for JRF ans SRF post in Assam Agricultural University]]></title>
  <description><![CDATA[
<p>Distributed Information Centre<br />Department of Agricultural Biotechnology<br />Assam Agricultural University<br />Jorhat – 785 013<br />Walk-in interview</p>

<p>(ABT/DIC/01/2014 (No. AAU/ABT/DIT/Advt. 01/2015/111 Dtd. 19-05-2015)</p>

<p>Walk in interview for the following position will be held on 6th June, 2015 at 10.00AM in the Office Chamber of the undersigned. Candidates may appear for the interview with bio-data, reprints / publication / thesis etc and passport size photographs, original and attested copies of all testimonials etc, which must be presented at the time of interview. The applicants may submit their resume in advance tomkmodi@aau.ac.in.</p>

<p>Research Associate</p>

<p>    Ph.D. in Biotechnology/ Bioinformatics. Or</p>

<p>    Masters degree in Biotechnology/Bioinformatics with minimum 3(three) years research experience</p>

<p>    Desirable : Experience in Bioinformatics as evidenced from published research</p>

<p>    Rs 36,000+HRA for the 1st two years and 38,000+HRA for the 3rd year.</p>

<p>Senior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics. With 2 (two) years  Experience in Bioinformatics as evidenced from Course work/ Diploma/Published research</p>

<p>    Rs 28,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 18,000+HRA for non-NET qualified general degree holder</p>

<p>Junior Research Fellow</p>

<p>    Master Degree in Biotechnology/ Bioinformatics/Computer Science/Computer Application</p>

<p>    Desirable: Experience in Bioinformatics as evident from Course work/ Diploma/Published research</p>

<p>    Rs 25,000+HRA for NET qualified candidate/Professional degree holder</p>

<p>    Rs 16,000+HRA for non-NET qualified general degree holder</p>

<p>Note: Term and conditions will be as per the DBT, Govt of India guidelines.</p>

<p>Advertisement: http://14.139.222.145/classified/biotech46.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/39307/awk-for-beginners</guid>
	<pubDate>Fri, 26 Apr 2019 16:19:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/39307/awk-for-beginners</link>
	<title><![CDATA[AWK for beginners !]]></title>
	<description><![CDATA[<p>AWK is a standard tool on every POSIX-compliant UNIX system. It&rsquo;s like flex/lex, from the command-line, perfect for text-processing tasks and other scripting needs. It has a C-like syntax, but without mandatory semicolons (although, you should use them anyway, because they are required when you&rsquo;re writing one-liners, something AWK excels at), manual memory management, or static typing. It excels at text processing. You can call to it from a shell script, or you can use it as a stand-alone scripting language.</p><p>Why use AWK instead of Perl? Readability. AWK is easier to read than Perl. For simple text-processing scripts, particularly ones that read files line by line and split on delimiters, AWK is probably the right tool for the job.</p><div><pre><span>#!/usr/bin/awk -f</span>

<span># Comments are like this</span>


<span># AWK programs consist of a collection of patterns and actions.</span>
<span>pattern1</span> <span>{</span> <span>action</span><span>;</span> <span>}</span> <span># just like lex</span>
<span>pattern2</span> <span>{</span> <span>action</span><span>;</span> <span>}</span>

<span># There is an implied loop and AWK automatically reads and parses each</span>
<span># record of each file supplied. Each record is split by the FS delimiter,</span>
<span># which defaults to white-space (multiple spaces,tabs count as one)</span>
<span># You can assign FS either on the command line (-F C) or in your BEGIN</span>
<span># pattern</span>

<span># One of the special patterns is BEGIN. The BEGIN pattern is true</span>
<span># BEFORE any of the files are read. The END pattern is true after</span>
<span># an End-of-file from the last file (or standard-in if no files specified)</span>
<span># There is also an output field separator (OFS) that you can assign, which</span>
<span># defaults to a single space</span>

<span>BEGIN</span> <span>{</span>

    <span># BEGIN will run at the beginning of the program. It's where you put all</span>
    <span># the preliminary set-up code, before you process any text files. If you</span>
    <span># have no text files, then think of BEGIN as the main entry point.</span>

    <span># Variables are global. Just set them or use them, no need to declare..</span>
    <span>count</span> <span>=</span> <span>0</span><span>;</span>

    <span># Operators just like in C and friends</span>
    <span>a</span> <span>=</span> <span>count</span> <span>+</span> <span>1</span><span>;</span>
    <span>b</span> <span>=</span> <span>count</span> <span>-</span> <span>1</span><span>;</span>
    <span>c</span> <span>=</span> <span>count</span> <span>*</span> <span>1</span><span>;</span>
    <span>d</span> <span>=</span> <span>count</span> <span>/</span> <span>1</span><span>;</span> <span># integer division</span>
    <span>e</span> <span>=</span> <span>count</span> <span>%</span> <span>1</span><span>;</span> <span># modulus</span>
    <span>f</span> <span>=</span> <span>count</span> <span>^</span> <span>1</span><span>;</span> <span># exponentiation</span>

    <span>a</span> <span>+=</span> <span>1</span><span>;</span>
    <span>b</span> <span>-=</span> <span>1</span><span>;</span>
    <span>c</span> <span>*=</span> <span>1</span><span>;</span>
    <span>d</span> <span>/=</span> <span>1</span><span>;</span>
    <span>e</span> <span>%=</span> <span>1</span><span>;</span>
    <span>f</span> <span>^=</span> <span>1</span><span>;</span>

    <span># Incrementing and decrementing by one</span>
    <span>a</span><span>++</span><span>;</span>
    <span>b</span><span>--</span><span>;</span>

    <span># As a prefix operator, it returns the incremented value</span>
    <span>++</span><span>a</span><span>;</span>
    <span>--</span><span>b</span><span>;</span>

    <span># Notice, also, no punctuation such as semicolons to terminate statements</span>

    <span># Control statements</span>
    <span>if</span> <span>(</span><span>count</span> <span>==</span> <span>0</span><span>)</span>
        <span>print</span> <span>"Starting with count of 0"</span><span>;</span>
    <span>else</span>
        <span>print</span> <span>"Huh?"</span><span>;</span>

    <span># Or you could use the ternary operator</span>
    <span>print</span> <span>(</span><span>count</span> <span>==</span> <span>0</span><span>)</span> <span>?</span> <span>"Starting with count of 0"</span> <span>:</span> <span>"Huh?"</span><span>;</span>

    <span># Blocks consisting of multiple lines use braces</span>
    <span>while</span> <span>(</span><span>a</span> <span>&lt;</span> <span>10</span><span>)</span> <span>{</span>
        <span>print</span> <span>"String concatenation is done"</span> <span>" with a series"</span> <span>" of"</span>
            <span>" space-separated strings"</span><span>;</span>
        <span>print</span> <span>a</span><span>;</span>

        <span>a</span><span>++</span><span>;</span>
    <span>}</span>

    <span>for</span> <span>(</span><span>i</span> <span>=</span> <span>0</span><span>;</span> <span>i</span> <span>&lt;</span> <span>10</span><span>;</span> <span>i</span><span>++</span><span>)</span>
        <span>print</span> <span>"Good ol' for loop"</span><span>;</span>

    <span># As for comparisons, they're the standards:</span>
    <span># a &lt; b   # Less than</span>
    <span># a &lt;= b  # Less than or equal</span>
    <span># a != b  # Not equal</span>
    <span># a == b  # Equal</span>
    <span># a &gt; b   # Greater than</span>
    <span># a &gt;= b  # Greater than or equal</span>

    <span># Logical operators as well</span>
    <span># a &amp;&amp; b  # AND</span>
    <span># a || b  # OR</span>

    <span># In addition, there's the super useful regular expression match</span>
    <span>if</span> <span>(</span><span>"foo"</span> <span>~</span> <span>"^fo+$"</span><span>)</span>
        <span>print</span> <span>"Fooey!"</span><span>;</span>
    <span>if</span> <span>(</span><span>"boo"</span> <span>!~</span> <span>"^fo+$"</span><span>)</span>
        <span>print</span> <span>"Boo!"</span><span>;</span>

    <span># Arrays</span>
    <span>arr</span><span>[</span><span>0</span><span>]</span> <span>=</span> <span>"foo"</span><span>;</span>
    <span>arr</span><span>[</span><span>1</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>

    <span># You can also initialize an array with the built-in function split()</span>

    <span>n</span> <span>=</span> <span>split</span><span>(</span><span>"foo:bar:baz"</span><span>,</span> <span>arr</span><span>,</span> <span>":"</span><span>);</span>

    <span># You also have associative arrays (actually, they're all associative arrays)</span>
    <span>assoc</span><span>[</span><span>"foo"</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>
    <span>assoc</span><span>[</span><span>"bar"</span><span>]</span> <span>=</span> <span>"baz"</span><span>;</span>

    <span># And multi-dimensional arrays, with some limitations I won't mention here</span>
    <span>multidim</span><span>[</span><span>0</span><span>,</span><span>0</span><span>]</span> <span>=</span> <span>"foo"</span><span>;</span>
    <span>multidim</span><span>[</span><span>0</span><span>,</span><span>1</span><span>]</span> <span>=</span> <span>"bar"</span><span>;</span>
    <span>multidim</span><span>[</span><span>1</span><span>,</span><span>0</span><span>]</span> <span>=</span> <span>"baz"</span><span>;</span>
    <span>multidim</span><span>[</span><span>1</span><span>,</span><span>1</span><span>]</span> <span>=</span> <span>"boo"</span><span>;</span>

    <span># You can test for array membership</span>
    <span>if</span> <span>(</span><span>"foo"</span> <span>in</span> <span>assoc</span><span>)</span>
        <span>print</span> <span>"Fooey!"</span><span>;</span>

    <span># You can also use the 'in' operator to traverse the keys of an array</span>
    <span>for</span> <span>(</span><span>key</span> <span>in</span> <span>assoc</span><span>)</span>
        <span>print</span> <span>assoc</span><span>[</span><span>key</span><span>];</span>

    <span># The command line is in a special array called ARGV</span>
    <span>for</span> <span>(</span><span>argnum</span> <span>in</span> <span>ARGV</span><span>)</span>
        <span>print</span> <span>ARGV</span><span>[</span><span>argnum</span><span>];</span>

    <span># You can remove elements of an array</span>
    <span># This is particularly useful to prevent AWK from assuming the arguments</span>
    <span># are files for it to process</span>
    <span>delete</span> <span>ARGV</span><span>[</span><span>1</span><span>];</span>

    <span># The number of command line arguments is in a variable called ARGC</span>
    <span>print</span> <span>ARGC</span><span>;</span>

    <span># AWK has several built-in functions. They fall into three categories. I'll</span>
    <span># demonstrate each of them in their own functions, defined later.</span>

    <span>return_value</span> <span>=</span> <span>arithmetic_functions</span><span>(</span><span>a</span><span>,</span> <span>b</span><span>,</span> <span>c</span><span>);</span>
    <span>string_functions</span><span>();</span>
    <span>io_functions</span><span>();</span>
<span>}</span>

<span># Here's how you define a function</span>
<span>function</span> <span>arithmetic_functions</span><span>(</span><span>a</span><span>,</span> <span>b</span><span>,</span> <span>c</span><span>,</span>     <span>d</span><span>)</span> <span>{</span>

    <span># Probably the most annoying part of AWK is that there are no local</span>
    <span># variables. Everything is global. For short scripts, this is fine, even</span>
    <span># useful, but for longer scripts, this can be a problem.</span>

    <span># There is a work-around (ahem, hack). Function arguments are local to the</span>
    <span># function, and AWK allows you to define more function arguments than it</span>
    <span># needs. So just stick local variable in the function declaration, like I</span>
    <span># did above. As a convention, stick in some extra whitespace to distinguish</span>
    <span># between actual function parameters and local variables. In this example,</span>
    <span># a, b, and c are actual parameters, while d is merely a local variable.</span>

    <span># Now, to demonstrate the arithmetic functions</span>

    <span># Most AWK implementations have some standard trig functions</span>
    <span>localvar</span> <span>=</span> <span>sin</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>cos</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>atan2</span><span>(</span><span>b</span><span>,</span> <span>a</span><span>);</span> <span># arc tangent of b / a</span>

    <span># And logarithmic stuff</span>
    <span>localvar</span> <span>=</span> <span>exp</span><span>(</span><span>a</span><span>);</span>
    <span>localvar</span> <span>=</span> <span>log</span><span>(</span><span>a</span><span>);</span>

    <span># Square root</span>
    <span>localvar</span> <span>=</span> <span>sqrt</span><span>(</span><span>a</span><span>);</span>

    <span># Truncate floating point to integer</span>
    <span>localvar</span> <span>=</span> <span>int</span><span>(</span><span>5.34</span><span>);</span> <span># localvar =&gt; 5</span>

    <span># Random numbers</span>
    <span>srand</span><span>();</span> <span># Supply a seed as an argument. By default, it uses the time of day</span>
    <span>localvar</span> <span>=</span> <span>rand</span><span>();</span> <span># Random number between 0 and 1.</span>

    <span># Here's how to return a value</span>
    <span>return</span> <span>localvar</span><span>;</span>
<span>}</span>

<span>function</span> <span>string_functions</span><span>(</span>    <span>localvar</span><span>,</span> <span>arr</span><span>)</span> <span>{</span>

    <span># AWK, being a string-processing language, has several string-related</span>
    <span># functions, many of which rely heavily on regular expressions.</span>

    <span># Search and replace, first instance (sub) or all instances (gsub)</span>
    <span># Both return number of matches replaced</span>
    <span>localvar</span> <span>=</span> <span>"fooooobar"</span><span>;</span>
    <span>sub</span><span>(</span><span>"fo+"</span><span>,</span> <span>"Meet me at the "</span><span>,</span> <span>localvar</span><span>);</span> <span># localvar =&gt; "Meet me at the bar"</span>
    <span>gsub</span><span>(</span><span>"e+"</span><span>,</span> <span>"."</span><span>,</span> <span>localvar</span><span>);</span> <span># localvar =&gt; "m..t m. at th. bar"</span>

    <span># Search for a string that matches a regular expression</span>
    <span># index() does the same thing, but doesn't allow a regular expression</span>
    <span>match</span><span>(</span><span>localvar</span><span>,</span> <span>"t"</span><span>);</span> <span># =&gt; 4, since the 't' is the fourth character</span>

    <span># Split on a delimiter</span>
    <span>n</span> <span>=</span> <span>split</span><span>(</span><span>"foo-bar-baz"</span><span>,</span> <span>arr</span><span>,</span> <span>"-"</span><span>);</span> <span># a[1] = "foo"; a[2] = "bar"; a[3] = "baz"; n = 3</span>

    <span># Other useful stuff</span>
    <span>sprintf</span><span>(</span><span>"%s %d %d %d"</span><span>,</span> <span>"Testing"</span><span>,</span> <span>1</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span> <span># =&gt; "Testing 1 2 3"</span>
    <span>substr</span><span>(</span><span>"foobar"</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span> <span># =&gt; "oob"</span>
    <span>substr</span><span>(</span><span>"foobar"</span><span>,</span> <span>4</span><span>);</span> <span># =&gt; "bar"</span>
    <span>length</span><span>(</span><span>"foo"</span><span>);</span> <span># =&gt; 3</span>
    <span>tolower</span><span>(</span><span>"FOO"</span><span>);</span> <span># =&gt; "foo"</span>
    <span>toupper</span><span>(</span><span>"foo"</span><span>);</span> <span># =&gt; "FOO"</span>
<span>}</span>

<span>function</span> <span>io_functions</span><span>(</span>    <span>localvar</span><span>)</span> <span>{</span>

    <span># You've already seen print</span>
    <span>print</span> <span>"Hello world"</span><span>;</span>

    <span># There's also printf</span>
    <span>printf</span><span>(</span><span>"%s %d %d %d\n"</span><span>,</span> <span>"Testing"</span><span>,</span> <span>1</span><span>,</span> <span>2</span><span>,</span> <span>3</span><span>);</span>

    <span># AWK doesn't have file handles, per se. It will automatically open a file</span>
    <span># handle for you when you use something that needs one. The string you used</span>
    <span># for this can be treated as a file handle, for purposes of I/O. This makes</span>
    <span># it feel sort of like shell scripting, but to get the same output, the string</span>
    <span># must match exactly, so use a variable:</span>

    <span>outfile</span> <span>=</span> <span>"/tmp/foobar.txt"</span><span>;</span>

    <span>print</span> <span>"foobar"</span> <span>&gt;</span> <span>outfile</span><span>;</span>

    <span># Now the string outfile is a file handle. You can close it:</span>
    <span>close</span><span>(</span><span>outfile</span><span>);</span>

    <span># Here's how you run something in the shell</span>
    <span>system</span><span>(</span><span>"echo foobar"</span><span>);</span> <span># =&gt; prints foobar</span>

    <span># Reads a line from standard input and stores in localvar</span>
    <span>getline</span> <span>localvar</span><span>;</span>

    <span># Reads a line from a pipe (again, use a string so you close it properly)</span>
    <span>cmd</span> <span>=</span> <span>"echo foobar"</span><span>;</span>
    <span>cmd</span> <span>|</span> <span>getline</span> <span>localvar</span><span>;</span> <span># localvar =&gt; "foobar"</span>
    <span>close</span><span>(</span><span>cmd</span><span>);</span>

    <span># Reads a line from a file and stores in localvar</span>
    <span>infile</span> <span>=</span> <span>"/tmp/foobar.txt"</span><span>;</span>
    <span>getline</span> <span>localvar</span> <span>&lt;</span> <span>infile</span><span>;</span> 
    <span>close</span><span>(</span><span>infile</span><span>);</span>
<span>}</span>

<span># As I said at the beginning, AWK programs consist of a collection of patterns</span>
<span># and actions. You've already seen the BEGIN pattern. Other</span>
<span># patterns are used only if you're processing lines from files or standard</span>
<span># input.</span>
<span>#</span>
<span># When you pass arguments to AWK, they are treated as file names to process.</span>
<span># It will process them all, in order. Think of it like an implicit for loop,</span>
<span># iterating over the lines in these files. these patterns and actions are like</span>
<span># switch statements inside the loop. </span>

<span>/^fo+bar$/</span> <span>{</span>

    <span># This action will execute for every line that matches the regular</span>
    <span># expression, /^fo+bar$/, and will be skipped for any line that fails to</span>
    <span># match it. Let's just print the line:</span>

    <span>print</span><span>;</span>

    <span># Whoa, no argument! That's because print has a default argument: $0.</span>
    <span># $0 is the name of the current line being processed. It is created</span>
    <span># automatically for you.</span>

    <span># You can probably guess there are other $ variables. Every line is</span>
    <span># implicitly split before every action is called, much like the shell</span>
    <span># does. And, like the shell, each field can be access with a dollar sign</span>

    <span># This will print the second and fourth fields in the line</span>
    <span>print</span> <span>$</span><span>2</span><span>,</span> <span>$</span><span>4</span><span>;</span>

    <span># AWK automatically defines many other variables to help you inspect and</span>
    <span># process each line. The most important one is NF</span>

    <span># Prints the number of fields on this line</span>
    <span>print</span> <span>NF</span><span>;</span>

    <span># Print the last field on this line</span>
    <span>print</span> <span>$</span><span>NF</span><span>;</span>
<span>}</span>

<span># Every pattern is actually a true/false test. The regular expression in the</span>
<span># last pattern is also a true/false test, but part of it was hidden. If you</span>
<span># don't give it a string to test, it will assume $0, the line that it's</span>
<span># currently processing. Thus, the complete version of it is this:</span>

<span>$</span><span>0</span> <span>~</span> <span>/^fo+bar$/</span> <span>{</span>
    <span>print</span> <span>"Equivalent to the last pattern"</span><span>;</span>
<span>}</span>

<span>a</span> <span>&gt;</span> <span>0</span> <span>{</span>
    <span># This will execute once for each line, as long as a is positive</span>
<span>}</span>

<span># You get the idea. Processing text files, reading in a line at a time, and</span>
<span># doing something with it, particularly splitting on a delimiter, is so common</span>
<span># in UNIX that AWK is a scripting language that does all of it for you, without</span>
<span># you needing to ask. All you have to do is write the patterns and actions</span>
<span># based on what you expect of the input, and what you want to do with it.</span>

<span># Here's a quick example of a simple script, the sort of thing AWK is perfect</span>
<span># for. It will read a name from standard input and then will print the average</span>
<span># age of everyone with that first name. Let's say you supply as an argument the</span>
<span># name of a this data file:</span>
<span>#</span>
<span># Bob Jones 32</span>
<span># Jane Doe 22</span>
<span># Steve Stevens 83</span>
<span># Bob Smith 29</span>
<span># Bob Barker 72</span>
<span>#</span>
<span># Here's the script:</span>

<span>BEGIN</span> <span>{</span>

    <span># First, ask the user for the name</span>
    <span>print</span> <span>"What name would you like the average age for?"</span><span>;</span>

    <span># Get a line from standard input, not from files on the command line</span>
    <span>getline</span> <span>name</span> <span>&lt;</span> <span>"/dev/stdin"</span><span>;</span>
<span>}</span>

<span># Now, match every line whose first field is the given name</span>
<span>$</span><span>1</span> <span>==</span> <span>name</span> <span>{</span>

    <span># Inside here, we have access to a number of useful variables, already</span>
    <span># pre-loaded for us:</span>
    <span># $0 is the entire line</span>
    <span># $3 is the third field, the age, which is what we're interested in here</span>
    <span># NF is the number of fields, which should be 3</span>
    <span># NR is the number of records (lines) seen so far</span>
    <span># FILENAME is the name of the file being processed</span>
    <span># FS is the field separator being used, which is " " here</span>
    <span># ...etc. There are plenty more, documented in the man page.</span>

    <span># Keep track of a running total and how many lines matched</span>
    <span>sum</span> <span>+=</span> <span>$</span><span>3</span><span>;</span>
    <span>nlines</span><span>++</span><span>;</span>
<span>}</span>

<span># Another special pattern is called END. It will run after processing all the</span>
<span># text files. Unlike BEGIN, it will only run if you've given it input to</span>
<span># process. It will run after all the files have been read and processed</span>
<span># according to the rules and actions you've provided. The purpose of it is</span>
<span># usually to output some kind of final report, or do something with the</span>
<span># aggregate of the data you've accumulated over the course of the script.</span>

<span>END</span> <span>{</span>
    <span>if</span> <span>(</span><span>nlines</span><span>)</span>
        <span>print</span> <span>"The average age for "</span> <span>name</span> <span>" is "</span> <span>sum</span> <span>/</span> <span>nlines</span><span>;</span>
<span>}</span>
</pre><p><span>&nbsp;</span></p></div>]]></description>
	<dc:creator>BioJoker</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22512/srf-post-in-nehu-shillong</guid>
  <pubDate>Wed, 03 Jun 2015 13:15:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF post in NEHU, Shillong]]></title>
  <description><![CDATA[
<p>Dept of Biochemistry <br />North-Eastern Hill University<br />(A University with Potential for Excellence) <br />Umshing, Shillong- 793 022</p>

<p>Applications are invited for the post of Senior Research Fellow- SRF (1) and Junior Research Fellow- JRF (1) to be appointed in a SERB-funded major research project entitled “Biochemical and functional properties of Synechocystis Glutathione S-transferase(s)” sanctioned to Dr. Timir Tripathi, Molecular and Structural Biophysics Laboratory, Department of Biochemistry, NEHU, Shillong. </p>

<p>Essential Qualifications: For both positions M.Sc. or equivalent with a good academic record is a prerequisite. </p>

<p>For Project-SRF, experience in bioinformatics/computational biology is required, which should be evident by atleast one good publication. </p>

<p>For JRF position, freshers can also apply. </p>

<p>Stipend: As per SERB norms. </p>

<p>Interested students can email their detailed bio-data including mobile number and recent photograph to msb.biochem@gmail.com, latest by 20.06.15. The hard copy is not required. The date of interview will be informed after primary scrutiny of the applications. No TA/DA will be paid if called for interview. For details of the research work of the PI’s group kindly visit www.ttripathi.webs.com</p>

<p>Advertisement: http://www.nehu.ac.in/Advertisements/BiochemSERB_Advt_020615.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:37:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22569/reverse-complement-problem-solved-with-perl</link>
	<title><![CDATA[Reverse Complement Problem Solved with Perl]]></title>
	<description><![CDATA[<p>Question at http://rosalind.info/problems/1b/</p><p>#Find the reverse complement of a DNA string.<br />#Given: A DNA string Pattern.<br />#Return: Pattern, the reverse complement of Pattern.<br /><br />use strict;<br />use warnings;<br /><br />my $string="AAAACCCGGT";<br />my $finalString="";<br />my %hash = (<br />&nbsp;&nbsp; &nbsp;"C" =&gt; "G", <br />&nbsp;&nbsp; &nbsp;"A" =&gt; "T", <br />&nbsp;&nbsp; &nbsp;"T" =&gt; "A", <br />&nbsp;&nbsp; &nbsp;"G" =&gt; "C",<br />);<br /><br />for (my $aa=0; $aa&lt;=(length($string)-1); $aa++) {<br />&nbsp;&nbsp; &nbsp;my $char=substr $string, $aa, 1;<br />&nbsp;&nbsp; &nbsp;#print $hash{$char};<br />&nbsp;&nbsp; &nbsp;$finalString="$hash{$char}"."$finalString";<br />}<br /><br />print $finalString;<br />print "\n";</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22580/appointment-of-two-traineeships-and-two-studentships-in-bioinformatics</guid>
  <pubDate>Wed, 10 Jun 2015 10:19:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Appointment of two traineeships and two studentships in Bioinformatics]]></title>
  <description><![CDATA[
<p>Jawaharlal Nehru<br />TROPICAL BOTANIC GARDEN AND RESEARCH INSTITUTE<br />An organization under the Kerala State Council for Science, Technology and Environment and<br />National Centre of Excellence, Government of India<br /> <br />Applications are invited for the appointment of two traineeships and two studentships in Bioinformatics for a period of six months sponsored by Department of Biotechnology, Government of India in the Bioinformatics Sub-DIC, Saraswathy Thangavelu Centre, JNTBGRI, Puthenthope, Thiruvananthapuram 695 586. The required qualifications and other details are given below.</p>

<p>Monthly fellowship (in rupee): 5,000/-<br />	<br />Traineeship<br />	<br />First Class M.Sc Bioinformatics/ Biotechnology/ Botany<br />	<br />Studentship: 5,000/-<br />	<br />M.Phil/M.Tech Bioinformatics/ Biotechnology/ any branch of Life Science students for doing their thesis work in the area of Bioinformatics.</p>

<p>Age limit as on 1.1.2015, 28 years. Age relaxation will be provided for SC, ST, OBC candidates as per Govt. norms.</p>

<p>Interested candidates may appear for walk-in-interview on 16th June 2015 at 10.30 am at JNTBGRI, Palode, Thiruvananthapuram. The candidate should report to the Office at Palode before 10.00 am</p>

<p>More at http://www.jntbgri.in/jntbgri/news/File0001.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22778/sr-research-fellow-technical-asst-at-indian-institute-of-maize-research-india</guid>
  <pubDate>Wed, 17 Jun 2015 18:47:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Sr Research Fellow &amp; Technical Asst at Indian Institute of Maize Research - India]]></title>
  <description><![CDATA[
<p>Indian Institute of Maize Research Jobs 2015 –</p>

<p>Sr Research Fellow &amp; Technical Asst Posts: Indian Institute of Maize Research (IIMR), New Delhi has advertised a notification for the recruitment of Senior Research Fellow &amp; Technical Assistant vacancies for the project titled “Genetic modifications to improve biological nitrogen fixation for augmenting nitrogen needs of cereals” on contractual basis. Eligible candidates may apply in prescribed application format on or before 25-06-2015. Other details like age, educational qualification, selection process, how to apply are given below…</p>

<p>Indian Institute of Maize Research Vacancy Details:<br />Total No. of Posts: 03<br />Name of the Posts :<br />1. Senior Research Fellow: 02 Posts<br />2. Technical Assistant: 01 Post</p>

<p>Age Limit: Candidates age should be 35 years for Senior Research Fellow, Minimum 21 years and maximum 45 years for Technical Assistant as on the closing date of the application. Age relaxation is 5 years to SC/ST and women candidates and 3 years to OBC candidates as per ICAR rules.</p>

<p>Educational Qualification: Candidates should possess Post graduate degree in Biotechnology/ Molecular Biology/ Bioinformatics/ Plant physiology for Senior Research fellow, Graduate degree in Agriculture/ Biotechnology/ any discipline of life sciences for Technical Assistant with relevant experience.</p>

<p>Selection Process: Candidates will be selected based on their performance in interview.</p>

<p>How to Apply: Eligible candidates can send their application in prescribed format along with bio-data to Dr. Pranjal Yadava, Principal Investigator, ICAR Indian Institute of Maize Research, Pusa Campus, New Delhi-110012 or mail to pranjal.yadava@gmail.com on or before 25-06-2015 &amp; attend the interview along with application in the attached format at the time of interview, one passport size photograph, self attested copies of certificates for age, and qualifications, reprints of publications and ‘No Objection Certificate’, original documents on 01-07-2015. Venue details are mentioned below.</p>

<p>Important Dates:<br />Last Date for Receipt of Application: 25-06-2015<br />Date &amp; Time of Interview : 01-07-2015.<br />Venue: IIMR, Pusa Campus, New Delhi</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22787/senior-technical-assistant-at-pondicherry-university</guid>
  <pubDate>Wed, 17 Jun 2015 20:46:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Technical Assistant at Pondicherry University]]></title>
  <description><![CDATA[
<p>Senior Technical Assistant</p>

<p>Eligibility : BE/B.Tech(CSE, ECE, IT)</p>

<p>Location : Pondicherry</p>

<p>Last Date : 26 Jun 2015</p>

<p>Hiring Process : Face to Face Interview<br />Pondicherry University - Job DetailsDate of posting:19 May 15</p>

<p>Senior Technical Assistant Job position in Pondicherry University on temporary basis  </p>

<p>Project Title : "Bioinformatics National Certification (BINC) for certifying quality human resource in Bioinformatics"</p>

<p>Qualification : i) B.E/ B.Tech Computer Science/ Electronics &amp; Communication Engineering/ Information Technology with 55% or equivalent marks. ii) One year Experience in relevant field in Government/ Public Sector or reputed Private Organizations. Desirable : Working experience in JSP and ASP/PHP</p>

<p>No. of Post : 01</p>

<p>Department : Biotechnology</p>

<p>Pay : Rs. 27,800/- </p>

<p>Age Limit : 30 Yrs<br />How to apply</p>

<p>Both above-mentioned posts are purely on temporary basis, extended by one year based on performance and will be terminated with the completion of BINC Program at Pondicherry University. Interested Candidates may send their application in the prescribed format with self-attested copies of all mark sheets and certificates to Dr. Basant K. Tiwary, Coordinator (BINC), Centre for Bioinformatics, Pondicherry University, Puducherry-605 014 before June 26, 2015.</p>

<p>Click Here http://www.pondiuni.edu.in/news/requirement-post-one-senior-technical-assistant-one-computer-assistant-–-dept-biotechnologygove</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/22920/how-long-have-you-been-a-bioinformatics-scientist-for</guid>
	<pubDate>Tue, 23 Jun 2015 10:55:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/22920/how-long-have-you-been-a-bioinformatics-scientist-for</link>
	<title><![CDATA[How long have you been a bioinformatics scientist for?]]></title>
	<description><![CDATA[<p>Most of the researcher have been a scientist whole life, but infact they actually started paying&nbsp; it with at certain time.So, how long have you been in bioinformatics domain now?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22966/ra-bioinformatics-at-icged</guid>
  <pubDate>Sun, 28 Jun 2015 12:24:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at ICGED]]></title>
  <description><![CDATA[
<p>Research Associate Position at ICGEB, New Delhi with Dr. Amit Sharma</p>

<p>Starting 15th July 2015, the position relates to a project specifically for in silico drug docking, screening, design, optimisation and linkage with active chemists. </p>

<p>Experience in many docking softwares and operating systems is essential. </p>

<p>Additional experience in bioinformatics and computational biology tools will be useful. </p>

<p>Submit curriculum vitae to: sb.icgeb@gmail.com</p>

<p>Closing date: 5 July 2015</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24042/research-associate-bioinformatician-university-of-bristol</guid>
  <pubDate>Wed, 26 Aug 2015 05:46:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatician @ University of Bristol]]></title>
  <description><![CDATA[
<p>This 0.5 fte role will have specific responsibility for the bioinformatic side of a Health Innovation Challenged Fund (HICF) research project investigating the application of Next Generation Sequencing (NGS) technologies to the analysis of Minimal Residual Disease (MRD) in childhood Acute Lymphoblastic Leukaemia (ALL). The successful candidate will be responsible for designing and implementing an analysis pipeline primarily to fit with the clinical need, but with the capacity to answer innovative research questions.</p>

<p>For informal enquiries please contact Anne Walsh via email: anne.walsh@bristol.ac.uk.</p>

<p>Apply at http://www.bris.ac.uk/jobs/find/details.html?nPostingID=3639&amp;nPostingTargetID=13346&amp;option=28&amp;sort=DESC&amp;respnr=1&amp;ID=Q50FK026203F3VBQBV7V77V83&amp;JobNum=ACAD101624&amp;Resultsperpage=10&amp;lg=UK&amp;mask=uobext</p>
]]></description>
</item>

</channel>
</rss>