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;
}

- Development of computational methods to investigate the interplay between epigenetic and genetic layers and their role in tumor progression, by integrating genomic, epigenomic and transcriptional data. PI: Mattia Pelizzola (http://tiny.cc/comEpi)
- Epigenome and transcriptome analysis in mouse models of Hepatocellular Carcinoma. PI: Bruno Amati - Small and long non-coding RNAs in cancer stem cells. PI: Francesco Nicassio

All projects will benefit from the availability of both in-house and publicly available next-generation sequencing datasets. Familiarity with Linux environment, programming skills (especially in R) and a background in either computational biology, or physics/engineering/math will be advantageous.

Deadline for the application January 6th, to apply: http://genomics.iit.it/resources.html

Start date: March 1st, 2014

Duration: 1+2 years

Contact Person (Referent): Mattia Pelizzola

Ref. E-Mail: mattia.pelizzola@iit.it

Tel: 0039-02-94375058
Group Web Page: http://genomics.iit.it

• data = mock data for the snakefile to use
• Snakefile = name of the snakemake “formula” file
  • Note: The default file that snakemake looks for in the current working directory is the Snakefile. If you would like to override that you can specify it following the -s
    • snakemake -s snakefile.py
• envs = directory for storing the conda environments that the workflow will use.
• scripts = directory for storing python scripts called by the snakemake formula.
• config.json = json format file with extra parameters for our snakemake file to use.
• cluster.json = json format file with specification for running on the HPC
• samples.txt = file we will use later relating to the config.json file.

Run the snakemake file as a dry run (the example workflow shown above).

• This will build a DAG of the jobs to be run without actually executing them.
• snakemake --dry-run

User can execute rules of interest.

• snakemake --dry-run all VS. snakemake --dry-run call VS. snakemake --dry-run bwa

Run the snakemake file in order to produce an image of the DAG of jobs to be run.

• snakemake --dag | dot -Tsvg > dag.svg OR snakemake --dag | dot -Tsvg > dag.svg

Run the snakemake (this time not as a dry run)

1. snakemake --use-conda

The course topics will include theoretical and practical aspects in:
- Genomes comparisons,
- Evolutionary analyses (orthologs, paralogs and ancestral genomes
inference),
- RNAseq and Next Generation Sequencing (including algorithms, methods
and sequence mapping tools, data analyses and applications).

The course programme will be centred on theoretical presentations
followed by practical sessions. Practical sessions in a Linux
environment will involve Unix shell and Perl scripting. Participants
are assumed to be familiar with this environment.

A series of lectures delivered by prominent scientists on recent hot
topics in genome (Viruses, Prokaryotes, Eukaryotes) studies will be
included in the programme and future research perspectives will be
highlighted.

The topics that will be included in the course programme are similar
to those included in previously organized courses:http://www.pasteur.fr/~tekaia/BGA_courses.html

The course is aimed at motivated Ph.D students and Post-Doctoral
Researchers in Academic Institutions, with background in Mathematics,
Statistics, Biology or Computer Science and who are involved in
Bioinformatics and Genomes studies.

Selection of participants will be based on their background, running
research projects and on expressed motivations.
Selected students will have free accommodation and meals and are
expected to contribute with 200 euros and to pay for their travel
expenses.
All participants (students and invited speakers) will stay in the same
hotel.

Detailed indications are available on the course web site: http://events.embo.org/14-comparative-genomics/index.html

Candidates are advised to complete carefully the application form,
together with an abstract of at least one of their running projects, a
"one-page CV" and a personal Identity Picture (Photo).

The application deadline is March 14, 2014.

The organizers:
Menelaos Manoussakis, Hellenic Pasteur Institute, Athens, Greece.
Evdokia Karagouni, Hellenic Pasteur Institute, Athens - Greece.
Evie Melanitou, Institut Pasteur Paris - France.
Fredj Tekaia ( Institut Pasteur Paris France)
URL: http://www.pasteur.fr/~tekaia/BGA_courses.html

Date: 5 – 17 May, 2014.
More at http://events.embo.org/14-comparative-genomics/index.html
will take place in the ,

People say that interviews at Google will cover as much ground as possible. As a new college graduate, the ground that I must capture are the following. Part of the list is borrowed from a reddit post: https://www. reddit.com/r/cscareerquestions/comments/206ajq/my_onsite_interview_experience_at_google/ #bottom-comments.

1. Data structures

2. Trees and Graph algorithms

3. Dynamic Programming

4. Recursive algorithms

5. Scheduling algorithms (Greedy)

6. Caching 1

7. Sorting

8. Files

9. Computability

10. Bitwise operators

11. System design

Reference

http://www.sciencedaily.com/releases/2013/12/131204132018.htm

.NET Bio

http://blogs.msdn.com/b/msr_er/archive/2011/10/18/microsoft-biology-foundation-evolves-into-new-toolkit-net-bio.aspx

A language-neutral bioinformatics toolkit built using the Microsoft 4.0 .NET Framework to help developers, researchers, and scientists.

AMPHORA ("AutoMated Phylogenomic infeRence Application")

http://wolbachia.biology.virginia.edu/WuLab/Software.html

Metagenomics analysis software

Anduril

http://www.anduril.org/anduril/site/

Component-based workflow framework for data analysis

Armadillo workflow platform

Tool for designing and executing phylogenetic workflows

AutoDock

http://autodock.scripps.edu/

suite of automated docking tools

Biochemical Algorithms Library (BALL)

http://www.ball-project.org/

C++ library and framework for molecular modeling and visualization designed for rapid prototyping

Bio4j

http://bio4j.com/

Bio4j is a bioinformatics platform and graph based database built around most data available in UniProt KB(Swiss-Prot + TrEMBL), Gene Ontology (GO), UniRef (50,90,100), RefSeq, NCBI taxonomy, and Expasy Enzyme DB

Bioclipse

www.bioclipse.net

Visual platform for chemo- and bioinformatics based on the Eclipse Rich Client Platform (RCP).

Bioconductor

http://www.bioconductor.org/

R (programming language) language toolkit

Bioinformatics Learning Tutorial (BLT)

http://sourceforge.net/projects/biotutorial/

Educational interactive tutorials and 3D animations for Replication, Transcription, and Translation

BioHaskell

http://biohaskell.org/

Haskell (programming language)

BioJava

http://biojava.org/wiki/Main_Page

Java (programming language)

BioMOBY

http://biomoby.org/

registry of web services

BioPerl

http://www.bioperl.org/wiki/Main_Page

Perl language toolkit

BioPHP

http://www.biophp.org/

PHP language toolkit

Biopython

http://biopython.org/wiki/Main_Page

Python language toolkit

BioRails

https://github.com/biorails

a data management system designed to support researchers in drug discovery

BioRuby

http://bioruby.org/

Ruby language toolkit

BioSmalltalk

https://code.google.com/p/biosmalltalk/

Smalltalk language toolkit

BioUno

http://www.biouno.org/

BioUno is a project that applies Continuous Integration tools and techniques in Bioinformatics. It uses Jenkins and its plug-in API to create biology workflows and manage computer clusters.

caCORE

ontologic representation environment

caArray

https://cabig-stage.nci.nih.gov/community/tools/caArray

ontologic representation environment

EMBOSS

http://emboss.sourceforge.net/

Suite of packages for sequencing, searching, etc.

Gaggle

https://www.gaggle.net/

A framework for interoperability between systems biology software

Galaxy

http://galaxyproject.org/

Scientific workflow and data integration system

GenePattern

http://www.broadinstitute.org/cancer/software/genepattern/

Scientific workflow system that provides access to more than 150 genomic analysis tools

GeWorkbench

http://wiki.c2b2.columbia.edu/workbench/index.php/Home

Genomic data integration platform

GMOD

http://www.gmod.org/wiki/Main_Page

Toolkit for addressing many common challenges at biological databases.

GeneProf

http://www.geneprof.org/GeneProf/

A web-based, bioinformatics software suite for the analysis of functional genomics experiments, e.g. RNA-seq or ChIP-seq.

GeneTalk

http://www.gene-talk.de/

Tool for filtering sequence variants in VCF files. Network for scientists and clinicians for expertise and knowledge exchange. Database of annotations aboute sequence variants with clinically relevant information.

GenGIS

http://kiwi.cs.dal.ca/GenGIS/Main_Page

Application that allows users to combine digital map data with information about biological sequences collected from the environment.

GenomeSpace

http://www.genomespace.org/

Centralized web application that provides data format transformations and facilitates connections with other bioinformatics tools

GENtle

http://directory.fsf.org/wiki/GENtle

An equivalent to the proprietary Vector NTI, a tool to analyze and edit DNA sequence files

Integrated Genome Browser

http://bioviz.org/igb/

Java-based desktop genome browser

Integrative Genomics Viewer (IGV)

http://www.broadinstitute.org/igv/

High-performance desktop tool for interactive visual exploration of diverse genomic data

IntAct

http://www.ebi.ac.uk/intact/

molecular interaction database

InterMine

http://intermine.github.io/intermine.org/

Extensive data warehouse system for the analysis and integration of biological datasets

Java Treeview

http://jtreeview.sourceforge.net/

microarray data viewer

LabKey Server

http://labkey.com/

platform for integrating, analyzing and sharing data

OpenClinica

https://www.openclinica.com/

software for capturing and managing data in clinical trials

PromKappa

http://xbioinformatics.wordpress.com/tag/promkappa/

PromKappa (Promoter analysis by Kappa) software program used for promoter pattern generation and promoter analysis.

MeV: Multi-Experiment Viewer

http://www.tm4.org/mev.html

a desktop application for the analysis, visualization and data-mining of large-scale genomic data

PathVisio

http://www.pathvisio.org/

a desktop software for drawing, analysis and visualization of biological pathways

REDCRAFT

software for determining tertiary protein structure given assigned Residual Dipolar Coupling data

SAM Tools

Data format (SAM) and accompanying tool suite, for storing large nucleotide sequence alignments

Staden Package

Sequence assembly, editing and analysis, primarily consisting of gap4, gap5 and spin.

STAMP

Software package for analyzing metagenomic profiles that promotes ‘best practices’ in choosing appropriate statistical techniques and reporting results.

supraHex

An open-source R/Bioconductor package for omics data analysis using a supra-hexagonal map

Taverna workbench

Tool for designing and executing workflows

TGAC Browser

Genome Browser, visualisation solutions for big data in the genomic era

T-REX WebServer

Bioinformatics and phylogenetics webserver (NJ, PhyML, RAxML, MAFFT, MUSCLE, Newick viewer, Horizontal gene transfer detection, Reticulograms, Substitution models)

UGENE

integrated bioinformatics tools

Visomics

bioinformatics tools for omics data

Genome Analysis Toolkit 1.0 (GATK 1.0)

a software package to analyse next-generation resequencing data

https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html

Address of the bookmark: https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html

The 2014 CeMM PhD Program will focus on two thematic areas: INFECTION and CANCER, that are built on the pillars of epigenetics, bioinformatics and systems biology, chemical biology and the mechanism of action of drugs, high-throughput genetics, genomics and proteomics, and molecular and cell biology.

The choice of this strategic focus rests on the synergies between immunology, infection and cancer in pathophysiological and technological terms. It furthermore reflects the strength of the current CeMM faculty, itself built around the historical and contemporary expertise in immunology and cancer of the Medical University of Vienna.

As a CeMM PhD student you will get the chance to work at the cutting edge of interdisciplinary molecular medicine research and be trained by the entire CeMM and associated faculty to become one of the scientists shaping the future of molecular medicine.
Requirements

To be eligible to enroll in the CeMM PhD Program all candidates are required to have a bachelor’s or master’s degree in medicine, biology, chemistry, bioinformatics, mathematics or any scientific/technical, subject-relevant degree. Candidates do not need to have completed their degree at the time of application, however they must have obtained their final degree certificate by mid-September. The working language at CeMM is English, so excellent written and oral communication skills in English are required.
Timeline

Applications open on 20th January and close on 20th March 2014.
Two references are required to be submitted through the online system by 31st March 2014.
All complete candidate applications are reviewed by the CeMM Faculty in early April.
Selected candidates are invited to a Skype panel interview in late April.
Shortlisted candidates are then invited to Vienna in May for a full interview process, including an opportunity to introduce yourself through a presentation and interview rounds, meet research group members, and attend an informal dinner to get to know the Faculty members and learn more about their research.
Positions are offered by CeMM Faculty in June.
Start of PhD Program: 1st October 2014 .

Contact

Binia Maria Günther, BEd BA
Human Resources Manager
bguenther@cemm.oeaw.ac.at

Catherine Lloyd, Ph.D.
PhD and Postdoc Program Manager
clloyd@cemm.oeaw.ac.at

More Info: www.cemm.oeaw.ac.at/phd-program/application/