No.: SPU/CISST/Advt./2014-15/519

ADVERTISEMENT for Teaching Positions (Contractual)

Applications for the following Contractual Teaching Position are invited for Centre for Interdisciplinary Studies in Science and Technology (CISST), Sardar Patel University:

2. Assistant Professor (ONE) (Contractual)

For the subject of Bioinformatics

Qualifications:

(I) Good academic record as defined by the concerned university with at least 55 % marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master’s level

(II) Ph.D. degree in the concerned subject or in a relevant interdisciplinary subject
from an Indian University or NET/SLET clearance Contractual appointment carries a total Fixed Emoluments of Rs. 30,000/- p.m without any assurance of permanent Positions and related benefits.

An Application Form in prescribed Performa, available on University Website: www.spuvvn.edu should be filled in completely in Twelve Copies with self attested copies of certificates of qualifications and experience. Only one copy of each mark sheet be attached with the first copy of the application form. All 12 (Twelve) Application forms should be sent to Registrar’s office along with Demand Draft of Application form fee of Rs. 250/- (Non-refundable) in favour of “REGISTRAR, SARDAR PATEL UNIVERSITY, VALLABH VIDYANAGAR”. The S.C. and S.T. category candidates need not to pay Application fee.

Applicants who are in service should apply through their present employers. Candidates called for interview shall be required to attend at their own cost.

In absence of suitable candidate, the University may relax the eligibility criteria, for conditional appointment.

The last date of receipt of application by the University is 30th April, 2014

Advertisement: www.spuvvn.edu/careers/CISST%20Advt.%20April%202014.pdf

Postdoc position (m/w/d)

in the field of computational evolutionary microbiology is available
for an initially limited period of 36 months at the earliest possible
date. The weekly working time corresponds to 100% of full employment
(If the legal requirements under collective bargaining law are met, the
tariff grouping is carried out up to pay scale 13 TV-L. The obligation
to teach amounts to 4 hours.

The Genomic Microbiology Group research interests are focused on
microbial genome evolution with an emphasis on the study of lateral gene
transfer. In our research we use both computational and experimental
approaches (see www.uni-kiel.de/genomik). The position offers the
opportunity to develop an independent research profile within the group
research focus. The successful applicant is expected to be involved
in teaching of bioinformatics and molecular evolution, including the
development of teaching materials (lectures/exercises/short videos).

Your profile:
· Doctoral or PhD degree in Molecular Evolution, Bioinformatics or
related fields.
· Knowledge and experience in programming (e.g., Python) and
biostatistical analysis (e.g., with R or MatLab).
· Any of the following expertise is an advantage: the analysis of
genomic or transcriptomic data, phylogenetic reconstruction,
comparative genomics.
· Good oral and written communication skills in English.
· Ability to teach in German is an advantage (alternatively, an
indication to do so from the 2nd year on).
· Skills and motivation to communicate and interact with other
scientists.

The Christian-Albrechts-University sees itself as a modern and
cosmopolitan employer. We welcome your application regardless of your age,
gender, cultural and social background, religion, ideology, disability
or sexual identity. We promote equality of the sexes.

The Christian-Albrechts-University is committed to the employment of
people with disabilities. Preference will be given to applications from
severely handicapped persons and persons of equal standing, provided
they are suitable.

We expressly welcome applications from people with a migration background.

For enquiries regarding the position, teaching obligations and research
topic please contact Prof. Tal Dagan: tdagan@ifam.uni-kiel.de.

Applications should be submitted by email to Mrs. Haacks
(dhaacks@ifam.uni-kiel.de) as a single PDF and include: (1) a letter of
motivation (max 1 page, Arial 11, line spacing 1.15), (2) CV, (3) PhD
certificate. Please use 'GMG postdoc application - [your name]'
as a subject.

Please, refrain from sending us application photos.

Application deadline: August 31 2021 or until the position is
filled. Interviews will take place during September/October 2021. The
planned starting date for the position is flexible (but in 2021).

Basic Galaxy Tutorial

• RNA-Seq tutorial based on Trapnell et al. (2012) Nature Protocols

In this tutorial we cover the concepts of RNA-Seq differential gene expression (DGE) analysis using a very small synthetic dataset from a well studied organism.

Advanced Galaxy Tutorial

• RNA-Seq (Advanced) Tutorial

In this tutorial we compare the performance of three statistically-based differential expression tools:

* CuffDiff

* EdgeR

* DESeq2

Advanced Command Line Tutorial

• Graphical Output with CummeRbund introduces some basic commands using the cummeRbund package of the R programming language

You will need to install R, RStudio and cummeRbund on your PC (explained in the Tutorial). You will learn how to produce graphical output from RNA-Seq analysis previously done using a Cuffdiff analysis.

Variant Detection

Basic Galaxy Tutorial

• Variant Detection tutorial

In this tutorial we cover the concepts of detecting small variants (SNVs and indels) in human genomic DNA using a small set of reads from chromosome 22.

Advanced Galaxy Tutorial

• Variant Detection (Advanced) Tutorial

In this tutorial we compare the performance of three statistically-based variant detection tools:

* SAMtools: Mpileup

* GATK: Unified Genotyper

* FreeBayes

Each of these tools takes as its input a BAM file of aligned reads and generates a list of likely variants in VCF format

Pipelines are for those who are comfortable with using the UNIX command line; and often allow more control over branching and iteration logic.

• WGS/exome GATK-based variant calling pipeline

This is a basic variant-calling and annotation pipeline developed at the Victorian Life Sciences Computation Initiative (VLSCI), University of Melbourne. It is based around BWA, GATK and ENSEMBL and was originally designed for human (or similar) data. The master branch is configured for WGS data; there is an exome branch configured for variant calling in exome data.

To run the pipeline you will need Rubra: https://github.com/bjpop/rubra. Rubra uses the python Ruffus library: http://www.ruffus.org.uk/.

Protocols

• Familial Variant Calling

In this protocol we discuss and outline the process of calling familial related mutations.

• Somatic Variant Calling

In this protocol we discuss and outline the process of identifying somatic variants or mutations.

Assembly

Basic Galaxy Tutorial

• Genome assembly tutorial

In this tutorial we carry out de novo assembly of a microbial genome. We have also written a De novo Genome Assembly for Illumina Data Protocol for a more generic description of the method.

Protocol

• De novo Genome Assembly for Illumina Data

In this protocol we discuss and outline the process of de novo assembly for small to medium sized genomes. Use our Genome assembly tutorial to learn a specific case of using Galaxy to carry out de novo assembly of a microbial genome.

Small RNAs

Basic Galaxy Tutorial

• Quality control for small RNA

This tutorial covers initial steps of the workflow for analysis of short RNA expression such as a quality control of the raw reads, processing of the raw reads for the subsequent analysis and initial quality assessment of the library.

ChIP Seq

Protocol

• ChIP-Seq

In this protocol we discuss ChIP-Seq: a method to analyze the interaction between proteins and DNA.

Amplicons

Protocol

• Amplicon Alignment

In this protocol we discuss and outline the process of aligning custom amplicons using primers for high precision.

Learn Galaxy

Introduction to Galaxy, for those who are very new to Galaxy.

Using Histories and Workflows, for those with some Galaxy knowledge.

The Galaxy project website has many tutorials and screencasts about using Galaxy and the tools, and developing new tools.

Address of the bookmark: https://genome.edu.au/wiki/Learn

1. NCBI (National Center for Biotechnology Information):

   • NCBI provides various databases related to genetic information, including 16S rRNA sequences.
   • You can access the 16S ribosomal RNA sequences from NCBI's Nucleotide database (https://www.ncbi.nlm.nih.gov/nucleotide/).
   • Perform a search using keywords like "16S rRNA" or specific bacterial names to find relevant sequences.
   • You can download sequences individually or in batches using the provided tools.

2. GreenGenes:

   • GreenGenes is a widely used 16S rRNA gene sequence database.
   • You can access it at http://greengenes.secondgenome.com/.
   • GreenGenes provides precompiled databases for various purposes, including classification, alignment, and phylogenetic analysis.

3. SILVA:

   • SILVA (https://www.arb-silva.de/) is another comprehensive database for ribosomal RNA (rRNA) sequences.
   • It covers not only 16S rRNA but also other ribosomal RNA sequences.
   • SILVA provides precompiled databases for various purposes, including taxonomic classification and alignment.

4. Ribosomal Database Project (RDP):

   • RDP (http://rdp.cme.msu.edu/) is a curated database that offers 16S rRNA sequences.
   • It provides tools for sequence analysis and classification.
   • You can download sequences and taxonomy information from their website.

5. QIIME (Quantitative Insights Into Microbial Ecology):

   • QIIME (https://qiime2.org/) is a widely used bioinformatics platform for microbiome analysis.
   • It provides tools for analyzing microbial communities, including processing 16S rRNA sequences.
   • QIIME often includes its own preprocessed 16S rRNA databases that can be used for analysis within the platform.

Before downloading any database, make sure to read the terms of use and citation requirements, as some databases may have specific usage policies. Additionally, consider the compatibility of the database with your analysis pipeline and software tools.

NCBI 16s RNA database location ftp://ftp.ncbi.nih.gov/blast/db/16SMicrobial.tar.gz

No of vacancies: 01

Pay scale:Rs. 15600 – 39100 + 6600/-

Essential Academic Qualifications / Experience : Good academic record as defined by the concerned university with at least 55% marks (or an equivalent grade in a point scale wherever grading system is followed) at the Master's Degree level in a relevant subject from an Indian University, or an equivalent degree from an accredited foreign university.

Besides fulfilling the above qualifications, the candidate must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/ SET.

Notwithstanding anything contained in sub-clauses (a) and (b) to this Clause, candidates, who are, or have been awarded a Ph.D. Degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations, 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities/Colleges/Institutions.

NET/SLET/SET shall also not be required for such Masters Programmes in disciplines for which NET/SLET/SET is not conducted.

Apply online: http://www.psc.cg.gov.in/htm/OA_ME2014.html

Last Date for Online Registration: 22/05/2014

For more details: http://www.psc.cg.gov.in/pdf/Advertisement/ADV_ME2014.pdf

Description
This free online-only RevBayes workshop will provide an introduction to the theory and use of RevBayes, with a focus on (1) tree inference from molecular data, (2) analyses combining fossil and extant taxa, and (3) evaluating MCMC performance, with advanced topics including assessing model adequacy and macroevolutionary analyses. Additional topics may be added depending on the interests of selected participants. The format will be a combination of interactive video sessions (via Zoom or similar tools), real-time discussions over Slack, self-guided tutorials, and pre-recorded videos.

The initial session will resolve technical issues and present the basics of using RevBayes. Participants will then be expected to work through several tutorials on their own schedule, with the help of pre-recorded materials. A Slack forum will be open for questions and issues. The workshop will conclude with several online Q&A sessions with the instructors. The dates for the interactive sessions are currently tentative and may be adjusted depending on the schedules of the participants and instructors.

We are hoping to identify up to 15 participants for this online course. While we hope we are able to accommodate everyone who applies, we realize that this may not be possible because of time-zones and availability. If the number of applicants exceeds our capacity, we hope to organize a second round of sessions later in the year. Participants will not be charged for the course, but we will request that they commit to completing the tutorials and attending a majority of interactive sessions.

To apply to this course, please go to the registration form and submit your application by July 6, 2020.

More at https://revbayes.github.io/workshops/online2020.html

https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/

Address of the bookmark: https://www.darwintreeoflife.org/an-initial-set-of-raw-genome-assemblies-from-the-darwin-tree-of-life-project/

More at http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000369

Address of the bookmark: http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1000369

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.

#!/usr/bin/awk -f

# Comments are like this


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

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

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

BEGIN {

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

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

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

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

    # Incrementing and decrementing by one
    a++;
    b--;

    # As a prefix operator, it returns the incremented value
    ++a;
    --b;

    # Notice, also, no punctuation such as semicolons to terminate statements

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

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

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

        a++;
    }

    for (i = 0; i < 10; i++)
        print "Good ol' for loop";

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

    # Logical operators as well
    # a && b  # AND
    # a || b  # OR

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

    # Arrays
    arr[0] = "foo";
    arr[1] = "bar";

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

    n = split("foo:bar:baz", arr, ":");

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

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

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

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

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

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

    # The number of command line arguments is in a variable called ARGC
    print ARGC;

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

    return_value = arithmetic_functions(a, b, c);
    string_functions();
    io_functions();
}

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

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

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

    # Now, to demonstrate the arithmetic functions

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

    # And logarithmic stuff
    localvar = exp(a);
    localvar = log(a);

    # Square root
    localvar = sqrt(a);

    # Truncate floating point to integer
    localvar = int(5.34); # localvar => 5

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

    # Here's how to return a value
    return localvar;
}

function string_functions(    localvar, arr) {

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

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

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

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

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

function io_functions(    localvar) {

    # You've already seen print
    print "Hello world";

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

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

    outfile = "/tmp/foobar.txt";

    print "foobar" > outfile;

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

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

    # Reads a line from standard input and stores in localvar
    getline localvar;

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

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

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

/^fo+bar$/ {

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

    print;

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

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

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

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

    # Prints the number of fields on this line
    print NF;

    # Print the last field on this line
    print $NF;
}

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

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

a > 0 {
    # This will execute once for each line, as long as a is positive
}

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

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

BEGIN {

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

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

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

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

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

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

END {
    if (nlines)
        print "The average age for " name " is " sum / nlines;
}