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/

Training Resources:

• Bioinformatics Workshop (Webinars)
• Bioinformatics Training Slides

Specialized Applications:

• De Novo Assembly
• Transcriptome analysis
• Base Modification Analysis
• Barcoding
• Data Analysis Tools
• Minor Variants and Phasing Analysis

Address of the bookmark: https://github.com/PacificBiosciences/Bioinformatics-Training/wiki

Address of the bookmark: http://abacas.sourceforge.net/Manual.html#9._Colour_code

Address of the bookmark: http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3

Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes

Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, Kåre L. Nielsen and Per .H. Nielsen

Nature Biotechnology 2013, doi: 10.1038/nbt.2579

Address of the bookmark: https://github.com/MadsAlbertsen/multi-metagenome

Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements.

Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics
Knowledge in computer programming, LINUX OS.
Expertise in use of R/other Bioinformatics software

More at http://iasri.res.in/employment/2017/cabin_advertisement_RA_SRF_YP_Mar2017.pdf

Phenomics of Moisture Deficit Stress Tolerance and Nitrogen Use December 31, 2019

Research Associate (RA) Two (2)

Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or System Administrator/ Computer expert for database development, development of phenome data bank and virtual phenomics facility, data archiving and Efficiency in Rice and Wheat-Phase II (Funded by National Agricultural Science Fund, ICAR) Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements. maintenance; Development of image analysis algorithms, APIs and IAPs.

Knowledge in System Biology/ Statistical and computational Genomics/ Bioinformatics
Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software & tools.
December 31, 2019

Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science / Computer Application or equivalent or Master’s in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 4 years or 5 years of Bachelor’s degree having 1st Division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from fellowship/ associateship/ training/ other engagements.

Knowledge of Statistical and Computational Genomics/ Bioinformatics.
Knowledge of programming in LINUX/R/Perl/JAVA/PHP/JSP and use of various software & tools.
March 31, 2020