Address of the bookmark: https://github.com/sc932/ALE

RASA offers faster, better and cost effective cutting edge technology solutions to chemical and life science research and industry. We provide our customers with A seamless model of wide expertise and comprehensive platforms. Our Value is to take our customers

The successful candidate will be in charge of the detection of polymorphisms including structural variants, of the comparison of multiple and diverse genomes of a same species and of the construction of pan- and core-genomes. These challenging tasks will require bioinformatics developments and implementation of methods for accommodating the high level of repetitiveness of complex genomes. The tools will be integrated into pipelines and made available to end-users through the Galaxy platform. The bioinformatician will therefore also have to provide researchers with advices on their experimental designs in order to ensure compliance of produced datasets with pipelines requirements. He/she will be hosted by a bioinformatics/informatics team (7 people) (http://moulon.inra.fr/index.php/fr/equipestransversales/atelier-de-bioinformatique) which has computational facilities and expertise in NGS data analysis, and will benefit as well from national and international collaborative networks (Aplibio http://www.renabi.fr/platforms/aplibio/, Transplant http://transplantdb.eu, AMAIZING http://www.amaizing.fr/).

The position requires a doctoral degree (PhD) in bioinformatics with strong expertise in script writing (Python/Perl) and pipeline development.

Applicants should send a CV and the names of 2 referees willing to provide a letter of recommendation to joets@moulon.inra.fr.

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;

Kindly log on to conference website http://rgcb.res.in/IACR2014 for further details and timely updates and registration. We shall truly appreciate if the same be circulated among your friends, scholars and students encouraging them to participate in the meet.

http://210.212.237.38/iacrconference/

Dated : 22 Nov 2013 -23 Nov 2013

http://www.ngsasia-congress.com/

Introduction to bioinformatics is a course for biologists and clinicians that would like to learn more about the way bioinformatics is used in healthcare, biotech and pharmaceuitcal industry as well as basic research. The course covers many of the topics transformed by the emergence of big data and computational technologies. To learn more about the course, visit: https://edu.t-bio.info/course/introduction-bioinformatics/

https://liulab-dfci.github.io/software/

Problem :

The CG island is a stretch of DNA (usually longer than 200 bases) in which the frequency of the CG sequence is higher than other regions. It is also called the CpG island, where "p" simply indicates that "C" and "G" are connected by a phosphodiester bond.

CpG islands are often located around the promoters of housekeeping genes (which are essential for general cell functions) or other genes frequently expressed in a cell. At these locations, the CG sequence is not methylated. By contrast, the CG sequences in inactive genes are usually methylated to suppress their expression. The methylated cytosine may be converted to thymine by accidental deamination. Unlike the cytosine to uracil mutation which is efficiently repaired, the cytosine to thymine mutation can be corrected only by the mismatch repair which is very inefficient. Hence, over evolutionary time scales, the methylated CG sequence will be converted to the TG sequence.

Find step wise explanationand implementation steps at http://dna.cs.byu.edu/bio465/Labs/hmm.shtml

Source code with explanation http://www.tannerhelland.com/1187/hidden-markov-models-viterbi-algorithm-cpg-islands-in-vb6/

Fore detail understanding of HMM read this excellent tutorial http://www.cs.ubc.ca/~murphyk/Software/HMM/labman2.pdf

Viterbi Algo at http://en.wikipedia.org/wiki/Viterbi_path

For firther reading Wiki page http://en.wikipedia.org/wiki/Hidden_Markov_model

On CpG island paper and for indepth understanding http://www.biomedcentral.com/1471-2164/12/S2/S10

If you are more interested in exploring Markov Chain Exploration and understand it with graphical version please visit http://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=75049&lngWId=1

Reference:

1.http://www.planet-source-code.com

2. http://www.tannerhelland.com

Postdoc position (m/w/d)

in the field of computational evolutionary microbiology is available
for an initially limited period of 36 months at the earliest possible
date. The weekly working time corresponds to 100% of full employment
(If the legal requirements under collective bargaining law are met, the
tariff grouping is carried out up to pay scale 13 TV-L. The obligation
to teach amounts to 4 hours.

The Genomic Microbiology Group research interests are focused on
microbial genome evolution with an emphasis on the study of lateral gene
transfer. In our research we use both computational and experimental
approaches (see www.uni-kiel.de/genomik). The position offers the
opportunity to develop an independent research profile within the group
research focus. The successful applicant is expected to be involved
in teaching of bioinformatics and molecular evolution, including the
development of teaching materials (lectures/exercises/short videos).

Your profile:
· Doctoral or PhD degree in Molecular Evolution, Bioinformatics or
related fields.
· Knowledge and experience in programming (e.g., Python) and
biostatistical analysis (e.g., with R or MatLab).
· Any of the following expertise is an advantage: the analysis of
genomic or transcriptomic data, phylogenetic reconstruction,
comparative genomics.
· Good oral and written communication skills in English.
· Ability to teach in German is an advantage (alternatively, an
indication to do so from the 2nd year on).
· Skills and motivation to communicate and interact with other
scientists.

The Christian-Albrechts-University sees itself as a modern and
cosmopolitan employer. We welcome your application regardless of your age,
gender, cultural and social background, religion, ideology, disability
or sexual identity. We promote equality of the sexes.

The Christian-Albrechts-University is committed to the employment of
people with disabilities. Preference will be given to applications from
severely handicapped persons and persons of equal standing, provided
they are suitable.

We expressly welcome applications from people with a migration background.

For enquiries regarding the position, teaching obligations and research
topic please contact Prof. Tal Dagan: tdagan@ifam.uni-kiel.de.

Applications should be submitted by email to Mrs. Haacks
(dhaacks@ifam.uni-kiel.de) as a single PDF and include: (1) a letter of
motivation (max 1 page, Arial 11, line spacing 1.15), (2) CV, (3) PhD
certificate. Please use 'GMG postdoc application - [your name]'
as a subject.

Please, refrain from sending us application photos.

Application deadline: August 31 2021 or until the position is
filled. Interviews will take place during September/October 2021. The
planned starting date for the position is flexible (but in 2021).