<?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/26414?offset=640</link>
	<atom:link href="https://bioinformaticsonline.com/related/26414?offset=640" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43022/a-simple-tutorial-for-a-complex-complexheatmap</guid>
	<pubDate>Fri, 02 Apr 2021 06:18:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43022/a-simple-tutorial-for-a-complex-complexheatmap</link>
	<title><![CDATA[A simple tutorial for a complex ComplexHeatmap]]></title>
	<description><![CDATA[<p><em>ComplexHeatmap</em>&nbsp;(Gu, Eils, and Schlesner (2016)) is an R Programming Language (R Core Team (2020)) package that is currently listed in the&nbsp;<a href="https://bioconductor.org/">Bioconductor</a>&nbsp;package repository.</p>
<p><a href="https://github.com/kevinblighe/E-MTAB-6141#2-install-and-load-required-packages">install and load required packages</a></p>
<div>
<pre>  require(<span>RColorBrewer</span>)
  require(<span>ComplexHeatmap</span>)
  require(<span>circlize</span>)
  require(<span>digest</span>)
  require(<span>cluster</span>)</pre>
</div>
<p>If all load successfully, proceed to&nbsp;<span>Part 3</span>. Otherwise, go through the following code chunks in order to ensure that each package is installed and loaded properly.</p>
<p><em>BiocManager</em>&nbsp;(Morgan (2019))</p><p>Address of the bookmark: <a href="https://github.com/kevinblighe/E-MTAB-6141" rel="nofollow">https://github.com/kevinblighe/E-MTAB-6141</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22436/ra-bioinformatics-at-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Thu, 28 May 2015 19:25:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES]]></title>
  <description><![CDATA[
<p>NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES</p>

<p>Near Basant Vihar G.T. Road Bypass P.O. Box No.129</p>

<p>Karnal - 132001 (Haryana)</p>

<p>WALK-IN-INTERVIEW</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 10.06.2015 to select One Research Associate as per details given below:</p>

<p>1. One post of Research Associate under National Fellow project entitled “Genome data mining to unravel molecular basis of thermotolerance and adaptation to diverse environments in native cattle and buffaloes”.</p>

<p>The post duration is Upto 22.05.2016 or earlier &amp; Co-terminus with the project.</p>

<p>Essential Qualifications: Master’s degree (M.Sc. / M.V.Sc.) in Biotechnology/ Animal Genetics and Breeding/ Life Sciences/ Bioinformatics with 2 Years research experience in relevant subject or Ph.D in any of the above subjects.</p>

<p>Desirable: Working Experience in molecular biology, gene expression/ microarray data analysis, SNP genotyping and sequence data analysis, mammalian cell-culture handling etc.</p>

<p>Emolument: Rs. 23,000/- per month + HRA as per admissibility</p>

<p>Research Associate: ONE</p>

<p>Duration of engagement: Upto 22.05.2016 or earlier Co-terminus with the project</p>

<p>Age Limit:  40 years for Men  45 years for women as on date of interview</p>

<p>Note: Relaxation in age will be admissible for SC/ST &amp; OBC candidates as per Govt. of India /ICAR norms</p>

<p>1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs. 2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises. 3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are coterminus with the project. No TA/DA will be paid to attend the interview. 5. Any other clarifications can be had on the date of interview. 6. The Director’s decision will be final and binding on all respects.</p>

<p>Advertisement: http://210.212.93.85/RAadvertisiment.pdf</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/22615/jrf-position-%E2%80%93-bioinformatics-department-aravind-medical-research-foundation-amrf-madurai</guid>
  <pubDate>Fri, 12 Jun 2015 05:42:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Position – Bioinformatics Department, Aravind Medical Research Foundation (AMRF), Madurai.]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the post of Junior Research Fellow (JRF) to work at the Department of Bioinformatics, Aravind Medical Research Foundation in the following DST-SERB funded project “Clinical exome analysis pipeline for eye disease next-generation sequencing panel”.</p>

<p>Post: Junior Research Fellow (1 Position)</p>

<p>Duration: Three years</p>

<p>Qualification: First class in M.Sc/M.tech in Bioinformatics/Life Sciences/Biophysics/ Biostatistics/Bioengineering. Experience in Database development, NGS data analysis, Systems Biology and Structural Bioinformatics is desired. Preference will be given to the candidates with good computer programming skills in C, C++, R, Perl, PHP, Unix Scripting etc.</p>

<p>Selected candidates will be paid fellowship as per existing DST norms.</p>

<p>How to apply:</p>

<p>Candidates are requested to apply through one of the two modes given below<br />1. Online application – Click here to submit the online application https://docs.google.com/forms/d/16h2GLnQ-Ny-tLtlgfY3Bx3sCjeHJE30cfhJaDqW_uRs/viewform?c=0&amp;w=1<br />2. Application forms can be downloaded from here.https://docs.google.com/file/d/0BwwJEudQStxFWXdNWXl4NWtDaWc/edit<br /> Filled in application form should be sent by post to Dr. D. Bharanidharan, Department of Bioinformatics, Aravind Medical Research Foundation No 1, Anna Nagar Madurai – 625 020,</p>

<p>Candidates should apply by online or submit their applications by post on or before 15th June, 2015. Only Short listed candidates will be called for an interview. No TA/DA will be paid.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22769/ensembl-27</guid>
	<pubDate>Tue, 16 Jun 2015 16:10:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22769/ensembl-27</link>
	<title><![CDATA[Ensembl 27]]></title>
	<description><![CDATA[<h3>What is new?</h3><ul>
<li>Expansion of Protists and Fungi with hundreds of annotated genomes</li>
<li>Variation data for bread wheat, rice, <em>Aedes aegypti</em>, and <em>Ixodes scapularis</em></li>
<li>Whole genome alignments for <em>O. longistaminata</em> and <em>T. cacao</em></li>
<li>Non-coding RNA gene models in <a href="http://bacteria.ensembl.org">Bacteria</a></li>
<li>New assembly of tomato (version 2.50)</li>
<li>Full support for UCSC Track Hub format for hosting your own data in Ensembl</li>
</ul><p>More at http://www.ensembl.info/blog/2015/06/16/ensembl-genomes-release-27-is-out/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22780/ra-bioinformatics-at-institution-centre-for-human-genetics-bangalore</guid>
  <pubDate>Wed, 17 Jun 2015 19:14:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Institution: Centre for Human Genetics,  Bangalore]]></title>
  <description><![CDATA[
<p>Institution: Centre for Human Genetics, <br />Bangalore <br />Discipline: Molecular Genetics of Human Disease Biology </p>

<p>Minimum qualification: MSc in any branch of life sciences</p>

<p>Applications are invited for the position of a Research Assistant in the Centre for Human Genetics, Bangalore. </p>

<p>The project involves identification of mutations in MPS (mucopolysaccharidosis) patients, and study of their predicted effects to understand how the mutations lead to disease. </p>

<p>Techniques used will be genomic DNA isolation, PCR, DNA sequencing and sequence analysis. Computational tools would also be used to analyse and interpret data. </p>

<p>Candidates may be assigned work in the ongoing project or in new ones. </p>

<p>The candidate who is selected and joins would acquire hands-on experience in research and the capability to conduct insightful research. </p>

<p>Candidates applying for the position should have an MSc in any branch of life sciences. Those with research experience in cell and molecular biology, and high NET/ GATE score would be preferred. </p>

<p>The successful applicant is expected to stay for at least one and a half years. </p>

<p>Please apply with CV to Sudha Srinivasan (sudha@ibab.ac.in), stating where you saw this ad.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/22995/bioinformatics-phd-postdoc-job-rejection</guid>
	<pubDate>Thu, 02 Jul 2015 08:52:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/22995/bioinformatics-phd-postdoc-job-rejection</link>
	<title><![CDATA[Bioinformatics PhD / PostDoc / Job Rejection]]></title>
	<description><![CDATA[<div><p>While your PhD or PostDoc application, it is more common that you got rejected by many professors. Don't disappoint reply it calmly.</p><p><img src="http://bioinformaticsonline.com/mod/photo/rejected1.png" alt="image" style="border: 0px; border: 0px;"></p><p>In grad school, I shared a house with three Bioinformatics PhD students. One, when he applied to a particular professor, received a letter that said, essentially, "If you are applying because you want to enrich yourself, great. If you are applying because you want a job, you should know that you won't get one." I am trying to tell you this is because if you, with a good background in Bioinformatics, are passing up opportunities, you must be a strong candidate in many areas. Enrich yourself.<br /><br /> So, my suggestion is take a deep breath, forgot about all. Don&rsquo;t take it personally. It's been usual processes while hunting for a good lab and professor. Take is positive, I am not sure why they reject, but don't worry perhaps the lab don't deserve you. Always remember there are billions of reasons not to hire someone for projects, especially in a research sector.<br /><br /> My suggestion, please do not whine about how you were a great research candidate for the post, and you just can't understand why they were so stupid as to have rejected you! This feeling will not win you any points in research, community. Especially, when in todays socially connected era everyone is linked. Remember, a nice E-mail saying, "I really wished to working with you on this project and I hope we cross paths again," is all you need to send to the professor. Send a thank you note to the professor. Thank them for the time they spend to judge you. In the future, If you and the professor (of your dream) are attending a bioinformatics conference, invite him/her to lunch (please remember to pay the bill). In today evolving scientific ere, always remember to build your solid network in order to get a job of interest. Join all possible networking sites like LinkedIn, ResearchGate, Acamedia, FB for the same reason. You as a researcher always build a bridge with student/researcher/colleague/professor who have the research potential to lead in research and hire you. Just because you didn't get this project, doesn't mean there isn't another that will open up in couple of month.<br /><br /> Mostly, jobs that are hard to get are hard to get. Only you can decide if the continued sacrifices are worth the expected payout. If it is, keep on plowing. Build relationships. Attend conferences.</p><p>Image ref @ JaSonYa</p></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/23209/bisr-jaipur</guid>
  <pubDate>Tue, 07 Jul 2015 23:12:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[BISR Jaipur]]></title>
  <description><![CDATA[
<p>The Bioinformatics Centre at BISR has created an infrastructure for providing facilities to the users working in the field of Biological Sciences. The users of Rajasthan, Jaipur in particular, are using facilities available at the Bioinformatics Centre extensively. The centre has leased line Internet connection as well latest Bioinformatics software for sequence and structure analysis. The centre provides the following services:</p>

<p>    Bioinformatics supports to researchers<br />    Customized training in Bioinformatics for researchers and faculty members<br />    Support in Installing, implementing and maintaining software on computer.<br />    Create awareness for taking preventive measure against data security<br />    Organize workshops on thrust ares of Bioinformatics<br />    Research Training to students of Biotechnology and Bioinformatics </p>

<p>More at http://bioinfo.bisr.res.in/index.php</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23278/research-associate-project-fellow-biological-sciences-at-igib</guid>
  <pubDate>Sun, 12 Jul 2015 07:57:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate, Project Fellow (Biological Sciences) at IGIB]]></title>
  <description><![CDATA[
<p>Research Associate, Project Fellow (Biological Sciences)<br />Institute of Genomics &amp; Integrative Biology (IGIB) - New Delhi, Delhi<br />Pay Scale: Rs. 22,000/- + 30 % HRA per month<br />Educational Requirements: PhD in any branch of Biological Sciences with specialization in Bioinformatics with at least one research paper in Science Citation Indexed (SCI) journal<br />Desired Skills: Knowledge of molecular dynamics simulations<br />Details will be available at: http://www.igib.res.in/sites/default/files/24July2015.pdf</p>

<p>Project Fellow (Biological Sciences) Pay Scale: Rs. 16,000/- + 30 % HRA per month<br />Educational Requirements: M.Sc./B.Tech in life sciences/Biological sciences with at least 55 % marks<br />Experience Requirements: Research experience.<br />Details will be available at: http://www.igib.res.in/sites/default/files/24July2015.pdf</p>

<p>No of Post: 01<br />How To Apply: 1. Please fill up the proforma by clicking on the following link HR Online Form. 2. Candidate cannot apply for more than two posts. Last date of receiving application is 12-07-2015. No application would be entertained with “result awaited” status or after due date. List of shortlisted candidates will be put up on CSIR-IGIB website. 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. Note: The shortlisted candidates, have to report at 09:00 AM at Mall Road Campus, Delhi – 110007 on the day of interview along with any Photo ID card, (without photo ID card interview will not be conducted). 3 copies of updated signed C. V. (clearly mentioning Date of Birth and Highest Qualification with percentage), Dissertation (if any), PhD thesis (if any) and original certificates/Self attested photocopies for verification.<br />Detail of Interview: 24 July, 2015 at 10:30 AM<br />Age Limit: 28 Years</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23378/ra-bioinformatics-at-bharathidasan-university</guid>
  <pubDate>Fri, 17 Jul 2015 19:40:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Bharathidasan University]]></title>
  <description><![CDATA[
<p>Applications are invited from individuals who have high motivation to do research for the DBT sponsored project o n “Establishment of National Repository for Microalgae &amp; Cyanobacteria” funded by Department of Biotechnology, Govt. of India under the supervision of Dr. N. Thajuddin, Principal Investigator, Department of Microbiology, Bharathidasan University, Tiruchirappalli- 620 024.</p>

<p>1. Research Associate – 1 No.</p>

<p>Rs. 36,000/38,000/40,000 per month for I, II and III year + 20% HRA</p>

<p>Essential : Doctoral degree in relevant subject from recognized University/ Institutes</p>

<p>Desirable: Research experience in molecular biology and bioinformatics.</p>

<p>Interested candidates can send their complete CV in plain paper with a passport size photograph, with details of marks secured in all subjects from plus two stage (with proof, full postal address, sex, date of birth, community etc., along with additional qualification or experiences and two address of references whom could be contacted.</p>

<p>DEPARTMENT OF MICROBIOLOGY SCHOOL OF LIFE SCIENCES UNIVERSITY Dr. N. THAJUDDIN Professor &amp; Head Dean, Faculty of Science, Technology &amp; Engineering Tiruchirappalli – 620 024, India, Phone: +91 431 2407082; Mobile +91 098423 79719; E-mail: nthaju2002@yahoo.com</p>

<p>Application should reach the Principal Investigator on or before 5.8.2015 by Speed post/Couriers/Email (nthaju2002@yahoo.com), with subject printed as “Application for Research Associate /Technical Assistant /Lab attendant” in the envelop. Qualifying candidates will be short listed and communicated with date of interview. No TA and DA will be given for attending the interview. Address for Communication Dr.N.Thajuddin Principal Investigator Department of Microbiology Bharathidasan University Tiruchirappalli – 620 024, Tamil Nadu.</p>

<p>Advertisement: www.bdu.ac.in/adv/microbiology_advt.pdf</p>
]]></description>
</item>

</channel>
</rss>