Essential qualifications for JRF
: M. Sc. in Bioinformatics with experience in Proteomics, genomics and structural biology. Knowledge of programming language, pearl and database – HTML, CSS,php and Java script.
Essential qualifications for Research Associate:
MSc/MTech in Bioinformatics with three years experience or Ph.D in Bioinformatics with experience in proteomics, genomics and structural biology. Knowledge of programming language, perl and database
– HTML, CSS, Java script. NGS sequence assembly and analysis and algorithm designing.
Age limit : 35 years maximum (5 year relaxation for SC/ST and women candidates)
Emoluments:
JRF: 16,000 + 30% HRA
.
Res Assoc: Rs22,000 + 30% HRA
The post is purely temporary in nature and is co-terminus with the project. The appointment would be initially for one year and may be extended further upon satisfactory performance.
Interested candidates
should send the duly filled application forms (format in the following page ) so as to reach on or before 20.9.2014 along with all the relevant documents.

More at http://www.iari.res.in/files/JRF_RA-03092014-20140903-135319.pdf

Address of the bookmark: https://sourceforge.net/projects/ksnp/files/

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/BASE

It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin

ADVERTISEMENT NO. - URDIP/ 5/2014

Learning opportunity for young Science and Engineering professionals to make a career in Information Science Industry CSIR has set up a Unit for Research and Development of Information Products (CSIR-URDIP) at Pune to work in the area of Scientific Informatics (ChemBioinformatics/Patent Informatics/Phytoinformatics/Toxinformatics) and related
software development projects.

Applications are invited from CSIR - UGC NET Qualified Candidates for consideration as Project Fellow (PF) and/or Senior Project Fellow (SPF) based on the experience to work on existing and new projects at CSIRURDIP.

Project Fellow

Remuneration - (Rs. 16,000.00 + 20% HRA)

M. Sc. In Biochemistry/Microbiology/Bioinformatics [Post-code A02] only with minimum of 55% marks

Senior Project Fellow

Remuneration - (Rs. 18,000.00 + 20% HRA)

M. Sc. in Biochemistry/Microbiology/Bioinformatics [Post-code A05] only with minimum of 55% marks plus two years research or relevant informatics experience

Please visit www.urdip.res.in/career.htm to apply online by 30th September, 2014.

Successful candidates who have appeared for NET exam in 2012 and 2013 are only eligible to apply.

Advertisement: http://115.112.95.114/urhr/download/Advt5_2014.pdf

1. Supply your genes/genomic segments/phylogenetic tree of interest in the input-box by
   • selecting the type of identifier and pasting identifiers (one per line)
   • or by using the gene ID search tool
   • or with the BLAST search tool
2. Click "Visualize context".

Consult the documentation to learn more about MGcV.

Address of the bookmark: http://mgcv.cmbi.ru.nl/

Eligible candidates are invited for a walk-in-interview for recruitment of Project Assistant in SVIMS Bioinformatics centre under the BTISnet Project entitled “Creation of Bioinformatics Infrastructure Facility for promotion of Biology teaching through Bioinformatics” on 25.09.2014 at 11 AM in SVIMS, Tirupati. The engagement will be made purely on temporary basis for a period of one year and it can be terminated at any time without notice or without assigning any reason thereof by the Coordinator of the Project. The person engaged shall not be entitled for any claim implicit or explicit for absorption in the University.

1. Name of the post : Project Assistant

2. Qualification :
i) Essential : MSc Bioinformatics/MTech (Biotechnology/Bioinformatics)

ii) Desirable : Experience in Bioinformatics research work (Preference will be given to candidates qualified in BINC/UGC/CSIR/NET/GATE)

3. Remuneration : 16000 + 10% HRA for NET/GATE candidates 14000 + 10% HRA for M. Tech / M.Sc. Candidates

4. Place of posting : Tirupati

5. Duration of the Project : One year

Terms and conditions:

1. Candidates are required to submit the Biodata relevant certificates in support of their age and educational qualification etc., before the interview committee, SVIMS University, Tirupati.

2. Candidates called for interview will attend the interview at their own cost.
3. Interim enquiries will not be entertained.
4. The maximum age limit for Project Assistant is 28 years for general category and 33 years for SC and ST category candidates as on 25th September, 2014.

Advertisement:

http://svr98.ehostpros.com/~svimsb98/Project%20Assistant_notification.pdf

if you map reads to GRCh38 or hg38, use the following:

ftp://ftp.ncbi.nlm.nih.gov/genomes/all/GCA/000/001/405/GCA_000001405.15_GRCh38/seqs_for_alignment_pipelines.ucsc_ids/GCA_000001405.15_GRCh38_no_alt_analysis_set.fna.gz

There are several other versions of GRCh37/GRCh38. What’s wrong with them? Here are a collection of potential issues:

More at http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use

Address of the bookmark: http://lh3.github.io/2017/11/13/which-human-reference-genome-to-use

Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence. 

Address of the bookmark: https://sourceforge.net/projects/metassembler/?source=directory

Please visit our site at www.arraygen.com