http://compbio.cs.toronto.edu/prism/

Address of the bookmark: http://compbio.cs.toronto.edu/prism/

The arguments accepted by ScaffMatch are:

  -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;

  -c) Contig fasta file;

  -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;

  -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;

  -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;

  -i) (Comma separated list of) insert size(s) of the library(-ies);

  -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);

  -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;

  -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;

  -l) Log file - where to store the logs. Optional argument. By default, stdout is used.

Address of the bookmark: http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch

The source code can be downloaded here. 

If you use E-MEM, please cite:

• N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca 

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/

PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.

Address of the bookmark: http://sco.h-its.org/exelixis/web/software/pear/doc.html

• paired-end (PE) and/or mate-pair libraries (NGS-based mode)
• long reads (NGS-based mode)
• synteny to the genome of some related species (reference-based mode)

Scaffolding 

In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.

Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:

• matches not satisfying cut-offs (--identity and --overlap)
• suboptimal matches (only best match of each query to reference is kept)
• and removing overlapping matches on reference.

In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on C. parapsilosis (13 Mb; CANPA) and A. thaliana (119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (Figures in dropbox, CANPA table, ARATH table).
Runs took ~0.5 min for CANPA on 4 CPUs and ~2 min for ARATH on 16 CPUs.

Important remarks:

• Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.
• pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no de novo assembler / scaffolder is perfect...), which breaks synteny.
• pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.
• pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations. Note however, this is experimental implementation!
• Consider closing gaps after scaffolding.

Address of the bookmark: https://github.com/lpryszcz/pyScaf

More at http://chibba.agtec.uga.edu/duplication/mcscan/

Address of the bookmark: http://chibba.agtec.uga.edu/duplication/mcscan/

You will need to solve bioinformatics problems using programming. The goal is to correctly solve as many problems as possible within 24 hours. Some of them will be approximation problems and will have partial grades. All rounds will be held online, submissions will be auto-graded in real time.

Check more at http://contest.bioinf.me/

Good luck!

More at http://gkno.me/

Address of the bookmark: http://gkno.me/

C Chiang, R M Layer, G G Faust, M R Lindberg, D B Rose, E P Garrison, G T Marth, A R Quinlan, and I M Hall. SpeedSeq: ultra-fast personal genome analysis and interpretation. Nat Meth (2015). doi:10.1038/nmeth.3505.

http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html

Address of the bookmark: https://github.com/hall-lab/speedseq

Positions available

Applications were invited from for the following posts in an industry sponsored project. The project entitled "OsHK3b technology and Know How", valid for a period upto February, 2018.

Post 3: Senior Research Fellow (Computational Biologist / Metabolic engineering)

Salary: As per DBT rule.

Duration: All the above posts are purely temporary and liable to be terminated at any time without prior notice or ceased/withdrawn by the funding agency.

Age limit: The upper age limit for SRF shall be 32 years, which is relaxed upto 5 years in the case of candidates belonging to Schedule Castes/Schedule Tribes, Women, Physically Handicapped and OBC applicants.

Essential Qualifications: Masters/B Tech/Mtech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building & maintenance, high throughput data handling and analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must. Selection preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.

Desired Skills: Will be expected to manage ongoing research activities in the project, interact with Experimental group, manage the project data analysis, prepare file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.

1. The post applied for must be clearly written on the Envelope containing the application
2. Applications received after last date shall not be entertained, School will not be responsible for any postal delay.
3. No application will be accepted via hand delivery or via e-mail. Please send printed & signed applications with detailed CV on or before 31st January, 2017 by post to the following address:

Prof. Ashwani Pareek
(Project Investigator)
Stress Physiology and Molecular Biology Laboratory (Room No-413),
School of Life Sciences,
Jawaharlal Nehru University,
New Delhi, India – 110067
Email: ashwanipareek@gmail.com