BOL: Related items

mojolicious: a next generation web framework for the Perl programming language.

Jit — Fri, 12 Jan 2018 16:48:10 -0600

Back in the early days of the web, many people learned Perl because of a wonderful Perl library called CGI. It was simple enough to get started without knowing much about the language and powerful enough to keep you going, learning by doing was much fun. While most of the techniques used are outdated now, the idea behind it is not. Mojolicious is a new endeavor to implement this idea using bleeding edge technologies.

Features

An amazing real-time web framework, allowing you to easily grow single file prototypes into well-structured MVC web applications.
- Powerful out of the box with RESTful routes, plugins, commands, Perl-ish templates, content negotiation, session management, form validation, testing framework, static file server, CGI/PSGI detection, first class Unicode support and much more for you to discover.
A powerful web development toolkit, that you can use for all kinds of applications, independently of the web framework.
- Full stack HTTP and WebSocket client/server implementation with IPv6, TLS, SNI, IDNA, HTTP/SOCKS5 proxy, UNIX domain socket, Comet (long polling), Promises/A+, keep-alive, connection pooling, timeout, cookie, multipart and gzip compression support.
- Built-in non-blocking I/O web server, supporting multiple event loops as well as optional pre-forking and hot deployment, perfect for building highly scalable web services.
- JSON and HTML/XML parser with CSS selector support.
Very clean, portable and object-oriented pure-Perl API with no hidden magic and no requirements besides Perl 5.24.0 (versions as old as 5.10.1 can be used too, but may require additional CPAN modules to be installed)
Fresh code based upon years of experience developing Catalyst, free and open source.
Hundreds of 3rd party extensions and high quality spin-off projects like the Minion job queue.

http://mojolicious.org/

Address of the bookmark: http://mojolicious.org/

Narcis Fernandez-Fuentes Lab

Mon, 25 May 2015 07:30:00 -0500

Welcome to our web-site compiling all the research-related activities of the group. Our research interests relate to a number of areas within Bioinformatics. We have a long-standing interest in protein structure prediction and structure-to-function relationships. We work in the study of biomolecular interactions, modeling of protein complexes, the study and characterization of protein-protein interactions, peptide design, modeling of genetic variation, structure-based protein design and different aspects of Plant Bioinformatics. Take a look at the our databases and servers and the list of publications for more information.

More at http://www.bioinsilico.org/

d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.

Jit — Fri, 06 Apr 2018 12:10:45 -0500

Mike Bostock’s D3.js is great for creating interactive network graphs with JavaScript. The d3Network package makes it easy to create these network graphs from R. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.

Address of the bookmark: http://christophergandrud.github.io/d3Network/

Genomic Scientist at UDSC

Thu, 28 May 2015 19:14:23 -0500

Centre for Genetic Manipulation of Crop Plants

Department of Genetics

University of Delhi South Campus

NEW DELHI – 110 021

WALK-IN-INTERVIEW FOR THE TEMPORARY POSITIONS OF RESEACH SCIENTIT & LAB / FIELD ATTENDANT

1 Research Scientist (RS) – 3

DBT, Ph. D.

Experience on DNA Markers, plant genome mapping and bioinformatics

Salary: 60,000 (Consolidated) + 5% annual increment

Date and time: 25.06.2015 at 10:30 AM

These temporary positions have been sanctioned in a DBT funded project for the Phase II on ‘Centre of Excellence on genome mapping and molecular breeding of Brassicas.’

The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room.

Applicants are requested to bring all related documents, in original and a set of photocopy, for verification.

No TA/DA will be paid for attending the interview.

www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&cntnt01articleid=5492&cntnt01returnid=83

Tools for Protein-Protein Docking !

Poonam Mahapatra — Wed, 25 Apr 2018 05:15:53 -0500

Predicting the structure of protein–protein complexes using docking approaches is a difficult problem whose major challenges include identifying correct solutions, and properly dealing with molecular flexibility and conformational changes. Following are the tools to predict the structure of protein–protein complexes:

3D-Dock Suite

Global rigid search: FFTShape complementarity and electrostatics

Re-scoring and clustering. Refinement of interface side-chains

3D-Garden

Global rigid search in ensamble

Shape complementarity and Lennard–Jones potential

Side chain and backbone dihedral refinement

DOT

Global rigid search: FFTShape complementarity, electrostatics and VDWNone

Escher NG

Global rigid searchShape complementarity, hydrogen bonds and electrostatic

Integrated in VEGA

GRAMM

Global rigid search: FFT. smooth protein surface representation for soft docking

Shape complementarity and Lennard-Jones potential

Clustering of conformations

GRAMM-X

Global rigid search: FFT. smooth protein surface representation for soft docking

Shape complementarity and Lennard-Jones potentialminimization and re-scoring with multiple filters

HEX

Global rigid search: Fourier correlation of spherical harmonics

Shape complementarity

HADDOCK

Global rigid searchElectrostatic ,VDW and desolvation energy termsMD simulated annealing refinement . Filtering based on external data.

ICM

Global rigid search: Monte CarloEmpirical scoring function

Clustering and selection of conformations. Refinement of interface side-chains and re-scoring

MolFit

Global rigid search: FFTShape complementarity

Clustering of good solutions, filtering using a priori information and small, local rigid rotations around selected conformations

PatchDock

Global rigid searchShape complementarity and atomic desolvation energy

Clustering of conformations

PyDock

Global rigid search:FFTShape complementarity

rescoring by binding electrostatics and desolvation energy

RosettaDock

Local rigid search: Monte Carlo with low and high resolution structure representation levels

Different scoring parameters for the different resolutions

ZDOCK

Global rigid search: FFTShape complementarity, desolvation energy, and electrostatics.

Energy minimization and re-scoringFree for academics

Point to note:

The proper treatment of flexibility in protein–protein docking is still an active field of research. You first should analyzed your proteins in order to define their conformational space and then choose the most suitable method for your docking problem.

Walk-ins for JRF ans SRF post in Assam Agricultural University

Thu, 28 May 2015 19:16:47 -0500

Distributed Information Centre
Department of Agricultural Biotechnology
Assam Agricultural University
Jorhat – 785 013
Walk-in interview

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

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

Research Associate

Ph.D. in Biotechnology/ Bioinformatics. Or

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

Desirable : Experience in Bioinformatics as evidenced from published research

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

Senior Research Fellow

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

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

Rs 18,000+HRA for non-NET qualified general degree holder

Junior Research Fellow

Master Degree in Biotechnology/ Bioinformatics/Computer Science/Computer Application

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

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

Rs 16,000+HRA for non-NET qualified general degree holder

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

Advertisement: http://14.139.222.145/classified/biotech46.html

EvidentialGene: tr2aacds, mRNA Transcript Assembly Software

Rahul Nayak — Tue, 08 May 2018 04:39:39 -0500

EvidentialGene is a genome informatics project, "Evidence Directed Gene Construction for Eukaryotes", to construct high quality, accurate gene sets for animals and plants, developed by Don Gilbert at Indiana University, see
http://arthropods.eugenes.org/EvidentialGene/

Construction refers to the combination of classical gene prediction, and more recent gene assembly (de-novo and genome-assisted) methods. The basic Evigene methods involve using available best-of-breed gene prediction and assembly software, combining all evidence for genes, from expressed sequences, genome assembly sequences, related species protein sequences, and any other, to annotate and score gene constructions. Over-produced constructions are classified by gene evidence for best qualities per "locus", including genome-aligned and gene-transcript aligned (genome-free) locus identification. All software developed for EvidentialGene is publicly available. See project wiki/blog for notes.

Download

http://arthropods.eugenes.org/EvidentialGene/trassembly.html

https://sourceforge.net/p/evidentialgene/blog/

Address of the bookmark: http://arthropods.eugenes.org/EvidentialGene/trassembly.html

SRF post in NEHU, Shillong

Wed, 03 Jun 2015 13:15:38 -0500

Dept of Biochemistry
North-Eastern Hill University
(A University with Potential for Excellence)
Umshing, Shillong- 793 022

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

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

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

For JRF position, freshers can also apply.

Stipend: As per SERB norms.

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

Advertisement: http://www.nehu.ac.in/Advertisements/BiochemSERB_Advt_020615.pdf

gapFinisher: A reliable gap filling pipeline for SSPACE-LongRead scaffolder output

Rahul Nayak — Fri, 24 Jan 2020 06:04:40 -0600

gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and GMcloser.

gapFinisher can fill gaps in draft genomes quickly and reliably.

Address of the bookmark: https://github.com/kammoji/gapFinisher

Reverse Complement Problem Solved with Perl

Jit — Tue, 09 Jun 2015 23:37:23 -0500

Question at http://rosalind.info/problems/1b/

#Find the reverse complement of a DNA string.
#Given: A DNA string Pattern.
#Return: Pattern, the reverse complement of Pattern.

use strict;
use warnings;

my $string="AAAACCCGGT";
my $finalString="";
my %hash = (
   "C" => "G",
   "A" => "T",
   "T" => "A",
   "G" => "C",
);

for (my $aa=0; $aa<=(length($string)-1); $aa++) {
   my $char=substr $string, $aa, 1;
   #print $hash{$char};
   $finalString="$hash{$char}"."$finalString";
}

print $finalString;
print "\n";