.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

• Bioconductor – A plethora of tools for analysis and comprehension of high-throughput genomic data, including 1500+ software packages. [ paper-2004 | web ]
• Biopython – Freely available tools for biological computing in Python, with included cookbook, packaging and thorough documentation. Part of the Open Bioinformatics Foundation. Contains the very useful Entrez package for API access to the NCBI databases. [ paper-2009 | web ]
• Bioconda – A channel for the conda package manager specializing in bioinformatics software. Includes a repository with 3000+ ready-to-install (with conda install) bioinformatics packages. [ paper-2018 | web ]
• BioJulia – Bioinformatics and computational biology infastructure for the Julia programming language. [ web ]
• Rust-Bio – Rust implementations of algorithms and data structures useful for bioinformatics. [ paper-2016 ]
• SeqAn – The modern C++ library for sequence analysis.

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/

No. CSE/14/1038

Walk in Interview for the post of JRF under TEQIP-II

SN Department – Qualification Post Graduation – Time

1 Bio-Informatics & Mathematics M.Tech Bio-informatics/M.Sc.* Maths 10.00 AM

2 Biological Sciences M.Sc.* in any branch of Biological Sciences 10.30 AM

3 Chemical Engineering M.Tech Chemical Engineering 11.00 AM

4 Chemistry M.Sc.* Chemistry 11.30 AM

5 Civil Engineering M.Tech Structure/GeoTech. /Water -Resources/Hydraulics/Environment/Transport 12.00 Noon

6 GIS M.Tech GIS/Civil 12.30 PM

7 Computer Science & Engineering M.Tech CSE/Information Security 01.00 PM

8 Electrical Engineering M.Tech Electrical Derives 01.30 PM

9 Electronics & Communication M.Tech Digital Communication 02.00 PM

10 MSME M.Tech Material Science/ Mechanical/Metallurgy 02.30 PM

11 Physics M.Sc.* Physics 03.00 PM

* M.Sc. with NET/GATE qualified

Resume along with one passport size photograph and relevant documents are required at the time of interview

Amount of Fellowship: Rs 18000/-month+ HRA

Duration: 31st Dec 2014 (End of TEQIP-II project)

Date of Interview: 7th February 2014

Venue Institute Committee Room

Advertisement:

http://www.manit.ac.in/manitbhopal/Year2014/Recruitment/Advertisement%20JRF.pdf

• the Damerau–Levenshtein distance allows insertion, deletion, substitution, and the transposition of two adjacent characters;
• the longest common subsequence (LCS) distance allows only insertion and deletion, not substitution;
• the Hamming distance allows only substitution, hence, it only applies to strings of the same length.
• the Jaro distance allows only transposition.

use Text::Levenshtein qw(distance);

 print distance("foo","four");
 # prints "2"

 my @words     = qw/ four foo bar /;
 my @distances = distance("foo",@words);

 print "@distances";
 # prints "2 0 3"

use Algorithm::LCSS qw( LCSS CSS CSS_Sorted );
    my $lcss_ary_ref = LCSS( \@SEQ1, \@SEQ2 );  # ref to array
    my $lcss_string  = LCSS( $STR1, $STR2 );    # string
    my $css_ary_ref = CSS( \@SEQ1, \@SEQ2 );    # ref to array of arrays
    my $css_str_ref = CSS( $STR1, $STR2 );      # ref to array of strings
    my $css_ary_ref = CSS_Sorted( \@SEQ1, \@SEQ2 );  # ref to array of arrays
    my $css_str_ref = CSS_Sorted( $STR1, $STR2 );    # ref to array of strings

There are many different modules on CPAN for calculating the edit distance between two strings. Here's just a selection.

Text::LevenshteinXS and Text::Levenshtein::XS are both versions of the Levenshtein algorithm that require a C compiler, but will be a lot faster than this module.

The Damerau-Levenshtein edit distance is like the Levenshtein distance, but in addition to insertion, deletion and substitution, it also considers the transposition of two adjacent characters to be a single edit. The module Text::Levenshtein::Damerau defaults to using a pure perl implementation, but if you've installed Text::Levenshtein::Damerau::XS then it will be a lot quicker.

Text::WagnerFischer is an implementation of the Wagner-Fischer edit distance, which is similar to the Levenshtein, but applies different weights to each edit type.

Text::Brew is an implementation of the Brew edit distance, which is another algorithm based on edit weights.

Text::Fuzzy provides a number of operations for partial or fuzzy matching of text based on edit distance. Text::Fuzzy::PP is a pure perl implementation of the same interface.

String::Similarity takes two strings and returns a value between 0 (meaning entirely different) and 1 (meaning identical). Apparently based on edit distance.

Text::Dice calculates Dice's coefficient for two strings. This formula was originally developed to measure the similarity of two different populations in ecological research.

Qualifications

PhD or Post-Graduated Master degree is required. Successful candidates will have some expertise in data analysis of NGS data by using methods running in R and UNIX environment. Familiarity with genome databases and browsers is required.

Application

Candidates should send a CV and a brief personal statement focusing on their skills and interests related to the research project.

Contacts

Start date: 1° April 2014
Salary on grant: 25,000 euros per year.
Contact Person (Referent): Mario Capasso
Ref. Email: mario.capasso@unina.it and achille.iolascon@unina.it
Tel: +39 081 3737889

awk '/pattern1/ {Actions}
/pattern2/ {Actions}' file

The working of Awk is as follows
Awk reads the input files one line at a time.
For each line, it matches with given pattern in the given order, if matches performs the corresponding action.
If no pattern matches, no action will be performed.
In the above syntax, either search pattern or action are optional, But not both.
If the search pattern is not given, then Awk performs the given actions for each line of the input.
If the action is not given, print all that lines that matches with the given patterns which is the default action.
Empty braces with out any action does nothing. It wont perform default printing operation.
Each statement in Actions should be delimited by semicolon.
Say you have data.tsv with the following contents:

$ cat data/test.tsv
contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2 ACTTTATATATT
contig3 ACTTATATATATATA
contig4 ACTTATATATATATA
contig5 ACTTTATATATT
By default Awk prints every line from the file.

$ awk '{print;}' data/test.tsv
contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2 ACTTTATATATT
contig3 ACTTATATATATATA
contig4 ACTTATATATATATA
contig5 ACTTTATATATT
We print the line which matches the pattern contig3

$ awk '/contig3/' data/test.tsv
contig3 ACTTATATATATATA
Awk has number of builtin variables. For each record i.e line, it splits the record delimited by whitespace character by default and stores it in the $n variables. If the line has 5 words, it will be stored in $1, $2, $3, $4 and $5. $0 represents the whole line. NF is a builtin variable which represents the total number of fields in a record.

$ awk '{print $1","$2;}' data/test.tsv
contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2,ACTTTATATATT
contig3,ACTTATATATATATA
contig4,ACTTATATATATATA
contig5,ACTTTATATATT

$ awk '{print $1","$NF;}' data/test.tsv
contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2,ACTTTATATATT
contig3,ACTTATATATATATA
contig4,ACTTATATATATATA
contig5,ACTTTATATATT

Awk has two important patterns which are specified by the keyword called BEGIN and END. The syntax is as follows:

BEGIN { Actions before reading the file}
{Actions for everyline in the file}
END { Actions after reading the file }

For example,
$ awk 'BEGIN{print "Header,Sequence"}{print $1","$2;}END{print "-------"}' data/test.tsv
Header,Sequence
contig1,ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2,ACTTTATATATT
contig3,ACTTATATATATATA
contig4,ACTTATATATATATA
contig5,ACTTTATATATT
-------
We can also use the concept of a conditional operator in print statement of the form print CONDITION ? PRINT_IF_TRUE_TEXT : PRINT_IF_FALSE_TEXT. For example, in the code below, we identify sequences with lengths > 14:

$ awk '{print (length($2)>14) ? $0">14" : $0"<=14";}' data/test.tsv
contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG>14
contig2 ACTTTATATATT<=14
contig3 ACTTATATATATATA>14
contig4 ACTTATATATATATA>14
contig5 ACTTTATATATT<=14
We can also use 1 after the last block {} to print everything (1 is a shorthand notation for {print $0} which becomes {print} as without any argument print will print $0 by default), and within this block, we can change $0, for example to assign the first field to $0 for third line (NR==3), we can use:

$ awk 'NR==3{$0=$1}1' data/test.tsv
contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2 ACTTTATATATT
contig3
contig4 ACTTATATATATATA
contig5 ACTTTATATATT
You can have as many blocks as you want and they will be executed on each line in the order they appear, for example, if we want to print $1 three times (here we are using printf instead of print as the former doesn't put end-of-line character),

$ awk '{printf $1"\t"}{printf $1"\t"}{print $1}' data/test.tsv
contig1 contig1 contig1
contig2 contig2 contig2
contig3 contig3 contig3
contig4 contig4 contig4
contig5 contig5 contig5
Although, we can also skip executing later blocks for a given line by using next keyword:

$ awk '{printf $1"\t"}NR==3{print "";next}{print $1}' data/test.tsv
contig1 contig1
contig2 contig2
contig3
contig4 contig4
contig5 contig5

$ awk 'NR==3{print "";next}{printf $1"\t"}{print $1}' data/test.tsv
contig1 contig1
contig2 contig2

contig4 contig4
contig5 contig5
You can also use getline to load the contents of another file in addition to the one you are reading, for example, in the statement given below, the while loop will load each line from test.tsv into k until no more lines are to be read:

$ awk 'BEGIN{while((getline k <"data/test.tsv")>0) print "BEGIN:"k}{print}' data/test.tsv
BEGIN:contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
BEGIN:contig2 ACTTTATATATT
BEGIN:contig3 ACTTATATATATATA
BEGIN:contig4 ACTTATATATATATA
BEGIN:contig5 ACTTTATATATT
contig1 ACTGTCTGTCACTGTGTTGTGATGTTGTGTGTG
contig2 ACTTTATATATT
contig3 ACTTATATATATATA
contig4 ACTTATATATATATA
contig5 ACTTTATATATT
You can also store data in the memory with the syntax VARIABLE_NAME[KEY]=VALUE which you can later use through for (INDEX in VARIABLE_NAME) command:

$ awk '{i[$1]=1}END{for (j in i) print j"<="i[j]}' data/test.tsv
contig1<=1
contig2<=1
contig3<=1
contig4<=1
contig5<=1

If you have a license key for Modeller 8 or 9, there is no need to reregister for Modeller 9.13 - the same license key will work. (It won't do any harm to reregister if you want to, though!)

9.13 is primarily a bugfix release relative to the last public release(9.12). Major user-visible changes include:

# Modeller now includes a variety of SOAP (statistically optimized atomic potential) scores for assessing proteins, loops, and interfaces.

# The Lennard-Jones interaction energy is now artificially truncated at very short distance; this makes simulations with poor starting conditions much less likely to 'blow up'.

# model.get_insertions(), model.get_deletions() and model.loops() now have an include_termini option; if False, residue ranges that include chain termini are excluded from the output.

See the Modeller manual for a full change log: http://salilab.org/modeller/9.13/manual/node39.html

If you encounter bugs in Modeller 9.13, please see http://salilab.org/modeller/9.13/manual/node10.html for information on how to report them.

Reference:

http://salilab.org/modeller/

https://edu.t-bio.info/collaborative-model-bioinformatics-education-combining-biologically-inspired-bioinformatics-project-based-learning/