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

Available immediately until 30th November 2015, to work on the development of bioinformatics approaches to aid analysis of data derived from the metabolomic profiling of biological matrices. The successful applicant will lead research activities on an FP7 funded EU-wide collaborative project aimed at establishing biomarker-based strategies for high throughput diagnostic screening. Key tasks will involve multivariate analysis of large datasets, bioinformatic-based selection and validation of identified markers, construction of metabolomic spectral profile databases and development of machine learning/database searching approaches amenable to analytical screening techniques. This position will offer the opportunity to travel and undertake work with project collaborators based in the Republic of Ireland and Europe.

Informal enquiries may be directed to Dr Terry McGrath, email: terry.mcgrath@qub.ac.uk.

Anticipated interview date: Thursday 31st October 2013
Salary scale: £30,424 – £39,649 per annum (including contribution points)
Closing date: Monday 21st October 2013

Telephone (028) 90973044 FAX: (028) 90971040 or e-mail on personnel@qub.ac.uk

The University is committed to equality of opportunity and to selection on merit. It therefore welcomes applications from all sections of society and particularly welcomes applications from people with a disability.

Fixed term contract posts are available for the stated period in the first instance but in particular circumstances may be renewed or made permanent subject to availability of funding.

More @ https://hrwebapp.qub.ac.uk/tlive_webrecruitment/wrd/run/ETREC107GF.open?VACANCY_ID=5616943npO&WVID=6273090Lgx&LANG=USA

Address of the bookmark: https://mummer4.github.io/

(INDIAN COUNCIL OF MEDICAL RESEARCH)

P.O BOX 101,
Dr. M. Miyazaki Marg,
Tajganj, Agra - 282001

Applications are invited for a walk-in interview to be held in the Seminar Hall of the on 15th November, 2013, 9:30 am for temporary positions of JRF, Lab Technician and Field attendant in a ICMR funded project entitled "Elucidating the strain differentiation and transmission dynamics of M. leprae through simple sequence repeats ISSR-PCR marker"

1. JRF (one Post)

Essential qualification: Candidates with M.Sc/IVI.Tech or equivalent degree in any life science related subjects with UGC-CSIR/ICMR/DBT-Net qualified

Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.

Age. Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.

Emoluments: Rs. 6,000 + 20% HRA per Month

2. Lab Technician (One Post)

Essential Qualification: 12th with DMLT/B.SCA4.SC in Life sciences

Desirable qualification: Experience in Molecular Biology/Computational Biology will be preferred.

Age: Maximum 30 years as on 11.11.2013. Age relaxation as per GOI rules.

Emoluments: Rs13,760/ Per Month

3. Field Attendant (One Post)

Essential Qualification: 10th Pass

Desirable Qualification: Experience in field work

Age: Maximum 28 years as on 11.11.2013. Age relaxation as per GOI rules.

Emoluments: Rsl2,040l Per Month

Terms: posts are purely temporary. Appointment will be initially made for a period of one (01) year and may be extended further based on the performance of the candidate up to completion of the project.

Application & Selection procedure: candidates have to appear in the walk-in-interview in person along with an application/CV on plain paper giving details of at educational qualificationq experience and submit photocopies of relevant documents at the time of interview. Selection will be based on the performance of the candidate in the interview' Candidates will not be sent any interview call letter separately. No TA/DA will be paid to the candidate for appearing in the interview. selection is not possible without appearing in the interview. All candidates must report by 9:00am on the date of interview. Advance copy of CV may be sent to m.sarathipartha@gmail.com

Advertisement: http://www.jalma-icmr.org.in/P_S_M_advertisment.pdf

Using AlignGraph

AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]

Address of the bookmark: https://github.com/baoe/AlignGraph

Deadline for applications : January 15, 2014.

Description :

We seek a talented and motivated post-doc to develop computational methods for inferring the molecular basis of genetic diseases by integration of personal omics data. Research topics include: identifying causal mutations of rare disease patients by meta-analysis; inferring disease-causing molecular pathways from genotype, human phenotypes, and omics profile of patient-derived cell lines; and causal inference from longitudinal omics studies of patients. The developed methods will be applied to analyze data from our medical collaborators.

Candidates must either hold a PhD in computational biology or bioinformatics, or hold a PhD in physics, statistics, or applied mathematics with practical experience with high-dimensional data analysis. Experience in quantitative genetics is a plus. Applicants must have a proven publication record and an interest for translational research.

The Gagneur lab is a young, lively and multidisciplinary group with a research focus on systems genetics and gene regulation. It is located at the Gene Center of the LMU (University of Munich), an interdisciplinary institution whose 16 independent research groups investigate the regulation of gene expression at all levels - from the underlying molecular mechanisms to the biological system. The institute is located on the biomedical research campus Munich-Grosshadern, offering a dynamic, interactive and internationally oriented research environment. The dynamism of Munich and the proximity of the Alps provide an excellent quality of life.

The salary is according to the TV-L (German academic salary scale).
Applications including a cover letter, CV, and references must be sent by January 15th 2014 to Julien Gagneur (gagneur@genzentrum.lmu.de)

About the lab: http://www.gagneur.genzentrum.lmu.de

Disclaimer: This cartoon is solely designed to create humour and fun, not to offend any computer experts.

Problem :

The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.

CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.

Find step wise explanationand implementation steps at http://dna.cs.byu.edu/bio465/Labs/hmm.shtml

Source code with explanation http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/

Fore detail understanding of HMM read this excellent tutorial http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf

Viterbi Algo at http://en.wikipedia.org/wiki/Viterbi_path

For firther reading Wiki page http://en.wikipedia.org/wiki/Hidden_Markov_model

On CpG island paper and for indepth understanding http://www.biomedcentral.com/1471-2164/12/S2/S10

If you are more interested in exploring Markov Chain Exploration and understand it with graphical version please visit http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&lngWId=1

Reference:

1.http://www.planet-source-code.com

2. http://www.tannerhelland.com