This bookmark is created to provide NGS online books links.

Address of the bookmark: http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version

The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:

• Scaffolding using Optical Restriction Mapping
  Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here: SOMA v2.0 (63 MB tar.gz file). This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds. 
  
  
• Augmenting assemblies with mate-pair data
  Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here: AMOS-Hybrid v1.0 (142 MB tar.gz file). 
  
  
• Assembly and sequence-composition guided finishing
  Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps in-silico. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here: Finishing Scripts v1.0 (63 MB tar.gz file). 

http://www.cbcb.umd.edu/finishing/

Address of the bookmark: http://www.cbcb.umd.edu/finishing/

ADVERTISEMENT NO: NITR/SR/CH-BIF/2014/30

Applications are invited on prescribed format for the following assignment in a purely time bound research project undertaken in the Department of Biotechnology & Medical Engineering of the Institute.

1. Name of the Temporary Post : Senior Research Fellow-01
2. Name of the Research Project: “ Bioinformatics Infrastructure Facility (BIF)”
3. Name of the Sponsoring Agency: DBT, Government of India, 4 Tenure of the Project : 12th Five year Plan
5 Tenure of the Assignment : 01 year [Likely to be extended for 04 more years]
6 Job Description : BIF Maintenance and Active Research in Bioinformatics
7. Consolidated monthly compensation / Fellowship: Rs.18,000/- P.M.

8. Essential Qualifications and experience: B.Tech with valid GATE Score or M.Tech degree in Biotechnology/Bioinformatics/Computer Science/Computational Biology
9. Desirable Qualifications/ Experiences: Experience of Programming in PERL,R, Python, Unix and Visual Studio + Knowledge in NGS data analysis work flows ,WGS and statistical packages such as CRAN-R,MATLAB etc.

10. Accommodation : Bachelor accommodation in the Institute may be provided subject to availability.
11. For technical information on the project, the candidate may contact the Principal Investigator at the following address:

Name : Prof. Mukesh K Gupta
Address : Dept. of Biotechnology & Medical Engineering,
N.I.T.Rourkela-769 008
Telephone No : 0661-2462294
E-mail : guptam@nitrkl.ac.in

Eligible persons may apply in the prescribed format (available in the Institute Website)affixed with coloured photographs to be submitted in duplicate along with photo copies of relevant certificates, grade/ mark sheets, publications etc., to Asst. Registrar, SRICCE,
National Institute of Technology, Rourkela–769 008 before 22.08.2014. The cover should be super- scribed clearly the post applied for & Name of the Project.

Mere possession of minimum qualification does not guarantee invitation to the interview.
Candidates will be short listed based on merit and need of the project.

Advertisement:

http://www.nitrkl.ac.in/IntraWeb/Jobs_Tenders/Jobs/ProjectFellowship/2014/141707192838_1.pdf

The Mix algorithm, approach and results were published in BMC bioinformatics : http://www.biomedcentral.com/1471-2105/14/S15/S16.

Address of the bookmark: https://github.com/cbib/MIX

Studentship and Traineeship in Bioinformatics

Applications are invited on plain paper from suitable candidates for Studentship and Traineeship (One each) at Bioinformatics Sub-Center as detailed below:

1. Studentship: Studentship is for those who have completed M. Sc. Degrees in Life Science.

Number of seats : One

Duration : Six months

Eligibility : Passed M.Sc. degree in Life Sciences.

Fellowship : Rs. 5000/- (Five thousand only) per month

2. Traineeship: Traineeship is for those who have completed M. Sc. Degrees in Life Science/Registered Ph. D. student in Life Sciences.

Number of seats : One

Duration : Six months

Eligibility : Passed M.Sc. degree in Life Sciences/ Registered Ph. D. student in Life Sciences

Fellowship : Rs. 5000/- (Five thousand only) per month

Preferences will be given to person who has experience in Bioinformatics and Computer
sciences. The application along with detailed bio-data should reach the undersigned, on or before 25th August 2014. Both, the studentship and the traineeship are temporary, will be discontinued after the six months from the date of Joining. It may be discontinued in-between without any notice, if the work is not found satisfactory.

Advertisement www.bioinfobubpl.nic.in/Advertisement_st.pdf

The vital metaphase stage of cell division, when the sister chromatids migrated to the centre and lined up in a row, and pulled apart using attached microtubules in such a way that half the DNA ends up in each daughter cell. However, before the mitotic spindle‐mediated movement gets start and pulled DNA apart, the chromosomes are free to undergo recombination which involves the exchange of genetic material either between multiple chromosomes or between different regions of the same chromosome.

During recombination, the precise breakage of each strand, exchange between the strands, and sealing of the resulting recombined molecules happens. The “chromosomal breakpoints” refers to these places where they break. Mostly, this process occurs with a high degree of accuracy at high frequency in both eukaryotic and prokaryotic cells. But occasionally this “break and sealing/ break and reattach” process goes wrong and the reattachment happens in the wrong place which usually create disaster (with few exceptions).These chromosome disaster or abnormalities involve the gain, loss or rearrangement of visible amounts of genetic material during cell division. These abnormalities are of two type, the first one is numerical abnormalities  where severe disorders are caused by the loss or gain of whole chromosomes, which affect the copy number of hundreds or even thousands of genes. The second are structural abnormalities which can be unbalanced or balanced. The former are similar to numerical abnormalities in that genetic material is either gained or lost. The natural defects in chromosome segregation are linked to cancer and several genetic diseases (http://en.wikipedia.org/wiki/List_of_genetic_disorders). Therefore, the enzymes involved in regulating cell division are still the attractive drug targets for many diseases.

Apart from certain chromosome abnormalities, these “crossing over” of segments of maternal and paternal chromosomes to form hybrid chromosomes have some evolutionary importance and considered as a driver of genetic variation. Moreover, the chromosome breakage in evolution is considered to be non-random in nature(http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0020014). In addition the study of breakpoint regions and non-breakpoint (stable) regions of chromosomes indicates both the regions evolved in distinctly different ways ( http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/). These breakage may lead to genetic diseases or participate to chromosomal rearranmgnets and contributed in development of new species.

I will try to explain the genome hotspots/Evolutionary Breakpoint Regions(EBRs)/fragile regions/weak fragments/  in my next blog.

Software for recombination detection:

RAT http://cbr.jic.ac.uk/dicks/software/RAT/

Breakpointer https://github.com/ruping/Breakpointer

DRP http://web.cbio.uct.ac.za/~darren/rdp.html

RB-finder http://www.ncbi.nlm.nih.gov/pubmed/18707535

LDhat2.0 http://ldhat.sourceforge.net/LDhat2.0/instructions.shtml

Reference:

http://www.nature.com/scitable/topicpage/genetic-recombination-514#

Image: Wikipedia , sciencelearn.org.nz

Recommended Articles:

http://www.friendshipcircle.org/blog/2012/05/22/13-chromosomal-disorders-youve-never-heard-of/

http://web.udl.es/usuaris/e4650869/docencia/segoncicle/genclin98/recursos_classe_%28pdf%29/revisionsPDF/chromosyndromes.pdf

http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2775595/table/T2/

http://learn.genetics.utah.edu/content/disorders/chromosomal/

http://www.ncert.nic.in/html/learning_basket/biology/cc&cd.pdf

• hist: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.
• gcp: K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.
• comp: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.
• sect: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.
• blob: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.
• filter: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
  • kmer: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.
  • seq: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.
• plot: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
  • density: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.
  • profile: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool
  • spectra-cn: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.
  • spectra-hist: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.
  • spectra-mx: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".

In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.

This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit: https://kat.readthedocs.org/en/latest/

https://academic.oup.com/bioinformatics/article/33/4/574/2664339 

Address of the bookmark: https://github.com/TGAC/KAT

Walk in interview for guest faculty in Pondicherry University, India. For more information please visit http://www.bicpu.edu.in/bioinfor140814.pdf