#NBGN21

www.nbgn21conference.com

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;

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.

Conference

7th to 8th October 2013
Berlin, Germany

Website: https://www.gtcbio.com/conference/ngseurope-overview
Contact person: Kristen Starkey

We welcome you to join us at GTC’s NGS & Bioinformatics Summit Europe on October 7-8, 2013 in Berlin, Germany.

Organized by: GTC
Deadline for abstracts/proposals: 7th September 2013

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

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

Link @ http://bioinf.boku.ac.at/

for applicants interested in performing high-quality research on the connection between software engineering, database systems, and theoretical computer science as well as their applications in bioinformatics and business informatics. The research programme will start on October 1, 2013 until 30.09.2016. The period of employment is governed by the Fixed Term Research Contracts Act (Wissenschaftszeitvertragsgesetz – WissZeitVG).

This research programme is a joint activity of Professors Lehner, Assmann, Baader, Baier, Schill, Schlegel, Schroeder, and Strahringer at TU Dresden. Alongside their research, an individual mentoring and qualification approach are arranged with specialized courses that prepare them optimally for their research, a research seminar where they can meet internationally renowned researchers in the field, and soft skills and language courses.

Requirements: Applicants should have an excellent academic record, and hold a MSc (or an equivalent university degree) in computer science or related disciplines (such as mathematics, bioinformatics or business informatics). Fluency in spoken and written English is required. Applicants with a good knowledge of software engineering or one of the application areas mentioned above are preferred. TU Dresden is committed to increase the proportion of women in research.

Applications from women are particularly welcome. The same applies to disabled people.

Please send enquiries to: wolfgang.lehner@tu-dresden.de

Applications consist of a CV, the names of two referees, transcipts of documents summarizing their academic performance, and a statement of interest. Application by email in pdf format is preferred, and should be submitted to wolfgang.lehner@tu-dresden.de in an electronically signed and encrypted form by July 30, 2013 (stamped arrival date of the university central mail service applies). Alternatively, applications can be sent to: TU Dresden, Fakultät Informatik, Institut für Systemarchitektur, Prof.  Dr.-Ing.  Wolfgang Lehner, 01062 Dresden, Germany.

Shortlisted candidates will be invited to Dresden in the middle of August to give a presentation on their Master’s thesis and discuss their research interest with the participating professors. Candidates that have not yet finished their degree when they send in their application should send preliminary transcripts of their academic records as well as a letter by the thesis adviser that comments on their progress so far and on the expected date of completion of their MSc or equivalent degree.