- Plan more efficient experiments
- Correctly interpret results
- Communicate results in publications more effectively

The course focus is on methodologies, not on particular software tools. After the course participants should be able to apply the methods in their respective environment. However, during the course, hands-on sessions will be performed using the Genedata Expressionist® software, which enables participants to quickly apply the discussed methods and visualize results. No previous knowledge on Expressionist® is required; access to the software is free of charge during the course.

More @ http://www.dixa-fp7.eu/dixa-training/dixa-training-agenda/genedata-academy#!

Classificier of reads from metagenomic sequencing experiments.

•  Kawulok, J., Deorowicz, S., CoMeta: Classification of Metagenomes Using k-mers, PLOS ONE, 2015; 10(4):1–23,

CoMSA

Compressor of multiple sequence alignments of proteins.

•  Deorowicz, S., Walczyszyn, J., Debudaj-Grabysz, A., CoMSA: compression of protein multiple sequence alignment files, Bioinformatics, 2019; 35(2):22–234,

DSRC

Compressor of sequencing reads.

•  Roguski, L., Deorowicz, S., DSRC 2: Industry-oriented compression of FASTQ files, Bioinformatics, 2014; 30(15):2213–2215,
•  Deorowicz, S., Grabowski, Sz., Compression of DNA sequences in FASTQ format, Bioinformatics, 2011; 27(6):860–862,

FAMSA

Multiple sequence alignment designed for huge families of proteins (even containing hundreds of thousands of sequences).

•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., FAMSA: Fast and accurate multiple sequence alignment of huge protein families, Scientific Reports, 2016; 6(33964):

FaStore

Compressor of FASTQ files.

•  Roguski, L., Ochoa, I., Hernaez, M., Deorowicz, S., FaStore - a space-saving solution for raw sequencing data, Bioinformatics, 2018; 34(16):2748–2756,

FQSqueezer

Experimental high-end compressor of FASTQ files.

•  Deorowicz, S., FQSqueezer: k-mer-based compression of sequencing data, Scientific Reports, 2020; 10(578):

GDC

Compressor of collections of genome sequences.

•  Deorowicz, S., Danek, A., Niemiec, M., GDC 2: Compression of large collections of genomes, Scientific Reports, 2015; 5(11565):1–12,
•  Deorowicz, S., Grabowski, Sz., Robust relative compression of genomes with random access, Bioinformatics, 2011; 27(21):2979–2986,

GTC

Genotype databases compressor with support for fast queries.

•  Danek, A., Deorowicz, S., GTC: how to maintain huge genotype collections in a compressed form, Bioinformatics, 2018; 34(11):1834–1840,

GTShark

Genotypes compressor.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, Bioinformatics, 2019; 35(22):4791–4793,

KMC

Memory frugal k-mer counter.

•  Kokot, M., Długosz, M., Deorowicz, S., KMC 3: counting and manipulating k -mer statistics, Bioinformatics, 2017; 33(17):2759–2761,
•  Deorowicz, S., Kokot, M., Grabowski, Sz., Debudaj-Grabysz, A., KMC 2: Fast and resource-frugal k-mer counting, Bioinformatics, 2015; 31(10):1569–1576,
•  Deorowicz, S., Debudaj-Grabysz, A., Grabowski, Sz., Disk-based k-mer counting on a PC, BMC Bioinformatics, 2013; 14():Article no. 160,

Kmer-db

Tool for estimation of evolutionary distances in a collection of genomes.

•  Deorowicz, S., Gudys, A., Dlugosz, M., Kokot, M., Danek, A., Kmer-db: instant evolutionary distance estimation, Bioinformatics, 2019; 35(1):133–136,

MuGI

Index allowing queries for a collection of multiple genome sequences.

•  Danek, A., Deorowicz, S., Grabowski, Sz., Indexes of Large Genome Collections on a PC, PLOS ONE, 2014; 9(10):e109384,

ORCOM

Experimental compressor of sequencing reads.

•  Grabowski, Sz., Deorowicz, S., Roguski, L., Disk-based compression of data from genome sequencing, Bioinformatics, 2014; 31(9):1389–1395,

PgSA

Index allowing queries for a collection of sequencing reads.

•  Kowalski, T., Grabowski, Sz., Deorowicz, S., Indexing arbitrary-length k-mers in sequencing reads, PLOS ONE, 2015; 10(7):1–16,

QuickProbs

Multiple sequence alignment designed especially for GPU.

•  Gudys, A., Deorowicz, S., QuickProbs 2: towards rapid construction of high-quality alignments of large protein families, Scientific Reports, 2017; 7(41553):
•  Gudys, A., Deorowicz, S., QuickProbs – A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors, PLOS ONE, 2014; 9(2):e88901,

RECKONER

Read error corrector.

•  Maciej Długosz, M., Deorowicz, S., RECKONER: read error corrector based on KMC, Bioinformatics, 2017; 33(7):1086–1089,

TGC

Compressor of collections of genomes given in Variant Call Format (VCF) files.

•  Deorowicz, S., Danek, A., Grabowski, Sz., Genome compression: a novel approach for large collections, Bioinformatics, 2013; 29(20):2572–2578,

VCFShark

Compressor of VCF files.

•  Deorowicz, S., Danek, A., GTShark: Genotype compression in large projects, biorxiv.org, 2020; ():

Whisper

Experimental mapper of whole genome sequencing data.

•  Deorowicz, S., Gudys, A., Whisper 2: indel-sensitive short read mapping, bioRxiv.org, 2019; :
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Whisper: read sorting allows robust robust mapping of DNA sequencing data, Bioinformatics, 2019; 35(12):2043–2050,
•  Deorowicz, S., Debudaj-Grabysz, A., Gudys, A., Grabowski, Sz., Robust mapping of whole genome sequencing data, Poster at The Biology of Genomes Conference, 2017;

Now my main interests are in gene regulation, where we work on promoter analysis; non-coding RNA, where miRNAs and structure prediction are the main areas; and protein structure, where the group is working on methods for structure prediction from sequence. To read more about these topics, please see the research pages.

Lab page @ http://wiki.binf.ku.dk/User:Krogh

Plants represent an untapped resource of natural bioactive compounds that significantly contribute to plant resilience to pathogens, herbivores, and abiotic stresses, and may be applied for medicine or crop protection. In this project, you will design and/or apply innovative omics integration strategies for genomics, transcriptomics, and metabolomics data, to discover plant specialized metabolite biosynthetic pathways and study their evolution. You will work together with the other PhD candidate in this project, which will entail a combination of algorithm development, greenhouse experiments, integrative omics analysis, and evolutionary genomics. Extensive local and international collaboration is foreseen, including possibilities for a foreign research visit as part of your PhD project.

The research is embedded within the chairs of Bioinformatics and Biosystematics. The projects will be (co-)supervised by Dr. Marnix Medema, Dr. Justin van der Hooft, Dr. Klaas Bouwmeester and Prof. Dr. Eric Schranz.

We ask

We are looking for two enthusiastic and complementary team players with all or a subset of the following skills:

a solid academic record (MSc) in bioinformatics, biology, or biotechnology
experience in computational omics analysis and proficiency in programming (in, e.g., Python)
at least basic to intermediate statistical and mathematical skills
demonstrable experience in working with next-generation sequencing data or with greenhouse experiments with plants
affinity with plant science, metabolism and/or biosynthetic pathways
you meet all the entry requirements of the WUR PhD programme.
More information

For more information about this position, please contact Marnix Medema, Associate Professor Bioinformatics, by email (marnix.medema@wur.nl).
For more information about the procedure, please contact vacaturemeldingen.psg@wur.nl.

Salary: Rs. 10,000/- per month.

Age limit: 35 for men and 40 for women & SC/ST.

Qualification: First class in M. Sc (Agriculture)/MCA/M.Sc (IT)/ M. Sc (Computer Application)/M.Sc (Bioinformatics)/M.Sc (Geoinformatics).

Desirable: Two years experience in web design and web programming.

Date & time of interview: 08.10.2013, 10 am

Interested candidates may appear for an interview at this institute along with their application in plain paper containing the following particulars viz. (1) Name (2) Father/Husband/Guardian’s Name (3) date of birth & age as on 01.10.2013 (4) Permanent address (5) Address for communication (6) Email address and Telephone No. with code (7) Qualification (8) National fellowship like ICAR/CSIR/UGC etc. if any (9) Whether SC/ST/OBC (10) Details of experience (Attested copies of degree certificate, proof of age, mark sheets). Original certificates should be produced for verification.

No TA/DA will be admissible to the candidates attending the test. The selected candidate will have to join immediately.

Advertisement: http://www.ctcri.org/careers/mithra_SRF.doc

The bioinformatics chat is produced by Roman Cheplyaka and hosted by Roman and Jacob Schreiber.

Address of the bookmark: https://bioinformatics.chat/

The course Bioinformatics Algorithms (Part 1) by Pavel Pevzner, Phillip E. C. Compeau, and Nikolay Vyahhi from University of California, San Diego will be offered free of charge to everyone on the Coursera platform. Sign up at http://www.coursera.org/course/bioinformatics.

Walk-in-Interview

Walk-in-interview will be held on October 5, 2013 at 10:00 A.M. at IASRI, New Delhi for a project “A New Distributed Computing Framework for Data Mining” funded by Department of Electronics and Information Technology, Government of India for the following posts. The appointment will be on contractual basis upto 14th October, 2015 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.

Research Associate

Ph.D. in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent or

Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application or equivalent with 1st Division and at least two years of research experience

 Knowledge of Statistical Analysis /Bioinformatics tools for computational genomics.

 Knowledge of R/Perl programming language

Research Associate

Ph.D. in Computer Science/ Computer Application / Bioinformatics/ Agricultural
Statistics/ Statistics or equivalent or

Post-Graduation in Computer Science/ Computer Application /Bioinformatics/ Agricultural Statistics/ Statistics or equivalent with 1st Division and at least two years of research experience

 Expertise in Java programming.
 Knowledge of system administration and networking under Linux environment.
 Knowledge of parallel programming and cluster computing.

Emoluments for Research Associate: Consolidated Rs:24000/- per month + HRA (for Ph.D. Degree holders) and Rs:23000/- per month + HRA (for Master’s Degree holders)

Age Limit: Age should be not more than 40 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates as on date of interview).

Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph.

Original certificates/ Degrees are needed to be produced at the time of interview.

No T.A. /D.A. will be paid for appearing in the interview.

Advertisement: http://www.iasri.res.in/employment/employment.htm

ECM3413 - Bioinformatics

Contents

General Information

Lecture Slides

Past Exam Paper

Continuous Assessments

Suggested Reading List

General Information

	This module runs in Semester 2.
	It is taught by Dr Ed Keedwell (Module Coordinator)
	Module Descriptor:  ECM3413
	Lecture Times: Tuesday 5pm,  171| Thursday, 171
	Workshop Times: Wednesday 11am Blue Room (Weeks 29,33 &40)
	Assessment: 2 CAs each worth 15% | 1 Examination worth 70%

Lecture Slides (if you have to print slides, to save your ink choose 'print in black and white' on the print menu)

	PPT|PDF| Lecture 1 - Introduction to Bioinformatics (& Biology)
	PPT|PDF| Lecture 2 - Genome Sequences: from fragments to sequences
	PPT|PDF| Lecture 3 - Sequence Alignment 1
	PPT|PDF| Lecture 4 - Global Pairwise Sequence Alignment
	PPT|PDF| Lecture 5 - Local Pairwise Sequence Alignment (Smith-Waterman & BLAST)
	DOC| Workshop 1 - Using BLAST and other Bioinformatics Databases
	PPT|PDF| Lecture 6 - Multiple Sequence Alignment
	PPT|PDF| Lecture 7 - BLAST (in more detail) & FASTA
	PPT|PDF| Lecture 8 - Sequence Alignment Conclusion & Other Sequence Analyses
	PPT|PDF| Lecture 9 - Markov Chains and Intro to Hidden Markov Models
	PPT|PDF| Lecture 10 - Hidden Markov Models
	PPT|PDF| Lecture 11 - Classification in Bioinformatics
	DOC|Workshop 2 - Using See5
	Workshop Data - Part 1 - adult.names | adult.data | adult.test, Part 3 - wdbc.names| wdbc.data
	PPT|PDF| Lecture 12 - Gene Expression Data
	PPT|PDF| Lecture 13 - Decision Trees and Gene Expression Classification
	PPT|PDF| Lecture 14 - Other Methods for Gene Expression Classification
	PPT|PDF| Lecture 15 - Gene Regulation
	PPT|PDF| Lecture 16 - Neural Networks in Gene Expression Analysis
	PPT|PDF| Lecture 17 - Genome Analysis
	PPT|PDF| Lecture 18 - Conclusion/Revision Lecture

For some reason best known to itself, my PDF creator doesn't like the slide with the substitution matrix on.  Therefore this has been removed from Lectures 3 and 7 for the PDF copy only - however, more information on these matrices can be found here.

Past Exam Paper

The paper from 2007/8 can be found here.

Continuous Assessments

	PDF|  CA1 - Manual Sequence Alignment
	PDF|Promoter.names|Promoter.data|ML.names|ML.data| CA2 - Data Mining in Bioinformatics

Suggested Reading List

General Bioinformatics

<="top">Xiong, J., (2006) Essential Bioinformatics, Cambridge University Press

	Lesk, A.M., (2002) Introduction to Bioinformatics, Oxford University Press
	Higgs, P.G., (2005) Bioinformatics and Molecular Evolution,  Blackwell Publishing

Machine Learning in Bioinformatics

	Baldi, P., Brunak, S., (2001) Bioinformatics: The Machine Learning Approach, MIT Press
	Keedwell, E., Narayanan, A., (2005) Intelligent Bioinformatics: The Application of Artificial Intelligence Techniques to Bioinformatics Problems, Wiley